Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians
DOI10.1137/18M1231511zbMath1457.81009arXiv1801.03922WikidataQ114074271 ScholiaQ114074271MaRDI QIDQ5149753
Guang Hao Low, Robin Kothari, Jeongwan Haah, Matthew B. Hastings
Publication date: 8 February 2021
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.03922
Quantum computation (81P68) Statistical mechanics of crystals (82D25) Selfadjoint operator theory in quantum theory, including spectral analysis (81Q10) Computational methods for problems pertaining to quantum theory (81-08) Simulation of dynamical systems (37M05) Applications to the sciences (65Z05) Approximation algorithms (68W25) Polylogarithms and relations with (K)-theory (11G55) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum gates (81P65)
Related Items
Cites Work
- Lieb-Robinson bounds and the exponential clustering theorem
- Spectral gap and exponential decay of correlations
- Efficient quantum algorithms for simulating sparse Hamiltonians
- EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS
- Practical Approximation of Single-Qubit Unitaries by Single-Qubit Quantum Clifford and T Circuits
- Universal Quantum Simulators
- On the Product of Semi-Groups of Operators
- Adiabatic quantum state generation and statistical zero knowledge
- General theory of fractal path integrals with applications to many-body theories and statistical physics
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- The Theory of Quantum Information
- Toward the first quantum simulation with quantum speedup
- Mapping local Hamiltonians of fermions to local Hamiltonians of spins
- Fast universal quantum computation with railroad-switch local Hamiltonians
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
