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
Items 101–200 of 633
Qubit devices and the issue of quantum decoherence
Brandt, H. E. (1999) · Progress in Quantum Electronics · doi:10.1016/s0079-6727(99)00003-8 · Cited by 102
Accuracy threshold for postselected quantum computation
Aliferis, P., Gottesman, D., & Preskill, J. P. (2008) · Quantum Information and Computation · doi:10.26421/qic8.3-4-1 · Cited by 101
Architectural implications of quantum computing technologies
Meter, R. V., & Oskin, M. (2006) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/1126257.1126259 · Cited by 93
Recent progress in quantum algorithms
Bacon, D., & van Dam, W. (2010) · Communications of the ACM · doi:10.1145/1646353.1646375 · Cited by 95
Quantum computing: An IBM perspective
Steffen, M., Divincenzo, D. P., Chow, J. M., Theis, T. N., & Ketchen, M. B. (2011) · IBM Journal of Research and Development · doi:10.1147/jrd.2011.2165678 · Cited by 96
DISTRIBUTED QUANTUM COMPUTATION ARCHITECTURE USING SEMICONDUCTOR NANOPHOTONICS
VAN METER, R., LADD, T. D., FOWLER, A. G., & YAMAMOTO, Y. (2010) · International Journal of Quantum Information · doi:10.1142/s0219749910006435 · Cited by 109
Parallel information and computation with restitution for noise-tolerant nanoscale logic networks
Sadek, A., Nikoli, K., & Forshaw, M. R. B. (2003) · Nanotechnology · doi:10.1088/0957-4484/15/1/037 · Cited by 90
Quantum accuracy threshold for concatenated distance-3 codesPreprint
Aliferis, P., Gottesman, D., & Preskill, J. (2005) · Quantum information & computation · doi:10.48550/arxiv.quant-ph/0504218 · Cited by 564
Quantum process tomography via completely positive and trace-preserving projection
Knee, G. C., Bolduc, E., Leach, J., & Gauger, E. M. (2018) · Physical Review A · doi:10.1103/physreva.98.062336 · Cited by 94
Ohno, T., Arakawa, G., Ichinose, I., & Matsui, T. (2004) · Nuclear Physics B · doi:10.1016/j.nuclphysb.2004.07.003 · Cited by 81
Mozyrsky, D., & Vladimir Privman, A. (1998) · Journal of Statistical Physics · doi:10.1023/a:1023042014131 · Cited by 76
Topological Quantum Computation
Ogburn, R. W., & Preskill, J. P. (1999) · Lecture notes in computer science · doi:10.1007/3-540-49208-9_31 · Cited by 75
Boykin, P. O., Mor, T., Pulver, M., Roychowdhury, V., & Vatan, F. (2003) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sffcs.1999.814621 · Cited by 82
On the power of quantum computation
Vazirani, U. V. (1998) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.1998.0247 · Cited by 82
The detectability lemma and quantum gap amplification
Aharonov, D., Arad, I., Landau, Z. A., & Vazirani, U. V. (2009) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1536414.1536472 · Cited by 77
Self-citationSelf-correcting quantum computers
Bombín, H., Chhajlany, R. W., Horodecki, M., & Martin-Delgado, M. A. (2013) · New Journal of Physics · doi:10.1088/1367-2630/15/5/055023 · Cited by 94
An Introduction to Quantum Error CorrectionPreprint
Gottesman, D. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0004072 · Cited by 96
Performance of quantum error correction with coherent errors
Huang, E., Doherty, A. C., & Flammia, S. T. (2019) · Physical Review A · doi:10.1103/physreva.99.022313 · Cited by 85
An Introduction to Quantum Complexity Theory
Cleve, R. (2001) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789810248185_0004 · Cited by 92
Multilinear formulas and skepticism of quantum computing
Aaronson, S. (2004) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1007352.1007378 · Cited by 75
Clifford gates by code deformation
Bombín, H. (2011) · New Journal of Physics · doi:10.1088/1367-2630/13/4/043005 · Cited by 74
Quantum learning robust against noise
Cross, A. W., Smith, G., & Smolin, J. A. (2015) · Physical Review A · doi:10.1103/physreva.92.012327 · Cited by 80
Toward fault-tolerant quantum computation without concatenation
Dennis, E. (2001) · Physical Review A · doi:10.1103/physreva.63.052314 · Cited by 72
A statistical mechanics view on Kitaev's proposal for quantum memories
Alicki, R., Fannes, M., & Horodecki, M. (2007) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/40/24/012 · Cited by 69
Introduction to Quantum Error CorrectionPreprint
Knill, E. H., Laflamme, R., Ashikhmin, A., Barnum, H., Viola, L., & Zurek, W. H. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0207170 · Cited by 93
Autonomous quantum error correction and fault-tolerant quantum computation with squeezed cat qubits
Xu, Q., Zheng, G., Wang, Y., Zoller, P., Clerk, A. A., & Jiang, L. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00746-0 · Cited by 77
Noise Threshold for a Fault-Tolerant Two-Dimensional Lattice ArchitecturePreprint
Svore, K. M., Divincenzo, D. P., & Terhal, B. M. (2006) · Cited by 63
Coherence in logical quantum channels
Iverson, J. K., & Preskill, J. (2020) · New Journal of Physics · doi:10.1088/1367-2630/ab8e5c · Cited by 61
Grace, M., Brif, C., Kosut, R. L., Lidar, D. A., Rabitz, H., & Walmsley, I. A. (2007) · CERN Document Server (European Organization for Nuclear Research) · Cited by 62
Quantum error correction with the semion code
Dauphinais, G., Ortíz, L., Varona, S., & Martin-Delgado, M. A. (2019) · New Journal of Physics · doi:10.1088/1367-2630/ab1ed8 · Cited by 65
Mitigating coherent noise using Pauli conjugation
Cai, Z., Xu, X., & Benjamin, S. C. (2020) · npj Quantum Information · doi:10.1038/s41534-019-0233-0 · Cited by 71
Majorana Loop Stabilizer Codes for Error Mitigation in Fermionic Quantum Simulations
Zhang, J., McClean, J. R., Babbush, R., & Neven, H. (2019) · Physical Review Applied · doi:10.1103/physrevapplied.12.064041 · Cited by 64
Oskin, M., Chong, F. T., Chuang, I. L., & Kubiatowicz, J. D. (2003) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/859618.859661 · Cited by 61
Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries
Dupuis, F., Nielsen, J. B., & Salvail, L. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14623-7_37 · Cited by 59
Sufficient condition on noise correlations for scalable quantum computing
Preskill, J. P. (2013) · Quantum Information and Computation · doi:10.26421/qic13.3-4-1 · Cited by 77
Quantum Computing for Computer Architects
Metodi, T. S., & Chong, F. T. (2006) · Synthesis lectures on computer architecture · doi:10.1007/978-3-031-01718-6 · Cited by 61
Quantum Coding with Low-Depth Random Circuits
Gullans, M. J., Krastanov, S., Huse, D. A., Jiang, L., & Flammia, S. T. (2021) · Physical Review X · doi:10.1103/physrevx.11.031066 · Cited by 68
New Limits on Fault-Tolerant Quantum Computation
Buhrman, H., Cleve, R., Laurent, M., Linden, N., Schrijver, A., & Unger, F. (2006) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2006.50 · Cited by 60
Optimized surface code communication in superconducting quantum computers
Javadi-Abhari, A., Gokhale, P., Holmes, A. A., Franklin, D. M., Brown, K. R., Martonosi, M., & Chong, F. T. (2017) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1145/3123939.3123949 · Cited by 69
Trading Inverses for an Irrep in the Solovay-Kitaev TheoremPreprint
Bouland, A., & Ozols, M. (2017) · arXiv (Cornell University) · doi:10.4230/lipics.tqc.2018.6 · Cited by 9
Self-citationКвантовые вычисления: алгоритмы и исправление ошибок
Китаев, А. Ю., & Kitaev, A. Y. (1997) · Успехи математических наук · doi:10.4213/rm892 · Cited by 60
Quantum convolutional codes: fundamentalsPreprint
Ollivier, H., & Tillich, J. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0401134 · Cited by 64
Approaches to Quantum Error Correction
Kempe, J. (2006) · Birkhäuser Basel eBooks · doi:10.1007/978-3-7643-7808-0_3 · Cited by 57
Experimental magic state distillation for fault-tolerant quantum computing
Souza, A. M., Zhang, J., Ryan, C. A., & Laflamme, R. (2011) · Nature Communications · doi:10.1038/ncomms1166 · Cited by 51
Noiseless Subsystems and the Structure of the Commutant in Quantum Error Correction
Holbrook, J., Kribs, D. W., & Laflamme, R. (2003) · Quantum Information Processing · doi:10.1023/b:qinp.0000022737.53723.b4 · Cited by 58
Bounds for Kac's Master Equation
Diaconis, P. W., & Saloff‐Coste, L. (2000) · Communications in Mathematical Physics · doi:10.1007/s002200050036 · Cited by 56
Protecting quantum information encoded in decoherence-free states against exchange errors
Lidar, D. A., Bacon, D. F., Kempe, J., & Whaley, K. B. (2000) · Physical Review A · doi:10.1103/physreva.61.052307 · Cited by 55
Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation
Yamasaki, H., & Koashi, M. (2024) · Nature Physics · doi:10.1038/s41567-023-02325-8 · Cited by 73
Communication Links for Distributed Quantum Computation
Meter, R. V., Nemoto, K., & Munro, W. J. (2007) · IEEE Transactions on Computers · doi:10.1109/tc.2007.70775 · Cited by 52
Key ideas in quantum error correction
Raussendorf, R. (2012) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2011.0494 · Cited by 53
Elfving, V. E., Broer, B. W., Webber, M., Gavartin, J. L., Halls, M. D., Lorton, K. P., & Bochevarov, A. D. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2009.12472 · Cited by 128
Separability Transitions in Topological States Induced by Local Decoherence
Chen, Y.-H., & Grover, T. (2024) · Physical Review Letters · doi:10.1103/physrevlett.132.170602 · Cited by 52
Thaker, D., Metodi, T. S., Cross, A. W., Chuang, I. L., & Chong, F. T. (2006) · ACM SIGARCH Computer Architecture News · doi:10.1145/1150019.1136518 · Cited by 54
Short-time decoherence for general system-environment interactions
Tolkunov, D., & Vladimir Privman, A. (2004) · Physical Review A · doi:10.1103/physreva.69.062309 · Cited by 52
Scheduling physical operations in a quantum information processor
Metodi, T. S., Thaker, D., Cross, A. W., Chong, F. T., & Chuang, I. L. (2006) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.666419 · Cited by 54
Analysis of Quantum Error-Correcting Codes: Symplectic Lattice Codes and Toric Codes
Harrington, J. W. (2004) · CaltechTHESIS (California Institute of Technology) · doi:10.7907/ahmq-eg82 · Cited by 54
Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes
Crépeau, C., Gottesman, D., & Smith, A. (2005) · Lecture notes in computer science · doi:10.1007/11426639_17 · Cited by 63
Optimal quantum error correcting codes from absolutely maximally entangled states
Raissi, Z., Gogolin, C., Riera, A., & Acín, A. (2017) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/aaa151 · Cited by 59
Overhead analysis of universal concatenated quantum codes
Chamberland, C., Jochym-O’Connor, T., & Laflamme, R. (2017) · Physical Review A · doi:10.1103/physreva.95.022313 · Cited by 52
Quantum Money from Hidden Subspaces
Aaronson, S., & Christiano, P. F. (2012) · doi:10.48550/arxiv.1203.4740 · Cited by 74
Constructions and performance of classes of quantum LDPC codesPreprint
Camara, T., Ollivier, H., & Tillich, J. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0502086 · Cited by 60
A real-time, scalable, fast and resource-efficient decoder for a quantum computer
Barber, B., Barnes, K. M., Bialas, T., Buğdaycı, O., Campbell, E. T., Gillespie, N. I., Johar, K., Rajan, R., Richardson, A. W., Skorić, L., et al. (2025) · Nature Electronics · doi:10.1038/s41928-024-01319-5 · Cited by 49
A class of quantum LDPC codes: construction and performances under iterative decoding
Camara, T., Ollivier, H., & Tillich, J. (2007) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2007.4557324 · Cited by 52
Tricolored lattice gauge theory with randomness: fault tolerance in topological color codes
Andrist, R. S., Katzgraber, H. G., Bombín, H., & Martin-Delgado, M. A. (2011) · New Journal of Physics · doi:10.1088/1367-2630/13/8/083006 · Cited by 53
Thresholds for Universal Concatenated Quantum Codes
Chamberland, C., Jochym-O’Connor, T., & Laflamme, R. (2016) · Physical Review Letters · doi:10.1103/physrevlett.117.010501 · Cited by 52
Commuting quantum circuits and complexity of Ising partition functions
Fujii, K., & Morimae, T. (2017) · New Journal of Physics · doi:10.1088/1367-2630/aa5fdb · Cited by 58
Fault-tolerant quantum computation for local leakage faults
Aliferis, P., & Terhal, B. M. (2007) · Quantum Information and Computation · doi:10.26421/qic7.1-2-9 · Cited by 88
Kubica, A., & Demkowicz-Dobrzański, R. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.150503 · Cited by 50
Fault-tolerant ancilla preparation and noise threshold lower bounds for the 23-qubit Golay code
Paetznick, A., & Reichardt, B. W. (2012) · Quantum Information and Computation · doi:10.26421/qic12.11-12-10 · Cited by 70
Robust fault tolerance for continuous-variable cluster states with excess antisqueezing
Walshe, B. W., Mensen, L. J., Baragiola, B. Q., & Menicucci, N. C. (2019) · Physical Review A · doi:10.1103/physreva.100.010301 · Cited by 43
Gaitan, F. (2021) · Advanced Quantum Technologies · doi:10.1002/qute.202100055 · Cited by 47
Reducing the quantum-computing overhead with complex gate distillation
Duclos-Cianci, G., & Poulin, D. (2015) · Physical Review A · doi:10.1103/physreva.91.042315 · Cited by 44
Shi, J., Shi, R., Tang, Y., & Lee, M. H. (2011) · Quantum Information Processing · doi:10.1007/s11128-010-0225-7 · Cited by 44
Error suppression in Hamiltonian-based quantum computation using energy penalties
Bookatz, A. D., Farhi, E., & Zhou, L. (2015) · Physical Review A · doi:10.1103/physreva.92.022317 · Cited by 42
Fault-tolerant quantum gates with defects in topological stabilizer codes
Webster, P., & Bartlett, S. D. (2020) · Physical Review A · doi:10.1103/physreva.102.022403 · Cited by 42
Quantum Memory Hierarchies: Efficient Designs to Match Available Parallelism in Quantum Computing
Thaker, D., Metodi, T. S., Cross, A. W., Chuang, I. L., & Chong, F. T. (2006) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1109/isca.2006.32 · Cited by 47
Quantum heat engine with long-range advantages
Solfanelli, A., Giachetti, G., Campisi, M., Ruffo, S., & Defenu, N. (2023) · New Journal of Physics · doi:10.1088/1367-2630/acc04e · Cited by 45
Quantum advantage and stability to errors in analogue quantum simulators
Trivedi, R., Franco-Rubio, A., & Cirac, J. I. (2024) · Nature Communications · doi:10.1038/s41467-024-50750-x · Cited by 42
Real-time calibration with spectator qubits
Majumder, S., de Castro, L. A., & Brown, K. R. (2020) · npj Quantum Information · doi:10.1038/s41534-020-0251-y · Cited by 44
Fault-Tolerant Quantum Computation for Local Leakage FaultsPreprint
Aliferis, P., & Terhal, B. M. (2005) · Cited by 42
Is error detection helpful on IBM 5Q chips?
Vuillot, C. (2018) · Quantum Information and Computation · doi:10.26421/qic18.11-12-4 · Cited by 41
Tansuwannont, T., Chamberland, C., & Leung, D. (2020) · Physical Review A · doi:10.1103/physreva.101.012342 · Cited by 44
The trapped-ion qubit tool box
Ozeri, R. (2011) · Contemporary Physics · doi:10.1080/00107514.2011.603578 · Cited by 42
How Quantum Computers Fail: Quantum Codes, Correlations in Physical Systems, and Noise AccumulationPreprint
Kalai, G. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1106.0485 · Cited by 43
Efficient decoding of random errors for quantum expander codes
Leverrier, A. (2017) · HAL · Cited by 40
Quantitative robustness analysis of quantum programs
S-H, H., Hietala, K., Zhu, S., Ying, M., Hicks, M., & Wu, X. (2019) · OPUS - Open Publications of UTS Scholars (University of Technology Sydney) · Cited by 39
A flow-map model for analyzing pseudothresholds in fault-tolerant quantum computing
Svore, K. M., Cross, A. W., Chuang, I. L., & Aho, A. V. (2006) · Quantum Information and Computation · doi:10.26421/qic6.3-1 · Cited by 40
Application of QGA-BP for Fault Detection of Liquid Rocket Engines
Xu, L., Zhao, S., Li, N., Gao, Q., Wang, T., & Xue, W. (2019) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2018.2890352 · Cited by 39
Fault-Tolerant Gates on Hypergraph Product Codes
Krishna, A., & Poulin, D. (2021) · Physical Review X · doi:10.1103/physrevx.11.011023 · Cited by 40
Quantum computing and quadratically signed weight enumerators
Knill, E. H., & Laflamme, R. (2001) · Information Processing Letters · doi:10.1016/s0020-0190(00)00222-2 · Cited by 43
A Layered Architecture for Quantum Computing Using Quantum DotsPreprint
Jones, N. C., Meter, R. V., Fowler, A. G., McMahon, P. L., Kim, J., Ladd, T. D., & Yamamoto, Y. (2010) · arXiv (Cornell University) · Cited by 38
Quantifying Nonlocality: How Outperforming Local Quantum Codes Is Expensive
Baspin, N., & Krishna, A. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.050505 · Cited by 37
Quantum circuit optimization with AlphaTensor
Ruiz, F. J. R., Laakkonen, T., Bausch, J., Balog, M., Barekatain, M., Heras, F. J. H., Novikov, A., Fitzpatrick, N., Romera‐Paredes, B., van de Wetering, J., et al. (2025) · Nature Machine Intelligence · doi:10.1038/s42256-025-01001-1 · Cited by 89
Designing a Million-Qubit Quantum Computer Using a Resource Performance Simulator
Ahsan, M., Meter, R. V., & Kim, J. (2015) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/2830570 · Cited by 37
Future of Quantum Computing in Cyber Security
Brijwani, G. N., Ajmire, P. E., & Thawani, P. V. (2023) · Advances in systems analysis, software engineering, and high performance computing book series · doi:10.4018/978-1-6684-6697-1.ch016 · Cited by 38
Level Reduction and the Quantum Threshold TheoremPreprint
Aliferis, P. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0703230 · Cited by 50
Bitcoin and Quantum ComputingPreprint
Wright, C. (2017) · SSRN Electronic Journal · doi:10.2139/ssrn.3152419 · Cited by 37
Fault-Tolerant Quantum Computation with Constant OverheadPreprint
Gottesman, D. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1310.2984 · Cited by 35
Towards quantum supremacy with lossy scattershot boson sampling
Latmiral, L., Spagnolo, N., & Sciarrino, F. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/11/113008 · Cited by 33
Bio‐Inspired and Nanoscale Integrated Computing
Eshaghian‐Wilner, M. M., & service), W. I. (. (2009) · Wiley eBooks · doi:10.1002/9780470429983 · Cited by 34
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
