From the 1 of 7 linked papers with an AI index.
7 papers
An end-to-end quantum algorithm for weakly nonlinear plasma physics with superquadratic speedup
Bjorn K. Berntson, David Jennings, Matteo Lostaglio +1
The paper presents a complete quantum algorithm for simulating a weakly nonlinear kinetic plasma model, using Carleman linearization, hierarchical block encoding, and a specialized…
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…
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…
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…
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…