190 citations · 193 across the 4 of their papers we have counts for
5 papers
More efficient Clifford+T synthesis for small-angle rotations and application to Trotterization
Marius Bothe, Christoph Sünderhauf, Michael J. Witham +2
Clifford+T synthesis of rotation gates is an important routine in fault-tolerant quantum compilation. While Clifford+T synthesis is scalable, it has a high overhead of tens of T ga…
Matrix inversion polynomials for the quantum singular value transformation
Christoph Sünderhauf, Zalán Németh, Adnaan Walayat +2
Quantum matrix inversion with the quantum singular value transformation (QSVT) requires a polynomial approximation to . Several methods from the literature construct polynomia…
Fault-tolerant quantum simulation of generalized Hubbard models
Andreas Juul Bay-Smidt, Frederik Ravn Klausen, Christoph Sünderhauf +3
Quantum simulations of strongly interacting fermionic systems, such as those described by the Hubbard model, are promising candidates for useful early fault-tolerant quantum comput…
Generalized Quantum Singular Value Transformation
Christoph Sünderhauf
The quantum singular value transformation has revolutionised quantum algorithms. By applying a polynomial to an arbitrary matrix, it provides a unifying picture of quantum algorith…
A perspective on the current state-of-the-art of quantum computing for drug discovery applications
Nick S. Blunt, Joan Camps, Ophelia Crawford +9
Computational chemistry is an essential tool in the pharmaceutical industry. Quantum computing is a fast evolving technology that promises to completely shift the computational cap…