Faster quantum simulation by randomization
Product formulas can be used to simulate Hamiltonian dynamics on a quantum computer by approximating the exponential of a sum of operators by a product of exponentials of the individual summands. This approach is both straightforward and surprisingly efficient. We show that by simply randomizing how...
Main Authors: | Andrew M. Childs, Aaron Ostrander, Yuan Su |
---|---|
Format: | Article |
Language: | English |
Published: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2019-09-01
|
Series: | Quantum |
Online Access: | https://quantum-journal.org/papers/q-2019-09-02-182/pdf/ |
Similar Items
-
Clifford recompilation for faster classical simulation of quantum circuits
by: Hammam Qassim, et al.
Published: (2019-08-01) -
Faster Algorithms for Computing the Stationary Distribution, Simulating Random Walks, and More
by: Peng, Richard, et al.
Published: (2018) -
Simulated Quantum Annealing Can Be Exponentially Faster Than Classical Simulated Annealing
by: Crosson, Elizabeth, et al.
Published: (2021) -
Simulated Quantum Annealing Can Be Exponentially Faster Than Classical Simulated Annealing
by: Crosson, Elizabeth, et al.
Published: (2022) -
Faster Together: Collective Quantum Search
by: Demosthenes Ellinas, et al.
Published: (2015-07-01)