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
Cited by
Sorted by citations
Items 401–500 of 633
An introduction to reliable quantum computationPreprint
Aliferis, P. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1107.2148 · Cited by 5
Thoughts on Noise and Quantum ComputationPreprint
Kalai, G. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0508095 · Cited by 5
Simulating the Effects of Quantum Error-correction SchemesPreprint
Niwa, J., Matsumoto, K., & Imai, H. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0211071 · Cited by 5
Quantum Merlin-Arthur with noisy channelPreprint
Morimae, T., Fujii, K., & Nishimura, H. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1608.04829 · Cited by 5
Decoherence and quantum error correction for quantum computing and communications.
Martínez, J. E., & de Navarra, U. (2022) · Deposito Adademico Digital Universidad De Navarra (University of Navarra) · doi:10.15581/10171/63013 · Cited by 11
Quantum Information Processing
Lloyd, S. (2009) · Springer eBooks · doi:10.1007/978-0-387-30440-3_437 · Cited by 5
Noisy probabilistic error cancellation and generalized physical implementability
Jin, T., Zhang, Y.-R., Xu, K., & Fan, H. (2025) · Communications Physics · doi:10.1038/s42005-025-02217-8 · Cited by 8
Continuous-variable fault-tolerant quantum computation under general noise
Matsuura, T., Menicucci, N. C., & 山崎, 隼. (2026) · Nature Communications · doi:10.1038/s41467-026-69036-5 · Cited by 16
Collective preparation of large quantum registers with high fidelity
Buffoni, L., & Campisi, M. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/adc3bb · Cited by 2
Escofet, P., Das, A., Rached, S. B., Rodrigo, S., Domingo, J., Sebastiano, F., Babaie, M., Keskin, B., Edoardo Charbon, A., Bolívar, P. H., et al. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00110 · Cited by 9
Quantum Computational Complexity in Curved Spacetime
Lanzagorta, M. O., & Uhlmann, J. K. (2016) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789813109032_0009 · Cited by 4
Quantum advantage from energy measurements of many-body quantum systems
Novo, L., Bermejo-Vega, J., & García−Patrón, R. (2021) · Refubium (Universitätsbibliothek der Freien Universität Berlin) · doi:10.17169/refubium-31445 · Cited by 4
Robust quantum computation by simulationPreprint
Lloyd, S., Rahn, B., & Ahn, C. (1999) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9912040 · Cited by 5
Decoding quantum error correction with Ising model hardwarePreprint
Roffe, J., Zohren, S., Horsman, D. C., & Chancellor, N. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.10254 · Cited by 4
The Argument against Quantum Computers, the Quantum Laws of Nature, and Google's Supremacy ClaimsPreprint
Kalai, G. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2008.05188 · Cited by 4
Supercomputer simulations of transmon quantum computers
Willsch, D. (2020) · RWTH Publications (RWTH Aachen) · doi:10.18154/rwth-2020-08027 · Cited by 7
A Lower Bound on the Space Overhead of Fault-Tolerant Quantum ComputationPreprint
Fawzi, O., Müller‐Hermes, A., & Shayeghi, A. (2022) · arXiv (Cornell University) · doi:10.4230/lipics.itcs.2022.68 · Cited by 11
Glisic, S., & Lorenzo, B. (2022) · Wiley eBooks · doi:10.1002/9781119790327.ch10 · Cited by 4
(2008) · CRC Press eBooks · doi:10.1201/b15868-2 · Cited by 4
Error Mitigation Thresholds in Noisy Quantum CircuitsPreprint
Niroula, P., Gopalakrishnan, S., & Gullans, M. J. (2023) · Research Square · doi:10.21203/rs.3.rs-2702892/v1 · Cited by 4
Better gates can make fault-tolerant computation impossible.Preprint
Unger, F. (2010) · Electronic colloquium on computational complexity · Cited by 4
Interleaved Logical Qubits in Atom Arrays
Viszlai, J., Lin, S. F., Dangwal, S., Bradley, C. E., Ramesh, V., Baker, J. M., Bernien, H., & Chong, F. T. (2025) · IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca61900.2025.00030 · Cited by 4
Introduction to quantum error correction with stabilizer codes
Bradshaw, Z. P., Dale, J. J., & Evans, E. N. (2026) · Annals of Physics · doi:10.1016/j.aop.2026.170353 · Cited by 4
Improved quantum processor logical error rates via correction and detection
Paetznick, A., Reichardt, B. W., Silva, M. P. D., Ryan-Anderson, C., Aasen, D., Bello‐Rivas, J. M., Campora, J. P., Chao, R., Chernoguzov, A., van Dam, W., et al. (2026) · Nature · doi:10.1038/s41586-026-10628-y · Cited by 3
Error scaling in fault tolerant quantum computation
Lanzagorta, M. O., & Uhlmann, J. K. (2011) · Applied Mathematics and Computation · doi:10.1016/j.amc.2011.07.070 · Cited by 3
Multiparty Quantum Group Signature Scheme with Quantum Parallel Computation
Shi, R., Shi, J., Guo, Y., & Lee, M. H. (2011) · IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom) · doi:10.1109/trustcom.2011.124 · Cited by 3
Patil, S. R., Javadi-Abhari, A., Chiang, C.-F., Heckey, J., Martonosi, M., & Chong, F. T. (2014) · IEEE International Symposium on Workload Characterization · doi:10.1109/iiswc.2014.6983057 · Cited by 6
Quantum Computing, Cryptography and Compilers
Mosca, M. (2012) · IEEE International Symposium on Multiple-Valued Logic (ISMVL) · doi:10.1109/ismvl.2012.70 · Cited by 3
Reconfiguring quantum error-correcting codes for real-life errors
Ahsan, M., & Naqvi, S. A. Z. (2020) · Journal of Physics D Applied Physics · doi:10.1088/1361-6463/ab96eb · Cited by 3
Laflamme, R., & Knill, E. H. (2000) · Springer eBooks · doi:10.1007/978-94-010-0948-5_7 · Cited by 3
Preparing quantum states by measurement-feedback control with Bayesian optimization
Wu, Y., Yao, J., & Zhang, P. (2023) · Frontiers of Physics · doi:10.1007/s11467-023-1311-5 · Cited by 3
The MMEQ with Quantum Error Analysis for Advancing Quantum Computing and Quantum Sensing
(2023) · International Journal of Theoretical & Computational Physics · doi:10.47485/2767-3901.1036 · Cited by 3
An algorithm based on quantum phase estimation for the identification of patterns
Ntalaperas, D., Καλογερόπουλος, Α., & Konofaos, N. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04388-9 · Cited by 3
Magic Mirror on the Wall, How to Benchmark Quantum Error Correction Codes, Overall?
Chatterjee, A., & Ghosh, S. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00050 · Cited by 7
Williams, C. P. (2010) · Texts in computer science · doi:10.1007/978-1-84628-887-6_14 · Cited by 3
Symmetrization methods for characterization and benchmarking of quantum processes
Emerson, J. (2008) · Canadian Journal of Physics · doi:10.1139/p07-192 · Cited by 3
Rynbach, A. J. V., Ahsan, M., & Kim, J. (2018) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/3154837 · Cited by 3
Generalized Concatenation for Quantum Codes
Grassl, M., Shor, P. W., & Zeng, B. (2009) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 3
Computer-aided-design methods for emerging quantum computing technologies
Thornton, M. A., & Feinstein, D. Y. (2008) · Cited by 3
The Role of Correlated Noise in Quantum ComputingPreprint
Staudt, D. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1111.1417 · Cited by 5
5-qubit quantum error correction in a charge qubit quantum computerPreprint
Touchette, D., Ali, H., & Hilke, M. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1010.3242 · Cited by 5
Fibre bundle framework for unitary quantum fault tolerancePreprint
Gottesman, D., & Zhang, L. L. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1309.7062 · Cited by 11
Matsumoto, R. (2002) · Physical Review A · doi:10.1103/physreva.66.059901 · Cited by 4
Quantum Control of d-Dimensional Quantum Systems with Application to Alkali Atomic SpinsPreprint
Merkel, S. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0906.4790 · Cited by 8
Quantum Computation and Isomorphism Testing
Rosenbaum, D. J. (2015) · ResearchWorks at the University of Washington (University of Washington) · Cited by 2
Maroney, O. J. E., & Timpson, C. G. (2017) · PhilSci-Archive (University of Pittsburgh) · Cited by 3
Error correction for reliable quantum computing
Fuentes, P. (2022) · Deposito Adademico Digital Universidad De Navarra (University of Navarra) · doi:10.15581/10171/63067 · Cited by 4
Towards fault-tolerant quantum computation with higher-dimensional systems
Anwar, H. (2014) · UCL Discovery (University College London) · Cited by 3
Practical Quantum Error Correction with the XZZX Code and Kerr-Cat Qubits
Darmawan, A. S., Brown, B. J., Grimsmo, A. L., Tuckett, D. K., & Puri, S. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.030345 · Cited by 2
Single-shot quantum error correction with the three-dimensional subsystem toric code
Kubica, A., & Vasmer, M. (2022) · Nature Communications · doi:10.1038/s41467-022-33923-4 · Cited by 49
On the theory of quantum and towards practical computation: A review
Kudelić, R. (2024) · Journal of Computational Science · doi:10.1016/j.jocs.2024.102454 · Cited by 5
A 3D lattice defect and efficient computations in topological MBQC
Tournaire, G., Schwiering, M., Raussendorf, R., & Bachmann, S. (2026) · Quantum · doi:10.22331/q-2026-02-06-1997 · Cited by 2
Fault-Tolerant Quantum Computation with Constant Overhead for General Noise
Christandl, M., Fawzi, O., & Goswami, A. (2025) · PRX Quantum · doi:10.1103/k4cm-pp9p · Cited by 4
Protected Phase Gate for the 0- π Qubit using its Internal Modes
Kolesnikow, X. C., Smith, T. B., Thomsen, F., Alase, A., & Doherty, A. C. (2025) · PRX Quantum · doi:10.1103/bywc-cx98 · Cited by 2
Metric on the Space of Quantum Processes
Pankovets, E. A., & Fedichkin, L. E. (2024) · Proceedings of the Steklov Institute of Mathematics · doi:10.1134/s0081543824010164 · Cited by 2
Purity‐Assisted Zero‐Noise Extrapolation for Quantum Error Mitigation
Jin, T., Shi, Y., Wang, Z., Li, T., Xu, K., & Fan, H. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202400150 · Cited by 3
Generalizing the matching decoder for the Chamon code
Schwartzman-Nowik, Z., & Brown, B. J. (2025) · Quantum · doi:10.22331/q-2025-06-18-1775 · Cited by 2
Mitra, A., Albash, T., Blocher, P. D., Takahashi, J., Miyake, A., Biedermann, G. W., & Deutsch, I. (2025) · New Journal of Physics · doi:10.1088/1367-2630/ada84f · Cited by 6
Exploring Quantum Computing for Metal Cluster Analysis
Pollard, N., Hines, A. C., & Clayborne, A. Z. (2025) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.5c01404 · Cited by 4
Complexity of Local Quantum Circuits under Nonunital Noise
Shtanko, O., & Sharma, K. (2025) · PRX Quantum · doi:10.1103/xwz2-wfr4 · Cited by 2
High-fidelity universal quantum gates
Li, R., & Gaitan, F. (2010) · Quantum Information and Computation · doi:10.26421/qic10.11-12-4 · Cited by 3
Quantum Error Correction and Fault Tolerant Quantum Computing
Grassl, M., & Rötteler, M. (2011) · Springer eBooks · doi:10.1007/978-1-4614-1800-9_152 · Cited by 3
Ubiquity symposium 'What is computation?'
Bacon, D. (2010) · Ubiquity · doi:10.1145/1895419.1920826 · Cited by 1
Active Fault-Tolerant Quantum Error Correction: The Curse of the Open System
Hagar, A. (2009) · Philosophy of Science · doi:10.1086/648600 · Cited by 2
Hagar, A. (2010) · Synthesis lectures on quantum computing · doi:10.2200/s00290ed1v01y201007qmc004 · Cited by 3
Coherent modification of entanglement: benefits due to extended Hilbert space
Solenov, D. (2016) · Quantum Information and Computation · doi:10.26421/qic16.11-12-2 · Cited by 2
Quantum Information and Statistical Mechanics: An Introduction to Frontier
Fujii, K. (2013) · Interdisciplinary Information Sciences · doi:10.4036/iis.2013.1 · Cited by 3
(2002) · Chapman & Hall/CRC eBooks · doi:10.1201/9781420035377-11 · Cited by 2
The Conventional Security of Cloud Computing and the Growing Threat to Quantum Computing
Shah, R. (2022) · IEEE Global Conference for Advancement in Technology (GCAT) · doi:10.1109/gcat55367.2022.9972028 · Cited by 2
A Converse for Fault-tolerant Quantum Computation
Uthirakalyani, G., Nayak, A. K., & Chatterjee, A. (2023) · Quantum · doi:10.22331/q-2023-08-16-1087 · Cited by 2
Tian, B., Zhibo, 侯. H., & Xiang, G. (2024) · Laser & Optoelectronics Progress · doi:10.3788/lop232751 · Cited by 2
Postselection threshold against biased noise
Reichardt, B. W. (2006) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2006.64 · Cited by 2
Modelling for Quantum Error Mitigation
Weber, T., Riebisch, M., Borras, K., Jansen, K., & Krücker, D. (2021) · IEEE International Conference on Software Architecture Companion (ICSA-C) · doi:10.1109/icsa-c52384.2021.00026 · Cited by 2
Integrated chips and optical cavities for trapped ion quantum information processing
Leibrandt, D. R. (2009) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 3
Kac's random walk and coupon collector's process on posets
Sidenko, S. (2008) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 2
Error Channels and the Threshold for Fault-tolerant Quantum ComputationPreprint
Eastin, B. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0710.2560 · Cited by 5
Parameter Estimation, Model Reduction and Quantum FilteringPreprint
Chase, B. A. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0908.1200 · Cited by 2
Suppression and characterization of decoherence in practical quantum information processing devices
Silva, M. P. D. (2008) · UWSpace (University of Waterloo) · Cited by 2
Error correction and symmetrization in quantum computersPreprint
Peres, A. (1996) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9611046 · Cited by 3
Decoherence and quantum error correction
Knight, P. L., Plenio, M. B., & Vedral, V. (1997) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.1997.0134 · Cited by 3
Aggarwal, V., Calderbank, R., Gilbert, G. N., & Weinstein, Y. S. (2009) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2009.5205593 · Cited by 1
Quantum query complexity and distributed computing
Röhrig, H. (2004) · UvA-DARE (University of Amsterdam) · Cited by 2
Characterizing Noise in Quantum Systems
Magesan, E. (2012) · UWSpace (University of Waterloo) · Cited by 4
Characterizing Errors in Quantum Information Processors
Sanders, Y. R. (2016) · UWSpace (University of Waterloo) · Cited by 2
Quantum Computing: Linear Optics ImplementationsPreprint
Sundsøy, P., & Fjeldberg, E. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1607.03935 · Cited by 2
Fault-tolerant computation without concatenationPreprint
Dennis, E. (1999) · arXiv (Cornell University) · Cited by 2
Quantum error correction and Young tableauxPreprint
Junge, M., Kim, P. T., & Kribs, D. W. (2004) · arXiv (Cornell University) · Cited by 2
Quantum Diagonalization of Hermitean Matrices
Weigert, S. (2000) · White Rose Research Online (University of Leeds, The University of Sheffield, University of York) · Cited by 2
The geometry of non-additive stabiliser codesPreprint
Ball, S., & Puig, P. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2107.11281 · Cited by 2
Fault-Tolerant Quantum Computation
Reichardt, B. W. (2015) · Encyclopedia of Algorithms · doi:10.1007/978-3-642-27848-8_143-2 · Cited by 2
A Quantum Performance Simulator based on fidelity and fault-path countingPreprint
Rynbach, A. J. V., Ahsan, M., Mehta, A. C., Hussmann, J. A., & Kim, J. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1212.0845 · Cited by 2
Partial randomized benchmarking
Dubovitskii, K., & Makhlin, Y. (2022) · Scientific Reports · doi:10.1038/s41598-022-13813-x · Cited by 1
Baspin, N., & Williamson, D. J. (2026) · Quantum · doi:10.22331/q-2026-04-24-2083 · Cited by 9
Native multi-qubit gates in transmon qubits via synchronous driving
Pratapsi, S. S., Cruz, D., & André, P. S. D. B. (2024) · Scientific Reports · doi:10.1038/s41598-024-76396-9 · Cited by 1
Protecting Quantum Gates from Arbitrary Single‐ and Two‐Qubit Errors
Wang, G., Wu, C., Sun, C., & Feng, X. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202500041 · Cited by 1
Suppressing quantum errors by noise-aware circuit design
Hu, Y., Zheng, C., Wang, X., Meng, F., Yu, X., & Zhang, Z. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/ae05c4 · Cited by 3
Symmetric Channel Verification for Purifying Noisy Quantum Channels
Tsubouchi, K., Mitsuhashi, Y., Takagi, R., & Yoshioka, N. (2025) · PRX Quantum · doi:10.1103/jcd6-lft3 · Cited by 5
Unfolded distillation: very low-cost magic state preparation for biased-noise qubits
Ruiz, D., Guillaud, J., Vuillot, C., & Mirrahimi, M. (2026) · npj Quantum Information · doi:10.1038/s41534-026-01197-z · Cited by 15
Spectral Properties and Coding Transitions of Haar-Random Quantum Codes
Sommers, G. M., Jacoby, J. A., Weinstein, Z., Huse, D. A., & Gopalakrishnan, S. (2026) · PRX Quantum · doi:10.1103/d4wh-hqcp · Cited by 3
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
