The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
Quantum Algorithms for Quantum Field Theories
Open accessAbstract
Quantum Leap?: Quantum computers are expected to be able to solve some of the most difficult problems in mathematics and physics. It is not known, however, whether quantum field theories (QFTs) can be simulated efficiently with a quantum computer. QFTs are used in particle and condensed matter physics and have an infinite number of degrees of freedom; discretization is necessary to simulate them digitally. Jordan et al. (p. 1130 ; see the Perspective by Hauke et al. ) present an algorithm for the efficient simulation of a particular kind of QFT (with quartic interactions) and estimate the error caused by discretization. Even for the most difficult case of strong interactions, the run time of the algorithm was polynomial (rather than exponential) in parameters such as the number of particles, their energy, and the prescribed precision, making it much more efficient than the best classical algorithms.
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
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Introduction to Quantum Field Theory
Milonni, P. W. (1994) · The Quantum Vacuum · doi:10.1016/b978-0-08-057149-2.50014-x · Cited by 4,040
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088
Matrix multiplication via arithmetic progressions
Coppersmith, D., & Winograd, S. (1990) · Journal of Symbolic Computation · doi:10.1016/s0747-7171(08)80013-2 · Cited by 2,248
Ultracold atomic gases in optical lattices: mimicking condensed matter physics and beyond
Lewenstein, M., Sanpera, A., Ahufinger, V., Damski, B., Sen(De), A., & Sen, U. (2007) · Advances in Physics · doi:10.1080/00018730701223200 · Cited by 2,104
Critical Exponents for the n -Vector Model in Three Dimensions from Field Theory
Guillou, J. C. L., & Zinn‐Justin, J. (1977) · Physical Review Letters · doi:10.1103/physrevlett.39.95 · Cited by 1,224
An open-system quantum simulator with trapped ions
Barreiro, J. T., Müller, M., Schindler, P., Nigg, D., Monz, T., Chwalla, M., Hennrich, M., Roos, C. F., Zoller, P., & Blatt, R. (2011) · Nature · doi:10.1038/nature09801 · Cited by 1,100
Weimer, H., Müller, M., Lesanovsky, I., Zoller, P., & Büchler, H. P. (2010) · Nature Physics · doi:10.1038/nphys1614 · Cited by 867
Suzuki, M. (1990) · Physics Letters A · doi:10.1016/0375-9601(90)90962-n · Cited by 853
Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
Abrams, D. S., & Lloyd, S. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.2586 · Cited by 745
Cited by
Georgescu, I. M., Ashhab, S., & Nori, F. (2014) · Reviews of Modern Physics · doi:10.1103/revmodphys.86.153 · Cited by 2,932
“Another proposal for the DQS of field theories was given in (Jordan et al., 2012).”
BackgroundMajorana zero modes and topological quantum computation
Sarma, S. D., Freedman, M., & Nayak, C. (2015) · npj Quantum Information · doi:10.1038/npjqi.2015.1 · Cited by 1,180
Quantum algorithms: an overview
Montanaro, A. (2016) · npj Quantum Information · doi:10.1038/npjqi.2015.23 · Cited by 1,071
“Examples include work on increasing the accuracy of quantum simulation while retaining a fast runtime [14]; optimising the algorithm for particular applications such as quantum chemistry [48]; and exploring applications to new areas such as quantum (cid:12)eld theory [53].”
Real-time dynamics of lattice gauge theories with a few-qubit quantum computer
Martinez, E. A., Muschik, C. A., Schindler, P., Nigg, D., Erhard, A., Heyl, M., Hauke, P., Dalmonte, M., Monz, T., Zoller, P., et al. (2016) · Nature · doi:10.1038/nature18318 · Cited by 808
Self-verifying variational quantum simulation of lattice models
Kokail, C., Maier, C., van Bijnen, R., Brydges, T., Joshi, M. K., Jurcevic, P., Muschik, C. A., Silvi, P., Blatt, R., Roos, C. F., et al. (2019) · Nature · doi:10.1038/s41586-019-1177-4 · Cited by 594
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
Simulating lattice gauge theories within quantum technologies
Bañuls, M. C., Blatt, R., Catani, J., Celi, A., Cirac, J. I., Dalmonte, M., Fallani, L., Jansen, K., Lewenstein, M., Montangero, S., et al. (2020) · The European Physical Journal D · doi:10.1140/epjd/e2020-100571-8 · Cited by 500
Jerusalem lectures on black holes and quantum information
Harlow, D. (2016) · Reviews of Modern Physics · doi:10.1103/revmodphys.88.015002 · Cited by 480
Theory of Trotter Error with Commutator Scaling
Childs, A. M., Su, Y., Tran, M. C., Wiebe, N., & Zhu, S. (2021) · Physical Review X · doi:10.1103/physrevx.11.011020 · Cited by 451
Quantum-classical computation of Schwinger model dynamics using quantum computers
Klco, N., Dumitrescu, E. F., McCaskey, A. J., Morris, T. D., Pooser, R. C., Sanz, M., Solano, E., Lougovski, P., & Savage, M. J. (2018) · Physical Review A · doi:10.1103/physreva.98.032331 · Cited by 437
Simulating lattice gauge theories within quantum technologies
Bañuls, M. C., Blatt, R., Catani, J., Celi, A., Cirac, J. I., Dalmonte, M., Fallani, L., Jansen, K., Lewenstein, M., Montangero, S., et al. (2019) · Apollo (University of Cambridge) · doi:10.17863/cam.55853 · Cited by 430
Quantum simulations of lattice gauge theories using ultracold atoms in optical lattices
Zohar, E., Cirac, J. I., & Reznik, B. (2016) · Reports on Progress in Physics · doi:10.1088/0034-4885/79/1/014401 · Cited by 422
Circuit complexity in quantum field theory
Jefferson, R. A., & Myers, R. C. (2017) · Journal of High Energy Physics · doi:10.1007/jhep10(2017)107 · Cited by 412
Ultracold quantum gases and lattice systems: quantum simulation of lattice gauge theories
Wiese, U. ‐. (2013) · Annalen der Physik · doi:10.1002/andp.201300104 · Cited by 379
Quantum Simulation for High-Energy Physics
Bauer, C. W., Davoudi, Z., Balantekin, A. B., Bhattacharya, T., Carena, M., de Jong, W. A., Draper, P., El-Khadra, A., Gemelke, N., Hanada, M., et al. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.027001 · Cited by 326
Self-citationQuantum computing and the entanglement frontier
Preskill, J. (2012) · arXiv · doi:10.48550/arxiv.1203.5813 · Cited by 308
Self-citationHigh-order quantum algorithm for solving linear differential equations
Berry, D. W. (2014) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/47/10/105301 · Cited by 277
Cold-Atom Quantum Simulator for SU(2) Yang-Mills Lattice Gauge Theory
Zohar, E., Cirac, J. I., & Reznik, B. (2013) · Physical Review Letters · doi:10.1103/physrevlett.110.125304 · Cited by 262
Quantum computation vs. firewalls
Harlow, D., & Hayden, P. (2013) · Journal of High Energy Physics · doi:10.1007/jhep06(2013)085 · Cited by 310
Faster quantum chemistry simulation on fault-tolerant quantum computers
Cody Jones, N., Whitfield, J. D., McMahon, P. L., Yung, M.-H., Meter, R. V., Aspuru-Guzik, A., & Yamamoto, Y. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/11/115023 · Cited by 145
A review of Quantum Cellular Automata
Farrelly, T. (2020) · Quantum · doi:10.22331/q-2020-11-30-368 · Cited by 138
Johnson, T. H., Clark, S. R., & Jaksch, D. (2014) · EPJ Quantum Technology · doi:10.1140/epjqt10 · Cited by 127
Measurement reduction in variational quantum algorithms
Zhao, A., Tranter, A., Kirby, W. M., Ung, S. F., Miyake, A., & Love, P. J. (2020) · Physical Review A · doi:10.1103/physreva.101.062322 · Cited by 121
Efficient quantum circuits for diagonal unitaries without ancillas
Welch, J., Greenbaum, D., Mostame, S., & Aspuru-Guzik, A. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/3/033040 · Cited by 114
Quantum Algorithm for Spectral Measurement with a Lower Gate Count
Poulin, D., Kitaev, A., Steiger, D. S., Hastings, M. B., & Troyer, M. (2018) · Physical Review Letters · doi:10.1103/physrevlett.121.010501 · Cited by 108
Quantum simulation with hybrid tensor networks
Yuan, X., Sun, J., Liu, J., Zhao, Q., & Zhou, Y. (2020) · arXiv · doi:10.48550/arxiv.2007.00958 · Cited by 79
Scaling of variational quantum circuit depth for condensed matter systems
Bravo-Prieto, C., Lumbreras-Zarapico, J., Tagliacozzo, L., & Latorre, J. I. (2020) · Quantum · doi:10.22331/q-2020-05-28-272 · Cited by 66
Fast quantum computation at arbitrarily low energy
Jordan, S. P. (2017) · Physical Review A · doi:10.1103/physreva.95.032305 · Cited by 40
Self-citationDirac Cellular Automaton from Split-step Quantum Walk
Mallick, A., & Chandrashekar, C. M. (2016) · Scientific Reports · doi:10.1038/srep25779 · Cited by 45
“+ − − + − ( ) H k i V V H k i V V ( ) ln 0 0 ln ( ) ln( ) 1 0 0 1 (44) SQW SQW 1 1 ”
BackgroundDirac particle dynamics of a superconducting circuit
Svetitsky, E., & Katz, N. (2019) · Physical Review A · doi:10.1103/physreva.99.042308 · Cited by 3
Metadata
- Authors
- Jordan, S. P., Lee, K. S. M., & Preskill, J.
- Venue
- Science
- Published
- 2012-06
- Volume
- 336
- Issue
- 6085
- Pages
- 1130-1133
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W1982899292
- Cited by
- 517
- References
- 43
- FWCI
- 19.31
- Type
- journal article
- Language
- en
- Open access
- green
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
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.