The DOI matches its Crossref record; 61 of the 61 references it cites were found in a registry or an index.
Fault-tolerant quantum computation with constant error
Open accessAbstract
In the past year many developments have taken place in the area of quantum error corrections. Recently Shor showed how to perform fault tolerant quantum computation when, , the probability for a fault in one time step per qubit or per gate, is polylogarithmically small. This paper closes the gap and shows how to perform fault tolerant quantum computation when the error probability, , is smaller than some constant threshold, 0 . The cost is polylogarithmic in time and space, and no measurements are used during the quantum computation. The same result is shown also for quantum circuits which operate on nearest neighbors only.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“First, the choice to work with circuits which allow parallelism is necessary, because sequential quantum computation, such as quantum Turing machines, cannot be noise resistant[3], since error corrections cannot be applied fast enough to prevent accumulation of errors.”
From Fault-Tolerant Quantum Computation with Constant Error Rate (2008) · cites this paper as [3]
In the citing paper
“In a previous paper, we have shown that quantum systems can be simulated efficiently by a classical Turing machine if the noise is large[3].”
From Fault-Tolerant Quantum Computation with Constant Error Rate (2008) · cites this paper as [3]
In the citing paper
“In [3] it was shown that for a very high noise rate, the quantum circuit behaves in a classical way.”
From Fault-Tolerant Quantum Computation with Constant Error Rate (2008) · cites this paper as [3]
In the citing paper
“Second, by considering more favorable schemes for Hamiltonian decomposition 256,257 , most modern-day simulation algorithms scale in terms of τ max = t ‖ H ‖ max instead of τ , where ‖ H ‖ max is the absolute value of the largest entry of H as a matrix in the computational basis.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [256]
In the citing paper
“In fact, arbitrarily large quantum computations can be performed with arbitrary accuracy, provided the error level of the elementary components of the quantum computer is below a certain threshold. This important result is called the threshold theorem of quantum computation 59-62”
From Measurement-based quantum computation (2009) · cites this paper as [60]
Citations
Cites
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Quantum computation with quantum dots
Loss, D., & DiVincenzo, D. P. (1998) · Physical Review A · doi:10.1103/physreva.57.120 · Cited by 6,840
A single quantum cannot be cloned
Wootters, W. K., & Zurek, W. H. (1982) · Nature · doi:10.1038/299802a0 · Cited by 5,406 · cited 1×
“It was argued by scientists that due to the continuity of quantum states, and to the fact that quantum states cannot be cloned[ 74 ], it will be impossible to protect quantum information from noise[72, 47].”
BackgroundMixed-state entanglement and quantum error correction
Bennett, C. H., DiVincenzo, D. P., Smolin, J. A., & Wootters, W. K. (1996) · Physical Review A · doi:10.1103/physreva.54.3824 · Cited by 5,272
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
Scheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479
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
Quantum Mechanics Helps in Searching for a Needle in a Haystack
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.325 · Cited by 4,306 · cited 1×
“10, 11] and quantum algorithms[25, 65, 36 ], in particular Shor’s factorization algorithm [62].”
Background
Flagged first, then by citations
Cited by
Sorted by citations
Fault-tolerant quantum computation by anyons
Kitaev, A. Y. (2003) · Annals of Physics · doi:10.1016/s0003-4916(02)00018-0 · Cited by 7,238
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1999) · SIAM Review · doi:10.1137/s0036144598347011 · Cited by 3,904
Unpaired majorana fermions in quantum wiresPreprint
Kitaev, A. Y. (2000) · Cited by 2,407
The Physics of Quantum Information
(2000) · doi:10.1007/978-3-662-04209-0 · Cited by 1,086
Unconditional Security of Quantum Key Distribution over Arbitrarily Long Distances
Lo, H., & Chau, H. F. (1999) · Science · doi:10.1126/science.283.5410.2050 · Cited by 1,867
Quantum error correction via codes over GF(4)
Calderbank, A. R., Rains, E. M., Shor, P. W., & Sloane, N. J. A. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.681315 · Cited by 1,831
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
Improved simulation of stabilizer circuits
Aaronson, S., & Gottesman, D. (2004) · Physical Review A · doi:10.1103/physreva.70.052328 · Cited by 1,515
Dennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2001) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,485
Quantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424
Cleve, R., Gottesman, D., & Lo, H.-K. (1999) · Physical Review Letters · doi:10.1103/physrevlett.83.648 · Cited by 1,373
Quantum error correction for quantum memories
Terhal, B. M. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.307 · Cited by 1,354
Stabilizer Codes and Quantum Error Correction
Gottesman, D. (1997) · arXiv · doi:10.48550/arxiv.quant-ph/9705052 · Cited by 753
Quantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184
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
Measurement-based quantum computation
Briegel, H. J., Browne, D. E., Dür, W., Raussendorf, R., & Van den Nest, M. (2009) · Nature Physics · doi:10.1038/nphys1157 · Cited by 1,090
Preskill, J. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0167 · Cited by 994
Theory of fault-tolerant quantum computation
Gottesman, D. (1998) · Physical Review A · doi:10.1103/physreva.57.127 · Cited by 945
The 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
Theory of Quantum Error Correction for General Noise
Knill, E., Laflamme, R., & Viola, L. (2000) · Physical Review Letters · doi:10.1103/physrevlett.84.2525 · Cited by 866
Holographic quantum error-correcting codes: toy models for the bulk/boundary correspondence
Pastawski, F., Yoshida, B., Harlow, D., & Preskill, J. (2015) · Journal of High Energy Physics · doi:10.1007/jhep06(2015)149 · Cited by 958
Quantum error correction for beginners
Devitt, S. J., Munro, W. J., & Nemoto, K. (2013) · Reports on Progress in Physics · doi:10.1088/0034-4885/76/7/076001 · Cited by 842
Nonbinary Stabilizer Codes Over Finite Fields
Ketkar, A. U., Klappenecker, A., Kumar, S., & Sarvepalli, P. K. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.883612 · Cited by 618
Building logical qubits in a superconducting quantum computing system
Gambetta, J., Chow, J. M., & Steffen, M. (2017) · npj Quantum Information · doi:10.1038/s41534-016-0004-0 · Cited by 680
Theory of quantum secret sharing
Gottesman, D. (2000) · Physical Review A · doi:10.1103/physreva.61.042311 · Cited by 635
A Modular Functor Which is Universal¶for Quantum Computation
Freedman, M. H., Larsen, M., & Wang, Z. (2002) · Communications in Mathematical Physics · doi:10.1007/s002200200645 · Cited by 573
Fujii, K. (2009) · Institute of Electrical and Electronics Engineers eBooks · doi:10.1109/9780470544907.ch24 · Cited by 642
Fault-Tolerant Quantum Computation with Constant Error Rate
Aharonov, D., & Ben-Or, M. (2008) · SIAM Journal on Computing · doi:10.1137/s0097539799359385 · Cited by 513
Self-citationScalable noise estimation with random unitary operators
Emerson, J., Alicki, R., & Życzkowski, K. (2005) · Journal of Optics B: Quantum and Semiclassical Optics · doi:10.1088/1464-4266/7/10/021 · Cited by 502
High-threshold and low-overhead fault-tolerant quantum memory
Bravyi, S., Cross, A. W., Gambetta, J. M., Maslov, D., Rall, P., & Yoder, T. J. (2024) · Nature · doi:10.1038/s41586-024-07107-7 · Cited by 456
“The first proposals for quantum error correction, such as concatenated codes 21–23 , focused on demonstrating the theoretical possibility of error suppression.”
BackgroundNew Class of Quantum Error-Correcting Codes for a Bosonic Mode
Michael, M. H., Silveri, M., Brierley, R., Albert, V. V., Salmilehto, J., Jiang, L., & Girvin, S. M. (2016) · Physical Review X · doi:10.1103/physrevx.6.031006 · Cited by 472
Quantum circuits with mixed states
Aharonov, D., Kitaev, A., & Nisan, N. (1998) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/276698.276708 · Cited by 487
Self-citationProspects for Spin-Based Quantum Computing in Quantum Dots
Kloeffel, C., & Loss, D. (2013) · Annual Review of Condensed Matter Physics · doi:10.1146/annurev-conmatphys-030212-184248 · Cited by 421
Universal quantum control of two-electron spin quantum bits using dynamic nuclear polarization
Foletti, S., Bluhm, H., Mahalu, D., Umansky, V., & Yacoby, A. (2009) · Nature Physics · doi:10.1038/nphys1424 · Cited by 402
Quantum accuracy threshold for concatenated distance-3 code
Aliferis, P., Gottesman, D., & Preskill, J. (2006) · Quantum Information and Computation · doi:10.26421/qic6.2-1 · Cited by 412
A fault-tolerant one-way quantum computer
Raussendorf, R., Harrington, J., & Goyal, K. (2006) · Annals of Physics · doi:10.1016/j.aop.2006.01.012 · Cited by 397
An introduction to quantum error correction and fault-tolerant quantum computation
Gottesman, D. (2010) · Proceedings of symposia in applied mathematics · doi:10.1090/psapm/068/2762145 · Cited by 795
Simulating quantum systems on a quantum computer
Zalka, C. (1998) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.1998.0162 · Cited by 420
Fault-Tolerant Measurement-Based Quantum Computing with Continuous-Variable Cluster States
Menicucci, N. C. (2014) · Physical Review Letters · doi:10.1103/physrevlett.112.120504 · Cited by 368
A Survey on Quantum Channel Capacities
Gyongyosi, L., Imre, S., & Nguyen, H. V. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2786748 · Cited by 337
Grassl, M., Beth, T., & Rötteler, M. (2004) · International Journal of Quantum Information · doi:10.1142/s0219749904000079 · Cited by 285
Implementing a strand of a scalable fault-tolerant quantum computing fabric
Chow, J. M., Gambetta, J., Magesan, E., Abraham, D. W., Cross, A. W., Johnson, B., Masluk, N. A., Ryan, C. A., Smolin, J. A., Srinivasan, S. J., et al. (2014) · Nature Communications · doi:10.1038/ncomms5015 · Cited by 284
Simulation of Topological Field Theories¶by Quantum Computers
Freedman, M. H., Kitaev, A., & Wang, Z. (2002) · Communications in Mathematical Physics · doi:10.1007/s002200200635 · Cited by 299
A Survey on Quantum Channel Capacities
Gyöngyösi, L., Imre, S., & Nguyen, H. V. (2018) · Surrey Research Insight Open Access (The University of Surrey) · Cited by 299
Symmetrized Characterization of Noisy Quantum Processes
Emerson, J., Silva, M. P. D., Moussa, O., Ryan, C. A., Laforest, M., Baugh, J., Cory, D. G., & Laflamme, R. (2007) · Science · doi:10.1126/science.1145699 · Cited by 259
Bonilla Ataides, J. P., Tuckett, D. K., Bartlett, S. D., Flammia, S. T., & Brown, B. J. (2021) · Nature Communications · doi:10.1038/s41467-021-22274-1 · Cited by 262
Quantum error correction : an introductory guide
Roffe, J. (2019) · White Rose Research Online (University of Leeds, The University of Sheffield, University of York) · Cited by 256
Sophisticated Quantum Search Without Entanglement
Meyer, D. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.2014 · Cited by 242
Fast parallel circuits for the quantum Fourier transform
Cleve, R., & Watrous, J. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892140 · Cited by 269
Complexity-Theoretic Foundations of Quantum Supremacy ExperimentsPreprint
Aaronson, S., & Chen, L. (2016) · arXiv (Cornell University) · doi:10.14288/1.0343134 · Cited by 400
Harnessing the Power of the Second Quantum Revolution
Deutsch, I. H. (2020) · PRX Quantum · doi:10.1103/prxquantum.1.020101 · Cited by 207
Virtual Distillation for Quantum Error Mitigation
Huggins, W. J., McArdle, S., O’Brien, T. E., Lee, J., Rubin, N. C., Boixo, S., Whaley, K. B., Babbush, R., & McClean, J. R. (2021) · Physical Review X · doi:10.1103/physrevx.11.041036 · Cited by 251
Challenges and Opportunities of Near-Term Quantum Computing Systems
Corcoles, A. D., Kandala, A., Javadi-Abhari, A., McClure, D. T., Cross, A. W., Temme, K., Nation, P. D., Steffen, M., & Gambetta, J. M. (2020) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2954005 · Cited by 203
Error-corrected quantum annealing with hundreds of qubits
Pudenz, K. L., Albash, T., & Lidar, D. A. (2014) · Nature Communications · doi:10.1038/ncomms4243 · Cited by 204
A new universal and fault-tolerant quantum basis
Boykin, P. O., Mor, T., Pulver, M., Roychowdhury, V., & Vatan, F. (2000) · Information Processing Letters · doi:10.1016/s0020-0190(00)00084-3 · Cited by 194
Ataides, J. P. B., Tuckett, D. K., Bartlett, S. D., Flammia, S. T., & Brown, B. J. (2021) · RePEc: Research Papers in Economics · Cited by 201
Scaling and networking a modular photonic quantum computer
Rad, H. A., Ainsworth, T., Alexander, R. N., Altieri, B., Askarani, M. F., Baby, R., Banchi, L., Baragiola, B. Q., Bourassa, J. E., Chadwick, R. S., et al. (2025) · Nature · doi:10.1038/s41586-024-08406-9 · Cited by 220
Fault-tolerant quantum computation for local non-Markovian noise
Terhal, B. M., & Burkard, G. (2005) · Physical Review A · doi:10.1103/physreva.71.012336 · Cited by 191
Quantum computation in quantum-Hall systems
Vladimir Privman, A., Vagner, I. D., & Kventsel, G. F. (1998) · Physics Letters A · doi:10.1016/s0375-9601(97)00974-2 · Cited by 184
All-Gaussian universality and fault tolerance with the Gottesman-Kitaev-Preskill code
Baragiola, B. Q., Pantaleoni, G., Alexander, R. N., Karanjai, A., & Menicucci, N. C. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.200502 · Cited by 173
Assessing the Progress of Trapped-Ion Processors Towards Fault-Tolerant Quantum Computation
Bermúdez, A., Xu, X., Nigmatullin, R., O’Gorman, J., Negnevitsky, V., Schindler, P., Monz, T., Poschinger, U., Hempel, C., Home, J., et al. (2017) · Physical Review X · doi:10.1103/physrevx.7.041061 · Cited by 188
NMR Based Quantum Information Processing: Achievements and Prospects
Cory, D. G., Laflamme, R., Knill, E. H., Viola, L., Havel, T. F., Boulant, N., Boutis, G. S., Fortunato, E. M., Lloyd, S., Martínez, R., et al. (2000) · CERN Document Server (European Organization for Nuclear Research) · Cited by 170
Single-Shot Fault-Tolerant Quantum Error Correction
Bombín, H. (2015) · Physical Review X · doi:10.1103/physrevx.5.031043 · Cited by 165
Fault-Tolerant Conversion between the Steane and Reed-Muller Quantum Codes
Anderson, J. T., Duclos-Cianci, G., & Poulin, D. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.080501 · Cited by 158
Fault-Tolerant quantum computation with constant overhead
Gottesman, D. (2014) · Quantum Information and Computation · doi:10.26421/qic14.15-16-5 · Cited by 172
A layered software architecture for quantum computing design tools
Svore, K. M., Aho, A. V., Cross, A. W., Chuang, I. L., & Markov, I. L. (2006) · Computer · doi:10.1109/mc.2006.4 · Cited by 166
Secure multi-party quantum computation
Crépeau, C., Gottesman, D., & Smith, A. (2002) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/509907.510000 · Cited by 168
A practical architecture for reliable quantum computers
Oskin, M., Chong, F. T., & Chuang, I. L. (2002) · Computer · doi:10.1109/2.976922 · Cited by 137
Transversality Versus Universality for Additive Quantum Codes
Zeng, B., Cross, A. W., & Chuang, I. L. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2161917 · Cited by 162
Alicki, R., Lidar, D. A., & Zanardi, P. (2006) · Physical Review A · doi:10.1103/physreva.73.052311 · Cited by 132
Ding, X., Guo, Y.-P., Xu, M.-C., Liu, R., Zou, G.-Y., Zhao, J.-Y., Ge, Z.-X., Zhang, Q.-H., Liu, H.-L., Wang, L.-J., et al. (2025) · Nature Photonics · doi:10.1038/s41566-025-01639-8 · Cited by 170
Quantum money from hidden subspaces
Aaronson, S., & Christiano, P. F. (2012) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2213977.2213983 · Cited by 156
Comparing Experiments to the Fault-Tolerance Threshold
Kueng, R., Long, D. M., Doherty, A. C., & Flammia, S. T. (2016) · Physical Review Letters · doi:10.1103/physrevlett.117.170502 · Cited by 137
Quantum computing: pro and con
Preskill, J. P. (1998) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.1998.0171 · Cited by 135
Quantum computation of scattering in scalar quantum field theories
Jordan, S. P., Lee, K. S. M., & Preskill, J. P. (2014) · Quantum Information and Computation · doi:10.26421/qic14.11-12-8 · Cited by 255
Interactive Proofs For Quantum ComputationsPreprint
Aharonov, D., Ben-Or, M., Eban, E., & Mahadev, U. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0810.5375 · Cited by 216
Self-citationQuantum computation with Turaev–Viro codes
König, R., Kuperberg, G., & Reichardt, B. W. (2010) · Annals of Physics · doi:10.1016/j.aop.2010.08.001 · Cited by 138
Experimental demonstration of a graph state quantum error-correction code
Bell, B. A., Herrera-Martí, D. A., Tame, M., Markham, D., Wadsworth, W. J., & Rarity, J. (2014) · Nature Communications · doi:10.1038/ncomms4658 · Cited by 129
Fault-tolerant quantum computation with local gates
Gottesman, D. (2000) · Journal of Modern Optics · doi:10.1080/09500340008244046 · Cited by 123
Efficient fault-tolerant quantum computingPreprint
Steane, A. M. (1998) · Cited by 127
Fast quantum byzantine agreement
Ben-Or, M., & Hassidim, A. (2005) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1060590.1060662 · Cited by 120
Self-citationSimulating Ising spin glasses on a quantum computer
Lidar, D. A., & Biham, O. (1997) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.56.3661 · Cited by 124
Maslov, D. A., Falconer, S. M., & Mosca, M. (2008) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2008.917562 · Cited by 120
A random walk approach to quantum algorithms
Kendon, V. M. (2006) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2006.1901 · Cited by 113
Codeword Stabilized Quantum Codes
Cross, A. W., Smith, G., Smolin, J. A., & Zeng, B. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.2008136 · Cited by 121
Local fault-tolerant quantum computation
Svore, K. M., Terhal, B. M., & Divincenzo, D. P. (2005) · Physical Review A · doi:10.1103/physreva.72.022317 · Cited by 112
Quantum to classical phase transition in noisy quantum computers
Aharonov, D. (2000) · Physical Review A · doi:10.1103/physreva.62.062311 · Cited by 108
Self-citationA Quantum Logic Array Microarchitecture: Scalable Quantum Data Movement and Computation
Metodi, T. S., Thaker, D., & Cross, A. W. (2006) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1109/micro.2005.9 · Cited by 108
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
The BQP-hardness of approximating the Jones polynomial
Aharonov, D., & Arad, I. (2011) · New Journal of Physics · doi:10.1088/1367-2630/13/3/035019 · Cited by 118
Self-citationSpin-Based Quantum Dot Quantum Computing in Silicon
Eriksson, M. A., Friesen, M. G., Coppersmith, S. N., Joynt, R., Klein, L. J., Slinker, K. A., Tahan, C., Mooney, P. M., Chu, J. O., & Koester, S. J. (2004) · Quantum Information Processing · doi:10.1007/s11128-004-2224-z · Cited by 107
Decoherence limits to quantum computation using trapped ions
Plenio, M. B., & Knight, P. L. (1997) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.1997.0109 · Cited by 107
Coherent spin-state transfer via Heisenberg exchange
Kandel, Y. P., Qiao, H., Fallahi, S., Gardner, G. C., Manfra, M. J., & Nichol, J. M. (2019) · Nature · doi:10.1038/s41586-019-1566-8 · Cited by 100
EFFICIENT QUANTUM CIRCUITS FOR NON-QUBIT QUANTUM ERROR-CORRECTING CODES
Grassl, M., Rötteler, M., & Beth, T. (2003) · International Journal of Foundations of Computer Science · doi:10.1142/s0129054103002011 · Cited by 103
Aharonov, D. (1999) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789812815569_0007 · Cited by 131
Self-citationMany-Body Physics in the NISQ Era: Quantum Programming a Discrete Time Crystal
Ippoliti, M., Kechedzhi, K., Moessner, R., Sondhi, S. L., & Khemani, V. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.030346 · Cited by 105
Chen, S., Cotler, J. S., Huang, H.-Y., & Li, J. Z. (2023) · Nature Communications · doi:10.1038/s41467-023-41217-6 · Cited by 139
Fault-tolerant computing with biased-noise superconducting qubits: a case study
Aliferis, P., Brito, F., Divincenzo, D. P., Preskill, J. P., Steffen, M., & Terhal, B. M. (2009) · New Journal of Physics · doi:10.1088/1367-2630/11/1/013061 · Cited by 102
BQP-completeness of scattering in scalar quantum field theory
Jordan, S. P., Krovi, H., Lee, K. S. M., & Preskill, J. P. (2018) · Quantum · doi:10.22331/q-2018-01-08-44 · Cited by 129
Closed timelike curves make quantum and classical computing equivalent
Aaronson, S., & Watrous, J. (2008) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2008.0350 · Cited by 99
Metadata
- Authors
- Aharonov, D., & Ben-Or, M.
- Affiliations
- Hebrew University of Jerusalem (IL)
- Venue
- Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97
- Publisher
- ACM Press
- Published
- 1997
- Pages
- 176-188
- OpenAlex
- W2052169397
- Cited by
- 631
- References
- 61
- Citations by year
- 2026: 25 · 2025: 44 · 2024: 29 · 2023: 18 · 2022: 17 · 2021: 26 · 2020: 29 · 2019: 21 · 2018: 18 · 2017: 19 · 2016: 19 · 2015: 23 · 2014: 19 · 2013: 16 · 2012: 20
- FWCI
- 16.52
- Type
- conference paper
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- ACM Symposium on Theory of Computing (STOC) (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- arXiv (Cornell University)
- 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 › Mathematics › Discrete Mathematics and Combinatorics › Coding theory and cryptography
- Keywords
- fault-tolerant quantum computing, quantum error correction, concatenated quantum codes, secret sharing
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
