The quantum linear system problem provides one of the most enticing sources of exponential quantum speedups, and its resolution underlies other interesting quantum algorithms for differential equations and eigenvalue processing. The goal is to …
Many problems in linear algebra require processing eigenvalues of the input matrices. As eigenvalues are different from singular values for non-normal operators, these problems are out of reach of the existing quantum singular value algorithm and its …
Quantum dynamics can be simulated on a quantum computer by exponentiating elementary terms from the Hamiltonian in a sequential manner. However, such an implementation of Trotter steps has gate complexity depending on the total Hamiltonian term …
Quantum many-body systems involving bosonic modes or gauge fields have infinite-dimensional local Hilbert spaces which must be truncated to perform simulations of real-time dynamics on classical or quantum computers. To analyze errors resulting from …
This is a Perspective on "Fast-forwarding quantum evolution" by Shouzhen Gu, Rolando D. Somma, and Burak Şahinoğlu, published in Quantum 5, 577 (2021).
We consider simulating quantum systems on digital quantum computers. We show that the performance of quantum simulation can be improved by simultaneously exploiting commutativity of the target Hamiltonian, sparsity of interactions, and prior …
Simulating the dynamics of quantum systems is an important application of quantum computers and has seen a variety of implementations on current hardware. We show that by introducing quantum gates implementing unitary transformations generated by the …
The Lie-Trotter formula, together with its higher-order generalizations, provides a simple approach to decomposing the exponential of a sum of operators. Despite significant effort, the error scaling of such product formulas remains poorly …
The difficulty of simulating quantum dynamics depends on the norm of the Hamiltonian. When the Hamiltonian varies with time, the simulation complexity should only depend on this quantity instantaneously. We develop quantum simulation algorithms that …
The ability to implement the Quantum Fourier Transform (QFT) efficiently on a quantum computer facilitates the advantages offered by a variety of fundamental quantum algorithms, such as those for integer factoring, computing discrete logarithm over …