65 citations · 197 across the 9 of their papers we have counts for
9 papers
Two exact quantum signal processing results
Bjorn K. Berntson, Christoph Sünderhauf
Quantum signal processing (QSP) is a framework for implementing certain polynomial functions via quantum circuits. To construct a QSP circuit, one needs (i) a target polynomial $P(…
Preconditioned Block Encodings for Quantum Linear Systems
Leigh Lapworth, Christoph Sünderhauf
Quantum linear system solvers like the Quantum Singular Value Transformation (QSVT) require a block encoding of the system matrix within a unitary operator . Unfortunately…
Pauli Decomposition via the Fast Walsh-Hadamard Transform
Timothy N. Georges, Bjorn K. Berntson, Christoph Sünderhauf +1
The decomposition of a square matrix into a sum of Pauli strings is a classical pre-processing step required to realize many quantum algorithms. Such a decomposition requires signi…
Quantum Simulations of Chemistry in First Quantization with any Basis Set
Timothy N. Georges, Marius Bothe, Christoph Sünderhauf +3
Quantum computation of the energy of molecules and materials is one of the most promising applications of fault-tolerant quantum computers. Practical applications require developme…
Complementary polynomials in quantum signal processing
Bjorn K. Berntson, Christoph Sünderhauf
Quantum signal processing is a framework for implementing polynomial functions on quantum computers. To implement a given polynomial , one must first construct a corresponding c…
Block-encoding structured matrices for data input in quantum computing
Christoph Sünderhauf, Earl Campbell, Joan Camps
The cost of data input can dominate the run-time of quantum algorithms. Here, we consider data input of arithmetically structured matrices via block encoding circuits, the input mo…
Quantum Computation for Periodic Solids in Second Quantization
Aleksei V. Ivanov, Christoph Sünderhauf, Nicole Holzmann +4
In this work, we present a quantum algorithm for ground-state energy calculations of periodic solids on error-corrected quantum computers. The algorithm is based on the sparse qubi…
Localization with random time-periodic quantum circuits
Christoph Sünderhauf, David Pérez-García, David A. Huse +2
We consider a random time evolution operator composed of a circuit of random unitaries coupling even and odd neighboring spins on a chain in turn. In spirit of Floquet evolution, t…
Behavior of eigenvalues in a region of broken-PT symmetry
Carl M. Bender, Nima Hassanpour, Daniel W. Hook +3
PT-symmetric quantum mechanics began with a study of the Hamiltonian . When , the eigenvalues of this non-Hermitian Hamiltonian are dis…