Fetching the paper…
Reading the bibliography…
We prove new upper bounds on the tolerable level of noise in a quantum circuit.
Elementary gates for quantum computation
A. Barenco, C.H. Bennett, R. Cleve, D.P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. Smolin, and H. Weinfurter · 1995
Earlier work this paper cites.
Scheme for reducing decoherence in quantum memory
P. W. Shor · 1995
Earlier work this paper cites.
A fast quantum mechanical algorithm for database search
L. K. Grover · 1996
Earlier work this paper cites.
Accuracy threshold for quantum computation
M. Knill, R. Laflamme, and W. Zurek · 1996
Earlier work this paper cites.
Fault-tolerant quantum computation
P. W. Shor · 1996
Earlier work this paper cites.
Multiple particle interference and quantum error correction
A. Steane · 1996
Earlier work this paper cites.
Fault tolerant quantum computation with constant error
D. Aharonov and M. Ben-Or · 1997
Earlier work this paper cites.
Quantum complexity theory
E. Bernstein and U. Vazirani · 1997
Earlier work this paper cites.
Stabilizer Codes and Quantum Error Correction
D. Gottesman · 1997
Earlier work this paper cites.
Quantum computations: Algorithms and error correction
A. Yu. Kitaev · 1997
Earlier work this paper cites.
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
P. W. Shor · 1997
Cited alongside, same era.
On the power of quantum computation
D. Simon · 1997
Cited alongside, same era.
Optimal universal and state-dependent quantum cloning
D. Bruss, D. DiVincenzo, A. Ekert, C. Fuchs, C. Macchiavello, and J. Smolin · 1998
Cited alongside, same era.
Resilient quantum computation
E. Knill, R. Laflamme, and W. H. Zurek · 1998
Cited alongside, same era.
Signal propagation and noisy circuits
W. S. Evans and L. J. Schulman · 1999
Cited alongside, same era.
An analysis of completely-positive trace-preserving maps on ℳ 2 {\cal M}_{2}
M. B. Ruskai, S. Szarek, and E. Werner · 2002
Cited alongside, same era.
Quantum computing with realistically noisy devices
M. Knill · 2005
Later among the works it cites.
Quantum universality from Magic States Distillation applied to CSS codes
B. Reichardt · 2005
Later among the works it cites.
Classical simulability, entanglement breaking, and quantum computation thresholds
S. Virmani, S. Huelga, and M. Plenio · 2005
Later among the works it cites.
New limits on fault-tolerant quantum computation
H. Buhrman, R. Cleve, M. Laurent, N. Linden, A. Schrijver, and F. Unger · 2006
Later among the works it cites.
Error-Detection-Based Quantum Fault Tolerance Against Discrete Pauli Noise
B. Reichardt · 2006
Later among the works it cites.
Quantum universality by distilling certain one- and two-qubit states with stabilizer operations
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
On the maximum tolerable noise of k k -input gates for reliable computation by formulas
W. S. Evans and L. J. Schulman · 2003
Cited alongside, same era.
Fault-tolerant postselected quantum computation: Threshold analysis
M. Knill · 2004
Cited alongside, same era.
An upper bound on the threshold quantum decoherence rate
A. Razborov · 2004
Cited alongside, same era.
Universal quantum computation with ideal Clifford gates and noisy ancillas
S. Bravyi and A. Kitaev · 2005
Cited alongside, same era.
B. Reichardt · 2006
Later among the works it cites.
Level Reduction and the Quantum Threshold Theorem
P. Aliferis · 2007
Later among the works it cites.
Threshold lower bounds for Knill’s Fibonacci scheme
P. Aliferis · 2007
Later among the works it cites.
Accuracy threshold for postselected quantum computation
P. Aliferis, D. Gottesman, and J. Preskill · 2008
Closest in time.