Fetching the paper…
Reading the bibliography…
In this paper we introduce a general fault-tolerant quantum error correction protocol using flag circuits for measuring stabilizers of arbitrary distance codes.
Low-density parity-check codes
R. Gallager · 1962
Earlier work this paper cites.
Paths, trees, and flowers
Jack Edmonds · 1965
Earlier work this paper cites.
Fault-tolerant quantum computation
Peter W. Shor · 1996
Earlier work this paper cites.
Good quantum error-correcting codes exist
A. R. Calderbank and Peter W. Shor · 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.
Multiple-Particle Interference and Quantum Error Correction
Andrew W. Steane · 1996
Earlier work this paper cites.
Active stabilization, quantum computation, and quantum state synthesis
A. M. Steane · 1997
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 codes on a lattice with boundary
Sergey Bravyi and Alexei Kitaev · 1998
Earlier work this paper cites.
Reliable quantum computers
John Preskill · 1998
Earlier work this paper cites.
Resilient quantum computation
Emanuel Knill, Raymond Laflamme, and Wojciech H. Zurek · 1998
Earlier work this paper cites.
Unpaired majorana fermions in quantum wires
A Yu Kitaev · 2001
Earlier work this paper cites.
Topological quantum memory
Eric Dennis, Alexei Kitaev, Andrew Landhal, and John Preskill · 2002
Earlier work this paper cites.
Fault-tolerant quantum computation by anyons
A.Yu. Kitaev · 2003
Earlier work this paper cites.
Quantum orders in an exact soluble model
Xiao-Gang Wen · 2003
Cited alongside, same era.
Optimal and efficient decoding of concatenated quantum block codes
David Poulin · 2006
Cited alongside, same era.
Quantum accuracy threshold for concatenated distance-3 codes
Panos Aliferis, Daniel Gottesman, and John Preskill · 2006
Cited alongside, same era.
Topological quantum distillation
H. Bombin and M. A. Martin-Delgado · 2006
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.
Fault-tolerant ancilla preparation and noise threshold lower boudds for the 23-qubit golay code
Adam Paetznick and Ben W. Reichardt · 2012
Later among the works it cites.
Fault tolerance of quantum low-density parity check codes with sublinear distance scaling
Alexey A. Kovalev and Leonid P. Pryadko · 2013
Later among the works it cites.
Quantum ldpc codes with positive rate and minimum distance proportional to the square root of the blocklength
J. P. Tillich and G. Z�mor · 2013
Later among the works it cites.
Fault-tolerant quantum computation with constant overhead
Daniel Gottesman · 2014
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.
Phys. Rev. Lett. , 113:080501, Aug 2014
Jonas T. Anderson, Guillaume Duclos-Cianci, and David Poulin · 2014
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Jesse Fern · 2008
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.
Blossom V: a new implementation of a minimum cost perfect matching algorithm
Vladimir Kolmogorov · 2009
Cited alongside, same era.
An introduction to quantum error correction and fault-tolerant quantum computation
Daniel Gottesman · 2010
Cited alongside, same era.
Surface code quantum computing with error rates over 1
David S. Wang, Austin G. Fowler, and Lloyd C. L. Hollenberg · 2011
Cited alongside, same era.
Fault-tolerant quantum computing with color codes
Andrew J. Landahl, Jonas T. Anderson, and Patrick R. Rice · 2011
Cited alongside, same era.
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.
Minimizing resource overheads for fault-tolerant preparation of encoded states of the steane code
Hayato Goto · 2016
Later among the works it cites.
Scalable designs for quasiparticle-poisoning-protected topological quantum computation with majorana zero modes
Torsten Karzig, Christina Knapp, Roman M. Lutchyn, Parsa Bonderson, Matthew B. Hastings, Chetan Nayak, Jason Alicea, Karsten Flensberg, Stephan Plugge, Yuval Oreg, Charles M. Marcus, and Michael H. Freedman · 2017
Closest in time.
The surface code with a twist
Theodore J. Yoder and Isaac H. Kim · 2017
Closest in time.
Overhead analysis of universal concatenated quantum codes
Christopher Chamberland, Tomas Jochym-O’Connor, and Raymond Laflamme · 2017
Closest in time.
Fault-Tolerant Quantum Computing in the Pauli or Clifford Frame with Slow Error Diagnostics
Christopher Chamberland, Pavithran Iyer, and David Poulin · 2018
Closest in time.