Low-cost quantum circuits for classically intractable instances of the Hamiltonian dynamics simulation problem
Open accessThe DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Abstract
We develop circuit implementations for digital-level quantum Hamiltonian dynamics simulation algorithms suitable for implementation on a reconfigurable quantum computer, such as trapped ions. Our focus is on the codesign of a problem, its solution, and quantum hardware capable of executing the solution at the minimal cost expressed in terms of the quantum computing resources used, while demonstrating the solution of an instance of a scientifically interesting problem that is intractable classically. The choice for Hamiltonian dynamics simulation is due to the combination of its usefulness in the study of equilibrium in closed quantum mechanical systems, a low cost in the implementation by quantum algorithms, and the difficulty of classical simulation. By targeting a specific type of quantum computer and tailoring the problem instance and solution to suit physical constraints imposed by the hardware, we are able to reduce the resource counts by a factor of 10 in a physical-level implementation and a factor of 30–60 in a fault-tolerant implementation over state-of-the-art.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Probing many-body dynamics on a 51-atom quantum simulator
Bernien, H., Schwartz, S., Keesling, A., Levine, H., Omran, A., Pichler, H., Choi, S., Zibrov, A. S., Endres, M., Greiner, M., et al. (2017) · Nature · doi:10.1038/nature24622 · Cited by 2,460
The finite group velocity of quantum spin systems
Lieb, E. H., & Robinson, D. W. (1972) · Communications in Mathematical Physics · doi:10.1007/bf01645779 · Cited by 1,463
Characterizing quantum supremacy in near-term devices
Boixo, S., Isakov, S. V., Smelyanskiy, V. N., Babbush, R., Ding, N., Jiang, Z., Bremner, M. J., Martinis, J. M., & Neven, H. (2018) · Nature Physics · doi:10.1038/s41567-018-0124-x · Cited by 1,175
Observation of a many-body dynamical phase transition with a 53-qubit quantum simulator
Zhang, J., Pagano, G., Hess, P. W., Kyprianidis, A., Becker, P., Kaplan, H., Gorshkov, A. V., Gong, Z.-X., & Monroe, C. (2017) · Nature · doi:10.1038/nature24654 · Cited by 1,079 · cited 2×
“[12] J.”
MethodThe computational complexity of linear optics
Aaronson, S., & Arkhipov, A. (2011) · Proceedings of the forty-third annual ACM symposium on Theory of computing · doi:10.1145/1993636.1993682 · Cited by 874
Elucidating reaction mechanisms on quantum computers
Reiher, M., Wiebe, N., Svore, K. M., Wecker, D., & Troyer, M. (2017) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1619152114 · Cited by 745 · cited 3×
“For the various similarly-spirited previous work, see [4] for Shor, [3] for FeMoco, [5] for Hubbard and Jellium, and [6] for Heisenberg Hamiltonian over cycle (C).”
MethodEfficient Quantum Algorithms for Simulating Sparse Hamiltonians
Berry, D. W., Ahokas, G., Cleve, R., & Sanders, B. C. (2007) · Communications in Mathematical Physics · doi:10.1007/s00220-006-0150-x · Cited by 692
Toward the first quantum simulation with quantum speedup
Childs, A. M., Maslov, D., Nam, Y., Ross, N. J., & Su, Y. (2018) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1801723115 · Cited by 551
Self-citation(2016) · doi:10.1103/physrevlett.117.060505 · Cited by 540
Optimal quantum circuits for general two-qubit gates
Vatan, F., & Williams, C. (2004) · Physical Review A · doi:10.1103/physreva.69.032315 · Cited by 443 · cited 2×
“[32] F.”
Cited by
Quantum Algorithms for Quantum Chemistry and Quantum Materials Science
Bauer, B., Bravyi, S., Motta, M., & Chan, G. K.-L. (2020) · Chemical Reviews · doi:10.1021/acs.chemrev.9b00829 · Cited by 848
Quantum simulation and computing with Rydberg-interacting qubits
Morgado, M., & Whitlock, S. (2021) · AVS Quantum Science · doi:10.1116/5.0036562 · Cited by 370
Strategies for solving the Fermi-Hubbard model on near-term quantum computers
Cade, C., Mineh, L., Montanaro, A., & Stanisic, S. (2020) · Physical Review B · doi:10.1103/physrevb.102.235122 · Cited by 178
“This is significantly lower than the complexity for time-dynamics simulation reported in [5–7], but is still beyond the capabilities of today’s quantum computing hardware.”
BackgroundKivlichan, I. D., Gidney, C., Berry, D. W., Wiebe, N., McClean, J., Sun, W., Jiang, Z., Rubin, N., Fowler, A., Aspuru-Guzik, A., et al. (2020) · Quantum · doi:10.22331/q-2020-07-16-296 · Cited by 173
A Domain-agnostic, Noise-resistant, Hardware-efficient Evolutionary Variational Quantum Eigensolver
Rattew, A. G., Hu, S., Pistoia, M., Chen, R., & Wood, S. (2019) · arXiv · doi:10.48550/arxiv.1910.09694 · Cited by 59
Metadata
- Authors
- Nam, Y., & Maslov, D.
- Venue
- npj Quantum Information
- Published
- 2019-05-27
- Volume
- 5
- Issue
- 1
- ISSN
- 2056-6387 (ISSN-L)
- OpenAlex
- W2803079534
- Cited by
- 41
- References
- 14
- FWCI
- 3.22
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Low-cost quantum circuits for classically intractable instances of the Hamiltonian dynamics simulation problem. https://app.cochat.ai/papers/10.1038/s41534-019-0152-0
- The paper
- Nam, Y., & Maslov, D. (2019). Low-cost quantum circuits for classically intractable instances of the Hamiltonian dynamics simulation problem. npj Quantum Information. https://doi.org/10.1038/s41534-019-0152-0
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.