The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Halving the cost of quantum addition
Open accessAbstract
We improve the number of T gates needed to perform an n-bit adder from 8 n + O ( 1 ) to 4 n + O ( 1 ) . We do so via a "temporary logical-AND" construction which uses four T gates to store the logical-AND of two qubits into an ancilla and zero T gates to later erase the ancilla. This construction is equivalent to one by Jones, except that our framing makes it clear that the technique is far more widely applicable than previously realized. Temporary logical-ANDs can be applied to integer arithmetic, modular arithmetic, rotation synthesis, the quantum Fourier transform, Shor's algorithm, Grover oracles, and many other circuits. Because T gates dominate the cost of quantum computation based on the surface code, and temporary logical-ANDs are widely applicable, this represents a significant reduction in projected costs of quantum computation. In addition to our n-bit adder, we present an n-bit controlled adder circuit with T-count of 8 n + O ( 1 ) , a temporary adder that can be computed for the same cost as the normal adder but whose result can be kept until it is later uncomputed without using T gates, and discuss some other constructions whose T-count is improved by the temporary logical-AND.
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.
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 check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“The last strategy also has the potential to significantly reduce the number of gates required and provides approximate amplitudes for initializing the optimization, which has been pointed out as critical for improving convergence 329 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [329]
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 [329]
Experimental — accuracy not yet measuredIn the citing paper
“It has been pointed out that analytical gradients require orders-of-magnitude fewer measurements than numerical gradients 329 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [329]
In the citing paper
“This is in sharp contrast with VQE applied to electronic structure Hamiltonians 329 , where the conclusion is that analytical gradients offer a practical advantage over numerical gradients. The numerical gradients require a few orders of magnitude more measurements to achieve the same accuracy.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [329]
In the citing paper
“Several numerical studies comparing the efficacy of different optimization methods have been published since VQE was first introduced; the original paper 52 used Nelder-Mead, a simple derivative-free optimization algorithm.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [329]
1 more claim 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
Quantum Computation and Quantum Information: 10th Anniversary Edition
Nielsen, M. A., & Chuang, I. L. (2012) · doi:10.1017/cbo9780511976667 · Cited by 8,436
Elementary gates for quantum computation
Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., Sleator, T., Smolin, J. A., & Weinfurter, H. (1995) · Physical Review A · doi:10.1103/physreva.52.3457 · Cited by 4,311 · cited 5×
“Existing constructions implement the Cuccaro adder’s Toffolis using 8 n + O (1) T gates [3, 7, 1].”
BackgroundMethodInfluentialSurface 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×
“The surface code [5, 7, 9, 15, 16] is a quantum error correcting code that works on a 2D nearest-neighbour array of qubits and achieves a threshold error rate of approximately 1%.”
BackgroundDennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1499754 · Cited by 1,768 · cited 1×
“The surface code [5, 8, 21, 22, 11] is a quantum error correcting code that works on a 2D nearest-neighbour array of qubits and achieves a threshold error rate of approximately 1%.”
BackgroundSuperconducting quantum circuits at the surface code threshold for fault tolerance
Barends, R., Kelly, J., Megrant, A., Veitia, A., Sank, D., Jeffrey, E., White, T. C., Mutus, J., Fowler, A. G., Campbell, B., et al. (2014) · Nature · doi:10.1038/nature13171 · Cited by 1,733 · cited 1×
“…the architecture of future error corrected quantum computers, because 2D arrays of qubits with nearest-neighbor connections are possible with many qubit technologies [23, 4, 12, 18, 17] and other well understood error correcting codes either have lower thresholds or require stronger connectivity.”
BackgroundDennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2001) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,485
Classical and Quantum Computation
Kitaev, A., Shen, A., & Vyalyi, M. (2002) · Graduate Studies in Mathematics · doi:10.1090/gsm/047 · Cited by 1,387
A Regular Layout for Parallel Adders
Brent, & Kung (1982) · IEEE Transactions on Computers · doi:10.1109/tc.1982.1675982 · Cited by 1,147 · cited 1×
“Alternatively, by using temporary logical-ANDs to implement the classical Brent-Kung adder [6] in a reversible fashion, two n -bit numbers can be added in O (lg n ) depth with a T-count of only 12 n .”
MethodFault-Tolerant Quantum Computation with High Threshold in Two Dimensions
Raussendorf, R., & Harrington, J. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.190504 · Cited by 812 · cited 1×
“n+ O(1), an out-of-place adder that can be uncomputed without using T gates, and discuss some other constructions whose T-count is improved by the temporary logical-AND. Introduction The surface code [5,8,21,22,11] is a quantum error correcting code that works on a 2D nearest-neighbour array of qubits and achieves a t…”
BackgroundBuilding logical qubits in a superconducting quantum computing system
Gambetta, J. M., Chow, J. M., & Steffen, M. (2017) · npj Quantum Information · doi:10.1038/s41534-016-0004-0 · Cited by 622 · cited 1×
“…the architecture of future error corrected quantum computers, because 2D arrays of qubits with nearest-neighbor connections are possible with many qubit technologies [23, 4, 12, 18, 17] and other well understood error correcting codes either have lower thresholds or require stronger connectivity.”
BackgroundTopological fault-tolerance in cluster state quantum computation
Raussendorf, R., Harrington, J., & Goyal, K. (2007) · New Journal of Physics · doi:10.1088/1367-2630/9/6/199 · Cited by 617
Surface code quantum computing by lattice surgery
Horsman, D., Fowler, A. G., Devitt, S., & Meter, R. V. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/12/123011 · Cited by 598 · cited 1×
“For example, qubits that are idle can be compressed into an inactive “memory” form that covers six times fewer physical qubits than the double-defect form [13].”
BackgroundA Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits
Amy, M., Maslov, D., Mosca, M., & Roetteler, M. (2013) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2013.2244643 · Cited by 549 · cited 3×
“Existing constructions implement the Cuccaro adder’s Toffolis using 8n+O(1) T gates [3, 7, 1].”
BackgroundMethodInfluentialQuantum codes on a lattice with boundary
Bravyi, S. B., & Kitaev, A. Y. (1998) · arXiv · doi:10.48550/arxiv.quant-ph/9811052 · Cited by 394 · cited 1×
“The surface code [5, 8, 21, 22, 11] is a quantum error correcting code that works on a 2D nearest-neighbour array of qubits and achieves a threshold error rate of approximately 1%.”
BackgroundApplication of a Resource Theory for Magic States to Fault-Tolerant Quantum Computing
Howard, M., & Campbell, E. (2017) · Physical Review Letters · doi:10.1103/physrevlett.118.090501 · Cited by 387 · cited 1×
“In [14] it is proven that a Toffoli gate requires at least 4 T gates, though the specific nature of the proof does not eliminate the possibility that n Toffolis could be implemented with fewer than 4n T gates for some large n.”
BackgroundEncoding Electronic Spectra in Quantum Circuits with Linear T Complexity
Babbush, R., Gidney, C., Berry, D. W., Wiebe, N., McClean, J., Paler, A., Fowler, A., & Neven, H. (2018) · Physical Review X · doi:10.1103/physrevx.8.041015 · Cited by 383 · cited 2×
“temporary logical-ANDs to cut the T-count of a chemistry algorithm in preparation by nearly 50% [2].”
BackgroundSelf-citationA new quantum ripple-carry addition circuit
Cuccaro, S. A., Draper, T. G., Kutin, S. A., & Moulton, D. P. (2004) · arXiv · doi:10.48550/arxiv.quant-ph/0410184 · Cited by 344 · cited 6×
“Existing constructions implement the Cuccaro adder’s Toffolis using 8n + O(1) T gates [1, 3, 6].”
BackgroundMethodInfluentialBlueprint for a microwave trapped ion quantum computer
Lekitsch, B., Weidt, S., Fowler, A. G., Mølmer, K., Devitt, S. J., Wunderlich, C., & Hensinger, W. K. (2017) · Science Advances · doi:10.1126/sciadv.1601540 · Cited by 292
A Short Introduction to Topological Quantum Computation
Lahtinen, V., & Pachos, J. (2017) · SciPost Physics · doi:10.21468/scipostphys.3.3.021 · Cited by 234 · cited 1×
“…the architecture of future error corrected quantum computers, because 2D arrays of qubits with nearest-neighbor connections are possible with many qubit technologies [23, 4, 12, 18, 17] and other well understood error correcting codes either have lower thresholds or require stronger connectivity.”
BackgroundLow-overhead constructions for the fault-tolerant Toffoli gate
Jones, C. (2013) · Physical Review A · doi:10.1103/physreva.87.022328 · Cited by 204 · cited 3×
“This T-count can be achieved either by applying the ancilla-and-fixup construction from [11] to each individual Toffoli gate, or by noting that all but one of the adder’s Toffoli gates appear in compute/uncompute pairs and then applying the matched-phase-error construction from [3, 14] to each pair.”
MethodInfluentialA Short Introduction to Topological Quantum Computation
Lahtinen, V., & Pachos, J. (2017) · White Rose Research Online (University of Leeds, The University of Sheffield, University of York) · Cited by 201
Surface code quantum computing by lattice surgeryPreprint
Horsman, C., Fowler, A. G., Devitt, S. J., & Meter, R. V. (2016) · Cited by 172
A logarithmic-depth quantum carry-lookahead adder
Draper, T. G., Kutin, S., Rains, E. M., & Svore, K. M. (2006) · CaltechAUTHORS (California Institute of Technology) · doi:10.5555/2012086.2012090 · Cited by 146
A logarithmic-depth quantum carry-lookahead adder
Draper, T. G., Kutin, S. A., Rains, E. M., & Svore, K. M. (2006) · Quantum Information and Computation · doi:10.26421/qic6.4-5-4 · Cited by 101
Scalable architecture for quantum information processing with atoms in optical micro-structures
Schlosser, M., Tichelmann, S., Kruse, J., & Birkl, G. (2011) · Quantum Information Processing · doi:10.1007/s11128-011-0297-z · Cited by 64 · cited 2×
“This makes the surface code a likely component in the architecture of future error corrected quantum computers, because 2D arrays of qubits with nearestneighbor connections are possible with many qubit technologies [4, 10, 12, 17, 18] and other well understood error correcting codes either have lower thresholds or req…”
BackgroundT-count Optimized Design of Quantum Integer MultiplicationPreprint
Muñoz-Coreas, E., & Thapliyal, H. (2017) · arXiv.org · doi:10.48550/arxiv.1706.05113 · Cited by 18
Spells for Quantum Programmers: Expressive High-Level Commands in Qutes
Faro, S., Marino, F. P., & Messina, G. (2026) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.fun.2026.15
Cited by
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
How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
Gidney, C., & Ekerå, M. (2021) · Quantum · doi:10.22331/q-2021-04-15-433 · Cited by 830
Self-citationPractical quantum advantage in quantum simulation
Daley, A. J., Bloch, I., Kokail, C., Flannigan, S., Pearson, N., Troyer, M., & Zoller, P. (2022) · Nature · doi:10.1038/s41586-022-04940-6 · Cited by 669
A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
Litinski, D. (2019) · Quantum · doi:10.22331/q-2019-03-05-128 · Cited by 408
“Reducing the T count by increasing the circuit depth [49] can still be a useful circuit manipulation for”
Background
Metadata
- Authors
- Gidney, C.
- Affiliations
- Google (United States) (US)
- Corresponding author
- Gidney, Craig
- Venue
- Quantum
- Published
- 2018-06-18
- Volume
- 2
- Pages
- 74
- ISSN
- 2521-327X (ISSN-L)
- OpenAlex
- W2759506558
- Cited by
- 279
- References
- 28
- Citations by year
- 2026: 36 · 2025: 62 · 2024: 37 · 2023: 31 · 2022: 31 · 2021: 29 · 2020: 25 · 2019: 24 · 2018: 4
- FWCI
- 11.48
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Locations
- Quantum (publishedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- arXiv (Cornell University) (cc-by)
- 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 › Computer Science › Computational Theory and Mathematics › Quantum-Dot Cellular Automata
- Keywords
- modular arithmetic, quantum Fourier transform, Shor's algorithm
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.