Faster quantum chemistry simulation on fault-tolerant quantum computers
Open accessThe DOI matches its Crossref record; 99 of the 99 references it cites were found in a registry or an index.
Abstract
Quantum computers can in principle simulate quantum physics exponentially faster than their classical counterparts, but some technical hurdles remain.We propose methods which substantially improve the performance of a particular form of simulation, ab initio quantum chemistry, on faulttolerant quantum computers; these methods generalize readily to other quantum simulation problems.Quantum teleportation plays a key role in these improvements and is used extensively as a computing resource.To improve execution time, we examine techniques for constructing arbitrary gates which perform substantially faster than circuits based on the conventional Solovay-Kitaev algorithm (Dawson and Nielsen 2006 Quantum Inform.Comput.6 81).For a given approximation error , arbitrary single-qubit gates can be 7
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
Figures

![Figure 1 Schematic of a digital quantum simulation algorithm for energy eigenvalue estimation [2, 9]. The three main steps are state preparation, simulated evolution, and readout; this investigation focuses on the middle process. After preparing an initial state | ψ 0 〉 , the system is evolved in simulated time by solving the time-dependent Schr¨ odinger equation. Note the system propagators U ( 2 x δ t ) are controlled by qubits in a register representing simulated time. A quantum Fourier transform (QFT) on the time register provides an estimate of an energy eigenvalue. The accuracy of the simulation depends on suppressing errors in both state preparation and simulated-time evolution, which is why fault tolerance is an important consideration for quantum simulation algorithms.](https://figures.cochat.ai/paper-figures/8843cdbe759b431688166565519407d2/faster-quantum-chemistry-simulation-on-fault-tolerant-quantum-computers-figure-1.png)





![Figure 5 Quantum computing resources required to produce a fault-tolerant single-qubit phase rotation to accuracy ϵ = dist 2 ( RZ (φ), U approx ) using various methods. (Top) Circuit depth for single-qubit rotations. (Bottom) Number of T gates required for each rotation. There is variation in the resources required for Solovay-Kitaev sequences, Fowler sequences, and PARs; each point is the mean number of gates required, and where applicable, the bars show plus / minus one standard deviation. The Solovay-Kitaev data is averaged over 9534 random angles ( φ ), and the Fowler data is averaged over 98 random angles per point. Fowler sequences are numerically intensive to calculate, so curves fit to the data are shown for ϵ ⩽ 10 -3 : depth =-24 . 9 log 10 ϵ -7 . 64 and T gates = -9 . 75 log 10 ϵ -2 . 81. Phase kickback is implemented here with a ripple-carry adder [52]. PARs use six pre-computed ancillas. Solovay-Kitaev sequences were calculated using code written by Dawson and Nielsen [32]; Fowler sequences were calculated using code written by Fowler.](https://figures.cochat.ai/paper-figures/60bd2c4ce777407fad7c1406369c5f72/faster-quantum-chemistry-simulation-on-fault-tolerant-quantum-computers-figure-5.png)
![Figure 6 Excitation operator e -i h 12 ( a † 1 a 2+ a † 2 a 1 )δ t encoded into a quantum circuit [14]. Above, θ = h 12 δ t . The gate RX ( -π/ 2 ) = H · S † · H is available from the set in table 1. In this example, the control qubit | t 〉 is used for phase estimation, and the qubits | χ 1 〉 and | χ 2 〉 are basis functions (e.g. molecular orbitals). The controlled phase rotations CR Z (θ) must be approximated using circuits of available fault-tolerant gates.](https://figures.cochat.ai/paper-figures/10df1e7955e04648be9df440b9768440/faster-quantum-chemistry-simulation-on-fault-tolerant-quantum-computers-figure-6.png)


![Figure 9 Circuit depth for controlled phase rotations using various methods. A desired controlled rotation CR Z (φ) is approximated with a fault-tolerant circuit U approx with accuracy ϵ = dist 4 ( U approx , CR Z (φ)) using the method in figure 8. Solovay-Kitaev sequences are omitted here to permit comparison of the more efficient schemes on a linear scale. The bars on Fowler sequence data indicate the standard deviation taken over 98 random-angle rotations. The controlled-PARs have a depth of four gates, on average, regardless of rotation accuracy. Phase kickback uses a ripple-carry adder since the addends have less than 16 bits [52]. If very high precision were desired, a carry-lookahead adder can achieve depth O ( log log ϵ) at the expense of additional qubits and parallel circuits (more T gates) [53].](https://figures.cochat.ai/paper-figures/d5d0f5113aab42918a903d1f759d314c/faster-quantum-chemistry-simulation-on-fault-tolerant-quantum-computers-figure-9.png)






![Figure 15 QVR using phase kickback. This circuit implements the operation in equation (18) with scaling factor [ ξ ], which has been 'programmed' into the phase kickback register | γ ( k [ ξ ] ) 〉 (see appendix B). A control qubit | t 〉 is included for illustration. This figure shows how the bits in the adder are aligned for different cases. (a) The register | θ 〉 is shifted down p bits since p ⩾ 0. θ 0 is the least-significant bit in the | θ 〉 register, etc. The input qubits above | θ 〉 are logical zeros. (b) The register | θ 〉 is shifted up | p | bits since p < 0. In this case, the | p | most-significant bits of | θ 〉 are not used in the adder.](https://figures.cochat.ai/paper-figures/77a4629908294568abfb8610354d7cb5/faster-quantum-chemistry-simulation-on-fault-tolerant-quantum-computers-figure-15.png)




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.
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
“The time the quantum computer must remain coherent is determined by the necessity of O(p−1) successive applications of , each of which can require on the order of millions or billions of quantum gates for practical applications1719, as compared to the tens to hundreds of gates achievable in the short term.”
From A variational eigenvalue solver on a photonic quantum processor (2014) · cites this paper as [19]
Experimental — accuracy not yet measuredThe check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“UCCSD has been implemented in combination with different basis set representations of the chemistry Hamiltonian, including the particle/hole basis 327 and the Bogoliubov basis 326 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [326]
Experimental — accuracy not yet measuredThe check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“Given the inherent advantage in implementing the ansatz as well as the high accuracies of CC methods, the application of the UCC ansatz truncated up to single and double excitations (UCCSD) has been investigated both theoretically and experimentally 52,53,59,325-330 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [326]
Experimental — accuracy not yet measuredThe check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“Methods for preparing Slater determinants and general FGSs employ a quadratic number of gates 302,326,335,336 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [326]
Experimental — accuracy not yet measuredThe check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“Dallaire-Demers et al. 326 suggest that a similar circuit template could be used to create a variational ansatz by complementing the list of matchgates with neighboring ZZ interactions, allowing for the preparation of non-Gaussian fermionic states.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [326]
Experimental — accuracy not yet measured
8 more claims about this paper
Create a free account to see every claim other papers make about this one.
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
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
General atomic and molecular electronic structure system
Schmidt, M. W., Baldridge, K. K., Boatz, J. A., Elbert, S. T., Gordon, M. S., Jensen, J. H., Koseki, S., Matsunaga, N., Nguyen, K. A., Su, S., et al. (1993) · Journal of Computational Chemistry · doi:10.1002/jcc.540141112 · Cited by 20,204
Quantum computation and quantum information
Law, J. (2001) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/505482.505499 · Cited by 18,842
Quantum Computation and Quantum Information: 10th Anniversary Edition
Nielsen, M. A., & Chuang, I. L. (2012) · doi:10.1017/cbo9780511976667 · Cited by 8,436
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Dunning, T. H. (1970) · The Journal of Chemical Physics · doi:10.1063/1.1674408 · Cited by 5,032
Hehre, W. J., Stewart, R. F., & Pople, J. A. (1969) · The Journal of Chemical Physics · doi:10.1063/1.1672392 · Cited by 4,204
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 5×
“Several possible simulators have been proposed and studied [12, 17–20], but we focus on fault-tolerant circuit-model quantum simulation in this investigation [2, 4, 7, 13,21–24].”
BackgroundMethodInfluentialMolecular Electronic‐Structure Theory
Helgaker, T., Jørgensen, P., & Olsen, J. (2000) · doi:10.1002/9781119019572 · Cited by 2,594
Dunning, T. H. (1971) · The Journal of Chemical Physics · doi:10.1063/1.1676139 · Cited by 2,191
Cited by
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
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
Self-citationQuantum 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
Self-citationQuantum 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
Self-citationScalable Quantum Simulation of Molecular Energies
O’Malley, P. J. J., Babbush, R., Kivlichan, I. D., Romero, J., McClean, J. R., Barends, R., Kelly, J., Roushan, P., Tranter, A., Ding, N., et al. (2016) · Physical Review X · doi:10.1103/physrevx.6.031007 · Cited by 1,059
Self-citation
Metadata
- Authors
- Cody Jones, N., Whitfield, J. D., McMahon, P. L., Yung, M.-H., Meter, R. V., Aspuru-Guzik, A., & Yamamoto, Y.
- Affiliations
- Harvard University (US)
- Stanford University (US)
- Keio University (JP)
- National Institute of Informatics (JP)
- Venue
- New Journal of Physics
- Publisher
- IOP Publishing
- Published
- 2012-11-27
- Volume
- 14
- Issue
- 11
- Pages
- 115023
- ISSN
- 1367-2630 (ISSN-L)
- OpenAlex
- W2100129648
- Cited by
- 145
- References
- 97
- Citations by year
- 2026: 8 · 2025: 6 · 2024: 12 · 2023: 9 · 2022: 10 · 2021: 5 · 2020: 11 · 2019: 14 · 2018: 15 · 2017: 4 · 2016: 11 · 2015: 15 · 2014: 12 · 2013: 10 · 2012: 3
- FWCI
- 12.60
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- cc-by-nc-sa
- Locations
- New Journal of Physics (publishedVersion, cc-by-nc-sa)
- arXiv (Cornell University) (submittedVersion)
- Digital Access to Scholarship at Harvard (DASH) (Harvard University) (submittedVersion, cc-by)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion)
- arXiv (Cornell University)
- Funders
- National Science Foundation (0829694, FA8721-05-C-0002, 1017244)
- Alfred P. Sloan Foundation
- Camille and Henry Dreyfus Foundation
- Japan Society for the Promotion of Science
- National Institute of Information and Communications Technology
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- quantum chemistry simulation, fault-tolerant quantum computing, ab initio quantum chemistry, quantum teleportation, gate construction, quantum circuit optimization, execution time
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: Faster quantum chemistry simulation on fault-tolerant quantum computers. https://app.cochat.ai/papers/10.1088/1367-2630/14/11/115023
- The paper
- Cody Jones, N., Whitfield, J. D., McMahon, P. L., Yung, M.-H., Meter, R. V., Aspuru-Guzik, A., & Yamamoto, Y. (2012). Faster quantum chemistry simulation on fault-tolerant quantum computers. New Journal of Physics. https://doi.org/10.1088/1367-2630/14/11/115023
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.