343 citations · 534 across the 25 of their papers we have counts for
4 papers · 1 filter
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 Computation of Electronic Structure with Projector Augmented-Wave Method and Plane Wave Basis Set
Aleksei V. Ivanov, Andrew Patterson, Marius Bothe +6
Quantum simulation of materials is a promising application area of quantum computers. To practically realize this promise, we must reduce quantum resources while maintaining accura…
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…