Fetching the paper…
Reading the bibliography…
The threshold theorem is a fundamental result in the theory of fault-tolerant quantum computation stating that arbitrarily long quantum computations can be performed with a polylogarithmic overhead provided the noise level is below a constant level.
Central limit theorem for nonstationary markov chains. i
Roland L. Dobrushin · 1956
Earlier work this paper cites.
Completely positive linear maps on complex matrices
Man-Duen Choi · 1975
Earlier work this paper cites.
Beyond strong subadditivity? improved bounds on the contraction of generalized relative entropy
Mary Beth Ruskai · 1994
Earlier work this paper cites.
Scheme for reducing decoherence in quantum computer memory
Peter W. Shor · 1995
Earlier work this paper cites.
Limitations of noisy reversible computation
Dorit Aharonov, Michael Ben-Or, Russell Impagliazzo, and Noam Nisan · 1996
Earlier work this paper cites.
Mixed-state entanglement and quantum error correction
Charles H. Bennett, David P. DiVincenzo, John A. Smolin, and William K. Wootters · 1996
Earlier work this paper cites.
Fault-tolerant quantum computation
Peter W. Shor · 1996
Earlier work this paper cites.
Error correcting codes in quantum theory
Andrew M. Steane · 1996
Earlier work this paper cites.
Fault-tolerant quantum computation with constant error
Dorit Aharonov and Michael Ben-Or · 1997
Earlier work this paper cites.
Quantum computations: algorithms and error correction
Alexey Yu Kitaev · 1997
Earlier work this paper cites.
Optimal universal and state-dependent quantum cloning
Dagmar Bruss, David P. DiVincenzo, Artur Ekert, Christopher A. Fuchs, Chiara Macchiavello, and John A. Smolin · 1998
Earlier work this paper cites.
Resilient quantum computation: error models and thresholds
Emanuel Knill, Raymond Laflamme, and Wojciech H. Zurek · 1998
Earlier work this paper cites.
Signal propagation and noisy circuits
William S. Evans and Leonard J. Schulman · 1999
Earlier work this paper cites.
On quantum fidelities and channel capacities
Howard Barnum, Emanuel Knill, and Michael A. Nielsen · 2000
Earlier work this paper cites.
An analysis of completely-positive trace-preserving maps on m2
Mary Beth Ruskai, Stanislaw Szarek, and Elisabeth Werner · 2002
Earlier work this paper cites.
Topological quantum memory
Eric Dennis, Alexei Kitaev, Andrew Landahl, and John Preskill · 2002
Earlier work this paper cites.
Strictly contractive quantum channels and physically realizable quantum computers
Maxim Raginsky · 2002
Earlier work this paper cites.
On the maximum tolerable noise of k-input gates for reliable computation by formulas
William S. Evans and Leonard J. Schulman · 2003
Earlier work this paper cites.
Fault-tolerant quantum computation by anyons
Alexey Yu. Kitaev · 2003
Earlier work this paper cites.
Confinement-higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory
Chenyang Wang, Jim Harrington, and John Preskill · 2003
Earlier work this paper cites.
An upper bound on the threshold quantum decoherence rate
Alexander A. Razborov · 2004
Cited alongside, same era.
Quantum computing with realistically noisy devices
Emanuel Knill · 2005
Cited alongside, same era.
Quantum zero-error capacity
Rex AC Medeiros and Francisco M De Assis · 2005
Cited alongside, same era.
Classical simulability, entanglement breaking, and quantum computation thresholds
Shashank Virmani, Susana F. Huelga, and Martin B. Plenio · 2005
Cited alongside, same era.
Quantum accuracy threshold for concatenated distance-3 codes
Panos Aliferis, Daniel Gottesman, and John Preskill · 2006
Cited alongside, same era.
New limits on fault-tolerant quantum computation
Harry Buhrman, Richard Cleve, Monique Laurent, Noah Linden, Alexander Schrijver, and Falk Unger · 2006
Cited alongside, same era.
Zero-error communication via quantum channels, noncommutative graphs, and a quantum lovász number
Runyao Duan, Simone Severini, and Andreas Winter · 2012
Later among the works it cites.
Surface code quantum computing by lattice surgery
Clare Horsman, Austin G Fowler, Simon Devitt, and Rodney Van Meter · 2012
Later among the works it cites.
Zero-error classical capacity of qubit channels cannot be superactivated
Jeonghoon Park and Soojoon Lee · 2012
Later among the works it cites.
Experimental demonstration of topological error correction
Xing-Can Yao, Tian-Xiong Wang, Hao-Ze Chen, Wei-Bo Gao, Austin G. Fowler, Robert Raussendorf, Zeng-Bing Chen, Nai-Le Liu, Chao-Yang Lu, You-Jin Deng, and et al · 2012
Later among the works it cites.
Michael Ben-Or, Daniel Gottesman, and Avinatan Hassidim · 2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
On the complexity of computing zero-error and holevo capacity of quantum channels
Salman Beigi and Peter W Shor · 2007
Cited alongside, same era.
Fault-tolerant quantum computation with high threshold in two dimensions
Robert Raussendorf and Jim Harrington · 2007
Cited alongside, same era.
Accuracy threshold for postselected quantum computation
Panos Aliferis, Daniel Gottesman, and John Preskill · 2008
Cited alongside, same era.
Fault-tolerant quantum computation against biased noise
Panos Aliferis and John Preskill · 2008
Cited alongside, same era.
Asymmetric quantum codes: constructions, bounds and performance
Pradeep Kiran Sarvepalli, Andreas Klappenecker, and Martin Rötteler · 2008
Cited alongside, same era.
Fibonacci scheme for fault-tolerant quantum computation
Panos Aliferis and John Preskill · 2009
Cited alongside, same era.
Fault-tolerant quantum computation with asymmetric bacon-shor codes
Peter Brooks and John Preskill · 2013
Later among the works it cites.
Fault-tolerant quantum computation with constant overhead
Daniel Gottesman · 2014
Later among the works it cites.
On superactivation of zero-error capacities and reversibility of a quantum channel
Maksim Shirokov and Tatiana Shulman · 2015
Later among the works it cites.
Quantum error correction for quantum memories
Barbara M. Terhal · 2015
Later among the works it cites.
Quantum memories at finite temperature
Benjamin J. Brown, Daniel Loss, Jiannis K. Pachos, Chris N. Self, and James R. Wootton · 2016
Later among the works it cites.
Relative entropy convergence for depolarizing channels
Alexander Müller-Hermes, Daniel Stilck França, and Michael M Wolf · 2016
Later among the works it cites.
Poking holes and cutting corners to achieve clifford gates with the surface code
Benjamin J. Brown, Katharina Laubscher, Markus S. Kesselring, and James R. Wootton · 2017
Later among the works it cites.
Roads towards fault-tolerant universal quantum computation
Earl T. Campbell, Barbara M. Terhal, and Christophe Vuillot · 2017
Later among the works it cites.
Constant overhead quantum fault-tolerance with quantum expander codes
Omar Fawzi, Antoine Grospellier, and Anthony Leverrier · 2018
Later among the works it cites.
Ultrahigh error threshold for surface codes with biased noise
David K. Tuckett, Stephen D. Bartlett, and Steven T. Flammia · 2018
Later among the works it cites.
The Theory of Quantum Information
John Watrous · 2018
Later among the works it cites.
Repetition cat qubits for fault-tolerant quantum computation
Jérémie Guillaud and Mazyar Mirrahimi · 2019
Later among the works it cites.
End-to-end capacities of a quantum communication network
Stefano Pirandola · 2019
Later among the works it cites.
Quantum Rényi and f f -divergences from integral representations
Christoph Hirche and Marco Tomamichel · 2023
Closest in time.