17 citations · 44 across the 7 of their papers we have counts for
7 papers · 1 filter
An end-to-end quantum algorithm for weakly nonlinear plasma physics with superquadratic speedup
Bjorn K. Berntson, David Jennings, Matteo Lostaglio +1
Nonlinear kinetic plasma simulation is high-dimensional and classically demanding, while quantum algorithms face different bottlenecks: embedding nonlinear dynamics into a linear c…
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…
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(…
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…