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 301–400 of 633
Mitigation of Decoherence-Induced Quantum-Bit Errors and Quantum-Gate Errors Using Steane’s Code
Cane, R., Chandra, D., Ng, S. X., & Hanzo, L. (2020) · IEEE Access · doi:10.1109/access.2020.2991802 · Cited by 13
An upper bound on the threshold quantum decoherence rate
Razborov, A. A. (2004) · Quantum Information and Computation · doi:10.26421/qic4.3-7 · Cited by 14
Lower bounds for quantum computation and communication
Nayak, A., & Vazirani, U. V. (1999) · Cited by 14
Efficient linear optics quantum computation
Milburn, G. J., Ralph, T. C., White, A. G., Knill, E. H., & Laflamme, R. (2001) · Quantum Information and Computation · doi:10.26421/qic1.s-4 · Cited by 14
Logic Synthesis for Fault-Tolerant Quantum ComputersPreprint
Jones, N. C. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1310.7290 · Cited by 18
Hamiltonian Sparsification and Gap-SimulationPreprint
Aharonov, D., & Zhou, L. (2018) · arXiv (Cornell University) · doi:10.4230/lipics.itcs.2019.2 · Cited by 21
Self-citationFault Models for Quantum Mechanical Switching NetworksPreprint
Biamonte, J. S. A. J. D., Allen, J., & Perkowski, M. A. (2005) · Cited by 15
Experimental Demonstration of High-Fidelity Logical Magic States from Code Switching
Daguerre, L., Blume-Kohout, R., Brown, N. C., Hayes, D., & Kim, I. H. (2025) · Physical Review X · doi:10.1103/dck4-x9c2 · Cited by 13
Improved Low-Depth SHA3 Quantum Circuit for Fault-Tolerant Quantum Computers
Song, G., Jang, K., & Seo, H. (2023) · Applied Sciences · doi:10.3390/app13063558 · Cited by 14
Halder, S., Shrikhande, C., & Maitra, R. (2023) · The Journal of Chemical Physics · doi:10.1063/5.0166433 · Cited by 13
Decoding quantum color codes with MaxSAT
Berent, L., Burgholzer, L., Derks, P.-J. H. S., Eisert, J., & Wille, R. (2024) · Quantum · doi:10.22331/q-2024-10-23-1506 · Cited by 13
Minimizing Resource Overhead in Fusion-Based Quantum Computation Using Hybrid Spin-Photon Devices
Wein, S. C., de Brugière, T. G., Music, L., Senellart, P., Bourdoncle, B., & Mansfield, S. (2025) · PRX Quantum · doi:10.1103/8l5g-x3b7 · Cited by 23
Quantum algorithm for preparing the ground state of a system via resonance transition
Wang, H. (2017) · Scientific Reports · doi:10.1038/s41598-017-16396-0 · Cited by 13
High-level interconnect model for the quantum logic array architecture
Metodi, T. S., Thaker, D., Cross, A. W., Chuang, I. L., & Chong, F. T. (2008) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/1330521.1330522 · Cited by 13
Implementations of quantum logic: fundamental and experimental limits
Bose, S., Knight, P. L., Murao, M., Plenio, M. B., & Vedral, V. (1998) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.1998.0251 · Cited by 17
Improving quantum circuit dependability with reconfigurable quantum gate arrays
Udrescu, M., Prodan, L., & Vlăduţiu, M. (2005) · ACM International Conference on Computing Frontiers (CF) · doi:10.1145/1062261.1062286 · Cited by 13
Quantum Codes on Hurwitz Surfaces
Kim, I. H. (2007) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 16
Quantum Computers: Noise Propagation and Adversarial Noise ModelsPreprint
Kalai, G. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0904.3265 · Cited by 13
On the Evolutionary Design of Quantum Circuits
Reid, T. (2005) · UWSpace (University of Waterloo) · Cited by 12
Superradiance as a source of collective decoherence in quantum computers
Yavuz, D. D. (2014) · Journal of the Optical Society of America B · doi:10.1364/josab.31.002665 · Cited by 12
Theory of quasi-exact fault-tolerant quantum computing and valence-bond-solid codes
Wang, D., Wang, Y.-J., Cao, N., Zeng, B., & Laflamme, R. (2021) · New Journal of Physics · doi:10.1088/1367-2630/ac4737 · Cited by 12
Rong, X., Lu, D., Kong, X., Geng, J., Wang, Y., Shi, F., Duan, C., & Du, J. (2016) · Advances in Physics X · doi:10.1080/23746149.2016.1266914 · Cited by 11
7 Implementations of Quantum Logic: Fundamental and Experimental Limits
Bose, S., Knight, P. L., Murao, M., Plenio, M. B., & Vedral, V. (1998) · Cited by 12
A Cat-State Benchmark on a Seven Bit Quantum ComputerPreprint
Knill, E. H., Laflamme, R., Martínez, R., & Tseng, C.-H. (1999) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9908051 · Cited by 14
Covariant Quantum Error Correcting Codes via Reference FramesPreprint
Yang, Y., Mo, Y., Renes, J. M., Chiribella, G., & Woods, M. P. (2020) · arXiv (Cornell University) · Cited by 12
Local clustering decoder as a fast and adaptive hardware decoder for the surface code
Ziad, A. B., Zalawadiya, A., Topal, C., Camps, J., Gehér, G. P., Stafford, M. P., & Turner, M. L. (2025) · Nature Communications · doi:10.1038/s41467-025-66773-x · Cited by 34
Combining Hard and Soft Decoders for Hypergraph Product Codes
Grospellier, A., Grouès, L., Krishna, A., & Leverrier, A. (2019) · HAL · Cited by 13
Classification of transversal gates in qubit stabilizer codes
Anderson, J. T., & Jochym-O’Connor, T. (2016) · Quantum Information and Computation · doi:10.26421/qic16.9-10-3 · Cited by 11
Quantum computer architecture for fast entropy extraction
Steane, A. M. (2002) · Quantum Information and Computation · doi:10.26421/qic2.4-3 · Cited by 11
State of the art and prospects for quantum computingPreprint
Dyakonov, M. I. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1212.3562 · Cited by 16
UNIVERSAL COLLECTIVE ROTATION CHANNELS AND QUANTUM ERROR CORRECTIONPreprint
Junge, M., Kim, P. T., Kribs, D. W., & Kribs, W. (2004) · Cited by 9
Symmetric Clifford twirling for cost-optimal quantum error mitigation in early FTQC regime
Tsubouchi, K., Mitsuhashi, Y., Sharma, K., & Yoshioka, N. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01050-9 · Cited by 11
Constant-overhead magic state distillation
Wills, A., Hsieh, M.-H., & Yamasaki, H. (2025) · Nature Physics · doi:10.1038/s41567-025-03026-0 · Cited by 85
Performance and error analysis of Knill's postselection scheme in a two-dimensional architecture
Lai, C., Paz-Silva, G. A., Suchara, M., & Brun, T. A. (2014) · Quantum Information and Computation · doi:10.26421/qic14.9-10-7 · Cited by 10
Taherkhani, A., Navi, K., & Meter, R. V. (2017) · Quantum Science and Technology · doi:10.1088/2058-9565/aa9bb1 · Cited by 18
Local-dimension-invariant qudit stabilizer codes
Gunderman, L. G. (2020) · Physical Review A · doi:10.1103/physreva.101.052343 · Cited by 14
A direct approach to fault-tolerance in measurement-based quantum computation via teleportation
Silva, M. P. D., Vincent Danos, A., Kashefi, E., & Ollivier, H. (2007) · HAL · Cited by 10
Optimal correction of concatenated fault-tolerant quantum codes
Evans, Z. W. E., & Stephens, A. M. (2011) · Quantum Information Processing · doi:10.1007/s11128-011-0312-4 · Cited by 12
On optimising quantum communication in verifiable quantum computingPreprint
Kapourniotis, T., Dunjko, V., & Kashefi, E. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1506.06943 · Cited by 10
Electron Spins in Semiconductor Quantum Dots
Hanson, R. (2005) · Data Archiving and Networked Services (DANS) · Cited by 10
Noise-resilient preparation of quantum many-body ground statesPreprint
Kim, I. H. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1703.00032 · Cited by 10
Quantum RefrigeratorPreprint
Ben-Or, M., Gottesman, D., & Hassidim, A. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.1995 · Cited by 61
Self-citationPurifying Quantum States: Quantum and Classical AlgorithmsPreprint
Dennis, E. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0503169 · Cited by 16
Magic state distillation and cost analysis in fault-tolerant universal quantum computation
Liu, Y., Ma, Z., Luo, L., Du, C., Fei, Y., Wang, H., Duan, Q., & Yang, J. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/ace6ca · Cited by 9
Partial Syndrome Measurement for Hypergraph Product Codes
Berthusen, N., & Gottesman, D. (2024) · Quantum · doi:10.22331/q-2024-05-14-1345 · Cited by 9
Williamson, D. J., & Baspin, N. (2024) · Nature Communications · doi:10.1038/s41467-024-53881-3 · Cited by 22
Simulating non-completely positive actions via exponentiation of Hermitian-preserving maps
Wei, F., Liu, Z., Liu, G., Han, Z., Deng, D.-L., & Liu, Z. (2024) · npj Quantum Information · doi:10.1038/s41534-024-00949-z · Cited by 14
QECC-Synth: A Layout Synthesizer for Quantum Error Correction Codes on Sparse Architectures
Yin, K., Zhang, H., Fang, X., Shi, Y., Humble, T. S., Li, A., & Ding, Y. (2025) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3669940.3707236 · Cited by 15
Low-temperature environments for quantum computation and quantum simulation*
Fu, H., Wang, P., Hu, Z., Li, Y., & Lin, X. (2020) · Chinese Physics B · doi:10.1088/1674-1056/abd762 · Cited by 10
Theory Behind Quantum Error Correcting Codes: An Overview
Garani, S. S., Nadkarni, P. J., & Raina, A. (2023) · Journal of the Indian Institute of Science · doi:10.1007/s41745-023-00392-7 · Cited by 9
Arbitrated Quantum Signature Schemes: Attacks and Security
Zou, X., & Qiu, D. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38756-2_8 · Cited by 9
Physical design of quantum circuits in ion trap technology – A survey
Mohammadzadeh, N. (2016) · Microelectronics Journal · doi:10.1016/j.mejo.2016.07.001 · Cited by 9
Comparison of memory thresholds for planar qudit geometries
Marks, J. A., Jochym-O’Connor, T., & Gheorghiu, V. (2017) · New Journal of Physics · doi:10.1088/1367-2630/aa939a · Cited by 10
Oskin, M., Chong, F. T., Chuang, I. L., & Kubiatowicz, J. D. (2003) · ACM SIGARCH Computer Architecture News · doi:10.1145/871656.859661 · Cited by 9
Classical and Quantum Information Transmission and Interactions
Bennett, C. H. (1997) · Springer eBooks · doi:10.1007/978-1-4615-5923-8_4 · Cited by 10
Computational Distinguishability of Quantum ChannelsPreprint
Rosgen, B. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0909.3930 · Cited by 12
Asymptotically Good Quantum Codes with Transversal Non-Clifford Gates
Golowich, L., & Guruswami, V. (2025) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3717823.3718234 · Cited by 8
Detrimental non-Markovian errors for surface code memory
Kam, J. F., Gicev, S., Modi, K. K., Southwell, A., & Usman, M. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/adebab · Cited by 16
Variational Quantum Computing for Quantum Simulation: Principles, Implementations, and Challenges
Galvão, L. Q., de Souza, A. B. M., Moret, M. A., & Cruz, C. (2025) · Brazilian Journal of Physics · doi:10.1007/s13538-025-01946-z · Cited by 8
Lightcone bounds for quantum circuit mapping via uncomplexity
Steinberg, M., Bandić, M., Szkudlarek, S., Almudéver, C. G., Sarkar, A., & Feld, S. (2024) · npj Quantum Information · doi:10.1038/s41534-024-00909-7 · Cited by 8
Benchmarking quantum error-correcting codes on quasi-linear and central-spin processors
Finsterhoelzl, R., & Burkard, G. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/aca21f · Cited by 8
Choukroun, Y., & Wolf, L. (2024) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v38i1.27756 · Cited by 13
Quantum Memory as a Perpetuum Mobile? Stability vs. Reversibility of Information Processing
Alicki, R. (2012) · Open Systems & Information Dynamics · doi:10.1142/s1230161212500163 · Cited by 8
Composite anyon coding and the initialization of a topological quantum computer
König, R. (2010) · Physical Review A · doi:10.1103/physreva.81.052309 · Cited by 8
Generalized concatenation for quantum codes
Grassl, M., Shor, P. W., & Zeng, B. (2009) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2009.5205592 · Cited by 8
How Quantum Computers Can FailPreprint
Kalai, G. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0607021 · Cited by 8
Quantum stabilizer codes and beyondPreprint
Sarvepalli, P. K. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0810.2574 · Cited by 9
Ahn, C. (2004) · CaltechTHESIS (California Institute of Technology) · doi:10.7907/thd5-a335 · Cited by 10
The Quantum Computer Puzzle (Expanded Version)Preprint
Kalai, G. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1605.00992 · Cited by 8
Das, P., Locharla, A., & Jones, C. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2108.06569 · Cited by 8
Improved rate-distance trade-offs for quantum codes with restricted connectivity
Baspin, N., Guruswami, V., Krishna, A., & Li, R. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad8370 · Cited by 9
Minimum-Consumption Discrimination of Quantum States via Globally Optimal Adaptive Measurements
Tian, B., Yan, W.-Z., Hou, Z., Xiang, G., Li, C., & Guo, G. (2024) · Physical Review Letters · doi:10.1103/physrevlett.132.110801 · Cited by 7
Motta, M., Sung, K. J., & Shee, J. (2024) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.4c02847 · Cited by 8
Progress, status, and prospects of superconducting qubits for quantum computing
Steffen, M., Gambetta, J., & Chow, J. M. (2016) · European Solid-State Device Research Conference · doi:10.1109/essderc.2016.7599578 · Cited by 7
Quantum advantage from energy measurements of many-body quantum systems
Novo, L., Bermejo-Vega, J., & García−Patrón, R. (2021) · Quantum · doi:10.22331/q-2021-06-02-465 · Cited by 14
Towards Quantum Large-Scale Password Guessing on Real-World Distributions
Dürmuth, M., Golla, M., Markert, P., May, A., & Schlieper, L. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-92548-2_22 · Cited by 8
Scalable quantum measurement error mitigation via conditional independence and transfer learning
Lee, C., & Park, D. K. (2023) · Machine Learning Science and Technology · doi:10.1088/2632-2153/ad1007 · Cited by 10
Sarvepalli, P. K., Klappenecker, A., & Aly, S. A. (2007) · Chapman & Hall/CRC applied mathematics and nonlinear science series · doi:10.1201/9781584889007.ch10 · Cited by 7
The idiots guide to Quantum Error CorrectionPreprint
Devitt, S. J., Nemoto, K., & Munro, W. J. (2009) · arXiv (Cornell University) · Cited by 7
Quantum Error Correction with Biased Noise
Brooks, P. (2013) · CaltechTHESIS (California Institute of Technology) · doi:10.7907/1tvt-j780 · Cited by 7
Fault-tolerant thresholds for encoded ancillae with homogeneous errors
Eastin, B. (2007) · Physical Review A · doi:10.1103/physreva.75.022301 · Cited by 7
Onset of decoherence in open quantum systems
Vladimir Privman, A. (2003) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.488750 · Cited by 7
Detrimental DecoherencePreprint
Kalai, G. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0806.2443 · Cited by 7
Calibrating quantum gates up to 52 qubits in a superconducting processor
Fan, D., Liu, G., Li, S., Gong, M., Wu, D., Zhang, Y., Zha, C., Chen, F., Cao, S., Ye, Y., et al. (2025) · npj Quantum Information · doi:10.1038/s41534-025-00983-5 · Cited by 9
Multilayered logical qubits and synthesized quantum bits
Jin, K., & Cha, G. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/accec5 · Cited by 6
Quantum Fault Tolerance in Systems with Restricted Control
Fitzsimons, J. F., & Twamley, J. (2009) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2009.12.012 · Cited by 6
Design for dependability in emerging technologies
Prodan, L., Udrescu, M., Boncalo, O., & Vlăduţiu, M. (2007) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/1265949.1265952 · Cited by 6
Not all physical errors can be linear CPTP maps in a correlation space
Morimae, T., & Fujii, K. (2012) · Scientific Reports · doi:10.1038/srep00508 · Cited by 6
High fidelity universal set of quantum gates using non-adiabatic rapid passage
Li, R., Hoover, M., & Gaitan, F. (2009) · Quantum Information and Computation · doi:10.26421/qic9.3-4-7 · Cited by 6
Upper bounds on the noise threshold for fault-tolerant quantum computing
Kempe, J., Regev, O., Unger, F., & de Wolf, R. (2010) · Quantum Information and Computation · doi:10.26421/qic10.5-6-1 · Cited by 6
Speedup of iterated quantum search by parallel performancePreprint
Ozhigov, Y. (1999) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9904039 · Cited by 7
Complete Toy Models of Holographic DualityPreprint
Kohler, T., & Cubitt, T. S. (2018) · arXiv (Cornell University) · Cited by 7
Magic state distillation with punctured polar codesPreprint
Krishna, A., & Tillich, J. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1811.03112 · Cited by 6
Alwan, N. A., Obaiys, S. J., Al-Saidi, N. M. G., Noor, N. F. B. M., & Karaca, Y. (2025) · AIMS Mathematics · doi:10.3934/math.2025499 · Cited by 6
Simulated fault injection methodology for gate-level quantum circuit reliability assessment
Udrescu, M., Prodan, L., & Vlăduţiu, M. (2012) · Simulation Modelling Practice and Theory · doi:10.1016/j.simpat.2012.01.001 · Cited by 5
Reducing Quantum Error Correction Overhead With Versatile Flag-Sharing Syndrome Extraction Circuits
Liou, P.-H., & Lai, C. (2025) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2025.3572764 · Cited by 5
SECURE QUANTUM CARRIERS FOR QUANTUM STATE SHARING
Karimipour, V., & Marvian, M. (2012) · International Journal of Quantum Information · doi:10.1142/s0219749912500189 · Cited by 5
High-fidelity single-qubit gates using non-adiabatic rapid passage
Li, R., Hoover, M., & Gaitan, F. (2007) · Quantum Information and Computation · doi:10.26421/qic7.7-3 · Cited by 6
Simulation of Quantum Computations in Lisp
Desmet, B., & Costanza, P. (2006) · Cited by 5
Fault-tolerant quantum computer architectures using hierarchies of quantum error-correcting codes
Chuang, I. L., & Cross, A. W. (2008) · Cited by 7
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
