Fetching the paper…
Reading the bibliography…
The surface code is one of the most successful approaches to topological quantum error-correction.
Good quantum error-correcting codes exist
A. R. Calderbank and 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
Peter W Shor · 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.
Perfect quantum error correcting code
Raymond Laflamme, Cesar Miquel, Juan Pablo Paz, and Wojciech Hubert Zurek · 1996
Earlier work this paper cites.
Quantum codes on a lattice with boundary
Sergey B Bravyi and A Yu Kitaev · 1998
Earlier work this paper cites.
Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations
Daniel Gottesman and Isaac L Chuang · 1999
Earlier work this paper cites.
Topological quantum memory
Eric Dennis, Alexei Kitaev, Andrew Landahl, and John Preskill · 2002
Earlier work this paper cites.
Universal quantum computation with ideal clifford gates and noisy ancillas
Sergey Bravyi and Alexei Kitaev · 2005
Earlier work this paper cites.
Quantum computing with realistically noisy devices
Emanuel Knill · 2005
Earlier work this paper cites.
Topological quantum distillation
Héctor Bombín and Miguel Angel Martin-Delgado · 2006
Earlier work this paper cites.
Quantum accuracy threshold for concatenated distance-3 codes
Panos Aliferis, Daniel Gottesman, and John Preskill · 2006
Earlier work this paper cites.
A flow-map model for analyzing pseudothresholds in fault-tolerant quantum computing
Krysta M Svore, Andrew W Cross, Isaac L Chuang, and Alfred V Aho · 2006
Earlier work this paper cites.
Fault-tolerant quantum computation with high threshold in two dimensions
Robert Raussendorf and Jim Harrington · 2007
Earlier work this paper cites.
Optimal resources for topological two-dimensional stabilizer codes: Comparative study
H Bombin and MA Martin-Delgado · 2007
Cited alongside, same era.
Effective fault-tolerant quantum computation with slow measurements
David P DiVincenzo and Panos Aliferis · 2007
Cited alongside, same era.
Subsystem fault tolerance with the Bacon-Shor code
Panos Aliferis and Andrew W Cross · 2007
Cited alongside, same era.
Quantum measurements and gates by code deformation
H Bombin and MA Martin-Delgado · 2009
Cited alongside, same era.
High-threshold universal quantum computation on the surface code
Austin G Fowler, Ashley M Stephens, and Peter Groszkowski · 2009
Cited alongside, same era.
A comparative code study for quantum fault tolerance
Andrew W Cross, David P Divincenzo, and Barbara M Terhal · 2009
Cited alongside, same era.
Surface code implementation of block code state distillation
Austin G Fowler, Simon J Devitt, and Cody Jones · 2013
Later among the works it cites.
Fault-tolerant quantum computation with asymmetric Bacon-Shor codes
Peter Brooks and John Preskill · 2013
Later among the works it cites.
Low-distance surface codes under realistic quantum noise
Yu Tomita and Krysta M Svore · 2014
Later among the works it cites.
Efficient Markov chain Monte Carlo algorithm for the surface code
Adrian Hutter, James R Wootton, and Daniel Loss · 2014
Later among the works it cites.
Efficient algorithms for maximum likelihood decoding in the surface code
Sergey Bravyi, Martin Suchara, and Alexander Vargo · 2014
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 commuting local Hamiltonians, and tight conditions for topological order in such systems
Dorit Aharonov and Lior Eldar · 2011
Cited alongside, same era.
Surface code quantum computing with error rates over 1%
David S Wang, Austin G Fowler, and Lloyd CL Hollenberg · 2011
Cited alongside, same era.
Surface codes: Towards practical large-scale quantum computation
Austin G Fowler, Matteo Mariantoni, John M Martinis, and Andrew N Cleland · 2012
Cited alongside, same era.
High threshold error correction for the surface code
James R Wootton and Daniel Loss · 2012
Cited alongside, same era.
A bridge to lower overhead quantum computation
Austin G Fowler and Simon J Devitt · 2012
Cited alongside, same era.
Time-optimal quantum computation
Austin G Fowler · 2012
Cited alongside, same era.
Andrew J Landahl and Ciaran Ryan-Anderson · 2014
Later among the works it cites.
Efficient fault-tolerant decoding of topological color codes
Ashley M Stephens · 2014
Later among the works it cites.
Gauge color codes: optimal transversal gates and gauge fixing in topological stabilizer codes
Héctor Bombín · 2015
Later among the works it cites.
Universal transversal gates with color codes: A simplified approach
Aleksander Kubica and Michael E Beverland · 2015
Later among the works it cites.
Reduced space-time and time costs using dislocation codes and arbitrary ancillas
Matthew B Hastings and A Geller · 2015
Later among the works it cites.
Unfolding the color code
Aleksander Kubica, Beni Yoshida, and Fernando Pastawski · 2015
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 · 2016
Closest in time.
Transversal clifford gates on folded surface codes
Jonathan E Moussa · 2016
Closest in time.
Quantum fault tolerance in small experiments
Daniel Gottesman · 2016
Closest in time.