Fetching the paper…
Reading the bibliography…
In fault-tolerant quantum computing schemes, the overhead is often dominated by the cost of preparing codewords reliably.
Encyclopaedia of mathematics: an updated and annotated translation of the Soviet Mathematical encyclopaedia
M Hazewinkel · 1990
Earlier work this paper cites.
Concatenated quantum codes
Emanuel Knill and Raymond Laflamme · 1996
Earlier work this paper cites.
Fault-tolerant quantum computation
Peter W. Shor · 1996
Earlier work this paper cites.
Fault-tolerant quantum computation with constant error rate
Dorit Aharonov and Michael Ben-Or · 1997
Earlier work this paper cites.
Quantum computations: algorithms and error correction
Alexei Yu. Kitaev · 1997
Earlier work this paper cites.
Active stabilization, quantum computation, and quantum state synthesis
Andrew M. Steane · 1997
Earlier work this paper cites.
Threshold estimate for fault tolerant quantum computation, 1997, arXiv:quant-ph/9612028
Christof Zalka · 1997
Earlier work this paper cites.
Handbook of Coding Theory
Vera Pless, Richard A. Brualdi, and W. C. Huffman · 1998
Earlier work this paper cites.
PermGroup
Xiao Gang · 1999
Earlier work this paper cites.
Quantum BCH Codes
Markus Grassl and Thomas Beth · 1999
Earlier work this paper cites.
Topological quantum memory
Eric Dennis, Alexei Yu. Kitaev, Andrew Landahl, and John Preskill · 2002
Earlier work this paper cites.
Fast fault-tolerant filtering of quantum codewords, 2002, arXiv:quant-ph/0202036
Andrew M. Steane · 2002
Cited alongside, same era.
Efficient Synthesis of Linear Reversible Circuits
K. N. Patel, I. L. Markov, and J. P. Hayes · 2003
Cited alongside, same era.
Overhead and noise threshold of fault-tolerant quantum error correction
Andrew M. Steane · 2003
Cited alongside, same era.
Fault-tolerant postselected quantum computation: schemes, 2004, arXiv:quant-ph/0402171
Emanuel Knill · 2004
Cited alongside, same era.
Quantum computing with realistically noisy devices
Emanuel Knill · 2004
Cited alongside, same era.
Improved ancilla preparation scheme increases fault-tolerant threshold, 2004, arXiv:quant-ph/0406025
Ben W. Reichardt · 2004
Cited alongside, same era.
A flow-map model for analyzing pseudothresholds in fault-tolerant quantum computing
K. M. Svore, A. W. Cross, I. L. Chuang, and A. V. Aho · 2006
Later among the works it cites.
Subsystem fault tolerance with the Bacon-Shor code
Panos Aliferis and Andrew W. Cross · 2007
Later among the works it cites.
Level reduction and the quantum threshold theorem
Panos Aliferis · 2007
Later among the works it cites.
Effective fault-tolerant quantum computation with slow measurements
David P. DiVincenzo and Panos Aliferis · 2007
Later among the works it cites.
Fault-tolerant quantum computation with high threshold in two dimensions
Robert Raussendorf and Jim Harrington · 2007
Later among the works it cites.
How to build a 300 bit, 1 Giga-operation quantum computer
Andrew M. Steane · 2007
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Universal quantum computation with ideal Clifford gates and noisy ancillas
Sergey Bravyi and Alexei Yu. Kitaev · 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.
Error-detection-based quantum fault tolerance against discrete Pauli noise
Ben W. Reichardt · 2006
Cited alongside, same era.
A fault-tolerant one-way quantum computer
Robert Raussendorf, Jim Harrington, and Kovid Goyal · 2006
Cited alongside, same era.
Running a Quantum Circuit at the Speed of Data
Nemanja Isailovic, Mark Whitney, Yatish Patel, and John Kubiatowicz · 2008
Later among the works it cites.
Fibonacci scheme for fault-tolerant quantum computation
Panos Aliferis and John Preskill · 2009
Later among the works it cites.
A comparative code study for quantum fault-tolerance
Andrew W. Cross, David P. DiVincenzo, and Barbara M. Terhal · 2009
Later among the works it cites.
qfault: Python modules for counting malignant sets of locations in fault-tolerant quantum circuits
Adam Paetznick and Ben W. Reichardt · 2011
Closest in time.