The DOI matches its Crossref record; 116 of the 118 references it cites were found in a registry or an index.
Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
Open accessAbstract
We construct quantum circuits that exactly encode the spectra of correlated electron models up to errors from rotation synthesis.By invoking these circuits as oracles within the recently introduced "qubitization" framework, one can use quantum phase estimation to sample states in the Hamiltonian eigenbasis with optimal query complexity Oðλ=ϵÞ, where λ is an absolute sum of Hamiltonian coefficients and ϵ is the target precision.For both the Hubbard model and electronic structure Hamiltonian in a second quantized basis diagonalizing the Coulomb operator, our circuits have T-gate complexity O(N þ logð1=ϵÞ), where N is the number of orbitals in the basis.This scenario enables sampling in the eigenbasis of electronic structure Hamiltonians with T complexity O(N 3 =ϵ þ N 2 logð1=ϵÞ=ϵ).Compared to prior approaches, our algorithms are asymptotically more efficient in gate complexity and require fewer T gates near the classically intractable regime.Compiling to surface code fault-tolerant gates and assuming per-gate error rates of one part in a thousand reveals that one can error correct phase estimation on interesting instances of these problems beyond the current capabilities of classical methods using only about a million superconducting qubits in a matter of hours.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Using Babbush et al.'s QROM read (section 3A of [2]), each table lookup has a Toffoli count and measurement depth of 2 c mul + c exp and uses a negligible O ( c mul + c exp ) ancillae.”
From How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits (2021) · cites this paper as [2]
Experimental — accuracy not yet measuredIn the citing paper
“Crosson et al. 298 demonstrated that this effect is common even for instances that do not exhibit noticeable symmetries.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [298]
In the citing paper
“Note that it is not always necessary to reach the adiabatic regime to achieve a significant overlap with the ground state.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [298]
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
Hohenberg, P., & Kohn, W. (1964) · Physical Review · doi:10.1103/physrev.136.b864 · Cited by 53,541
Ground State of the Electron Gas by a Stochastic Method
Ceperley, D. M., & Alder, B. J. (1980) · Physical Review Letters · doi:10.1103/physrevlett.45.566 · Cited by 14,561
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Electron correlations in narrow energy bands
Hubbard, J. (1963) · Proceedings of the Royal Society of London A Mathematical and Physical Sciences · doi:10.1098/rspa.1963.0204 · Cited by 6,687
A variational eigenvalue solver on a photonic quantum processor
Peruzzo, A., McClean, J., Shadbolt, P., Yung, M.-H., Zhou, X.-Q., Love, P. J., Aspuru-Guzik, A., & O’Brien, J. L. (2014) · Nature Communications · doi:10.1038/ncomms5213 · Cited by 4,552 · cited 1×
“More recently, experimental demonstrations [11 – 15] have focused on the development of variational algorithms [16,17], which are often [18,19], but not always [20,21], inspired by time-evolution primitives.”
BackgroundSelf-citationLloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 1×
“Fourteen years later, Lloyd formalized the concept of a universal quantum simulator [3] and demonstrated an extension for treating systems of interacting electrons in second quantization [4].”
BackgroundSurface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059 · cited 2×
“We use the surface code [31 – 35], as it has the highest gate threshold error rate for this geometry.”
MethodSelf-citationHardware-efficient variational quantum eigensolver for small molecules and quantum magnets
Kandala, A., Mezzacapo, A., Temme, K., Takita, M., Brink, M., Chow, J. M., & Gambetta, J. M. (2017) · Nature · doi:10.1038/nature23879 · Cited by 2,982
Absence of Mott Transition in an Exact Solution of the Short-Range, One-Band Model in One Dimension
Lieb, E. H., & Wu, F. Y. (1968) · Physical Review Letters · doi:10.1103/physrevlett.20.1445 · Cited by 2,952
�ber das Paulische �quivalenzverbot
Jordan, P., & Wigner, E. (1928) · Zeitschrift f�r Physik · doi:10.1007/bf01331938 · Cited by 2,597 · cited 1×
“Mapping to qubits under the Jordan-Wigner transformation [61,76], Eq.”
Method
Research works printed but not linked: 2
- X. Fu, 2017, Proceedings of the 50th Annual IEEE/ACM International Symposium on Microarchitecture, Cambridge, Massachusetts, 2017
- D. Aharonov, 2003, Proceedings of the 35th ACM Symposium on Theory of Computing—STOC ’03
Cited by
Sorted by citations
Variational quantum algorithms
Cerezo, M., Arrasmith, A., Babbush, R., Benjamin, S. C., Endo, S., Fujii, K., McClean, J. R., Mitarai, K., Yuan, X., Cincio, L., et al. (2021) · Nature Reviews Physics · doi:10.1038/s42254-021-00348-9 · Cited by 3,385
Self-citationQuantum computational chemistry
McArdle, S., Endo, S., Aspuru-Guzik, A., Benjamin, S. C., & Yuan, X. (2020) · Reviews of Modern Physics · doi:10.1103/revmodphys.92.015003 · Cited by 1,621
Quantum Chemistry in the Age of Quantum Computing
Cao, Y., Romero, J., Olson, J. P., Degroote, M., Johnson, P. D., Kieferová, M., Kivlichan, I. D., Menke, T., Peropadre, B., Sawaya, N. P. D., et al. (2019) · Chemical Reviews · doi:10.1021/acs.chemrev.8b00803 · Cited by 1,560
Quantum Chemistry in the Age of Quantum Computing
Cao, Y., Romero, J., Olson, J., Degroote, M., Johnson, P., Kieferová, M., Kivlichan, I., Menke, T., Peropadre, B., Sawaya, N., et al. (n.d.) · OPUS - Open Publications of UTS Scholars (University of Technology Sydney) · Cited by 1,265
The Variational Quantum Eigensolver: A review of methods and best practices
Tilly, J., Chen, H., Cao, S., Picozzi, D., Setia, K., Li, Y., Grant, E., Wossnig, L., Rungger, I., Booth, G. H., et al. (2022) · Physics Reports · doi:10.1016/j.physrep.2022.08.003 · Cited by 1,031
Metadata
- Authors
- Babbush, R., Gidney, C., Berry, D. W., Wiebe, N., McClean, J., Paler, A., Fowler, A., & Neven, H.
- Affiliations
- Google (United States) (US)
- Macquarie University (AU)
- Microsoft (United States) (US)
- ORCID
- Venue
- Physical Review X
- Publisher
- American Physical Society (APS)
- Published
- 2018-10-23
- Volume
- 8
- Issue
- 4
- ISSN
- 2160-3308 (ISSN-L)
- OpenAlex
- W2801305581
- Cited by
- 383
- References
- 118
- Citations by year
- 2026: 45 · 2025: 82 · 2024: 52 · 2023: 49 · 2022: 43 · 2021: 41 · 2020: 35 · 2019: 32 · 2018: 4
- FWCI
- 15.90
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- Locations
- Physical Review X (publishedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- arXiv (Cornell University)
- Funders
- Australian Research Council (DP160102426)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Keywords
- quantum circuits, qubitization, quantum phase estimation, Hubbard model, superconducting qubits, query complexity, correlated electrons
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
