Fetching the paper…
Reading the bibliography…
The development of practical, high-performance decoding algorithms reduces the resource cost of fault-tolerant quantum computing.
“Paths, trees, and flowers”
Jack Edmonds · 1965
Earlier work this paper cites.
“Efficient estimation of free energy differences from monte carlo data”
Charles H Bennett · 1976
Earlier work this paper cites.
“Scheme for reducing decoherence in quantum computer memory”
Peter W Shor · 1995
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 Robert Calderbank and Peter W Shor · 1996
Earlier work this paper cites.
“Simple quantum error-correcting codes”
Andrew M Steane · 1996
Earlier work this paper cites.
“Quantum codes on a lattice with boundary” (1998)
S. B. Bravyi and A. Yu. Kitaev · 1998
Earlier work this paper cites.
“Theory of fault-tolerant quantum computation”
Daniel Gottesman · 1998
Earlier work this paper cites.
“Topological quantum memory”
Eric Dennis, Alexei Kitaev, Andrew Landahl, and John Preskill · 2002
Earlier work this paper cites.
“Fault-tolerant quantum computation by anyons”
A 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.
“Long-range quantum entanglement in noisy cluster states”
Robert Raussendorf, Sergey Bravyi, and Jim Harrington · 2005
Earlier work this paper cites.
“Topological quantum distillation”
H. Bombin and M. A. Martin-Delgado · 2006
Earlier work this paper cites.
“Topological computation without braiding”
Hector Bombin and Miguel-Angel Martin-Delgado · 2007
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.
“Fast decoders for topological quantum codes”
Guillaume Duclos-Cianci and David Poulin · 2010
Earlier work this paper cites.
“Graphical algorithms and threshold error rates for the 2d color code”
David S. Wang, Austin G. Fowler, Charles D. Hill, and Lloyd C. L. Hollenberg · 2010
Earlier work this paper cites.
“Error correction and degeneracy in surface codes suffering loss”
Thomas M Stace and Sean D Barrett · 2010
Earlier work this paper cites.
“Classification of quantum phases and topology of logical operators in an exactly solved model of quantum codes”
Beni Yoshida · 2011
Earlier work this paper cites.
“Toric codes and quantum doubles from two-body hamiltonians”
Courtney G Brell, Steven T Flammia, Stephen D Bartlett, and Andrew C Doherty · 2011
Earlier work this paper cites.
“High threshold error correction for the surface code”
James R Wootton and Daniel Loss · 2012
Earlier work this paper cites.
“Surface codes: Towards practical large-scale quantum computation”
Austin G. Fowler, Matteo Mariantoni, John M. Martinis, and Andrew N. Cleland · 2012
Earlier work this paper cites.
“Universal topological phase of two-dimensional stabilizer codes”
Hector Bombin, Guillaume Duclos-Cianci, and David Poulin · 2012
Earlier work this paper cites.
“Coping with qubit leakage in topological codes”
Austin G. Fowler · 2013
Earlier work this paper cites.
“Optimal complexity correction of correlated errors in the surface code” (2013)
Austin G. Fowler · 2013
Earlier work this paper cites.
“Simulation of rare events in quantum error correction”
Sergey Bravyi and Alexander Vargo · 2013
Earlier work this paper cites.
“Fast decoders for qudit topological codes”
Hussain Anwar, Benjmain J. Brown, Earl. T. Campbell, and Dan E. Browne · 2014
Cited alongside, same era.
“Efficient markov chain monte carlo algorithm for the surface code”
Adrian Hutter, James R Wootton, and Daniel Loss · 2014
Cited alongside, same era.
“Quantifying the effects of local many-qubit errors and nonlocal two-qubit errors on the surface code”
Austin G. Fowler and John M. Martinis · 2014
Cited alongside, same era.
“Breakdown of surface-code error correction due to coupling to a bosonic bath”
Adrian Hutter and Daniel Loss · 2014
Cited alongside, same era.
“A decoding algorithm for css codes using the x/z correlations”
Nicolas Delfosse and Jean-Pierre Tillich · 2014
Cited alongside, same era.
“Quantum error correction for quantum memories”
Barbara M Terhal · 2015
“Quantum computing is scalable on a planar array of qubits with fabrication defects” (2021)
Armands Strikis, Simon C. Benjamin, and Benjamin J. Brown · 2021
Later among the works it cites.
“Correcting spanning errors with a fractal code”
Georgia M Nixon and Benjamin J Brown · 2021
Later among the works it cites.
“Cost of universality: A comparative study of the overhead of state distillation and code switching with color codes”
Michael E. Beverland, Aleksander Kubica, and Krysta M. Svore · 2021
Later among the works it cites.
“Subsystem codes with high thresholds by gauge fixing and reduced qubit overhead”
Oscar Higgott and Nikolas P. Breuckmann · 2021
Later among the works it cites.
“Realizing repeated quantum error correction in a distance-three surface code”
Sebastian Krinner, Nathan Lacroix, Ants Remm, Agustin Di Paolo, Elie Genois, Catherine Leroux, Christoph Hellings, Stefania Lazar, Francois Swiadek, Johannes Herrmann, Graham J. Norris, Christian Kraglund Andersen, Markus Müller, Alexandre Blais, Christopher Eichler, and Andreas Wallraff · 2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
“Gauge color codes: optimal transversal gates and gauge fixing in topological stabilizer codes”
Héctor Bombín · 2015
Cited alongside, same era.
“Universal transversal gates with color codes: A simplified approach”
Aleksander Kubica and Michael E. Beverland · 2015
Cited alongside, same era.
“Unfolding the color code”
Aleksander Kubica, Beni Yoshida, and Fernando Pastawski · 2015
Cited alongside, same era.
“Equivalence of 2d color codes (without translational symmetry) to surface codes”
Arjun Bhagoji and Pradeep Sarvepalli · 2015
Cited alongside, same era.
“Quantum memories at finite temperature”
Benjamin J Brown, Daniel Loss, Jiannis K Pachos, Chris N Self, and James R Wootton · 2016
Cited alongside, same era.
“Noise thresholds for the [[4, 2, 2]]-concatenated toric code” (2016)
Ben Criger and Barbara Terhal · 2016
Cited alongside, same era.
“Adaptive surface code for quantum error correction in the presence of temporary or permanent defects” (2022)
Adam Siegel, Armands Strikis, Thomas Flatters, and Simon Benjamin · 2022
Later among the works it cites.
“Decoder for the triangular color code by matching on a möbius strip”
Kaavya Sahay and Benjamin J Brown · 2022
Later among the works it cites.
“Benchmarking the Planar Honeycomb Code”
Craig Gidney, Michael Newman, and Matt McEwen · 2022
Later among the works it cites.
“Anyon condensation and the color code” (2022)
Markus S. Kesselring, Julio C. Magdalena de la Fuente, Felix Thomsen, Jens Eisert, Stephen D. Bartlett, and Benjamin J. Brown · 2022
Later among the works it cites.
“Conservation laws and quantum error correction: towards a generalised matching decoder” (2022)
Benjamin J Brown · 2022
Later among the works it cites.
“The x y z 2 xyz^{2} hexagonal stabilizer code”
Basudha Srivastava, Anton Frisk Kockum, and Mats Granath · 2022
Later among the works it cites.
“Tailoring three-dimensional topological codes for biased noise” (2022)
Eric Huang, Arthur Pesah, Christopher T. Chubb, Michael Vasmer, and Arpit Dua · 2022
Later among the works it cites.
“Boundaries for the Honeycomb Code”
Jeongwan Haah and Matthew B. Hastings · 2022
Later among the works it cites.
“Demonstrating multi-round subsystem quantum error correction using matching and maximum likelihood decoders”
Neereja Sundaresan, Theodore J. Yoder, Youngseok Kim, Muyuan Li, Edward H. Chen, Grace Harper, Ted Thorbeck, Andrew W. Cross, Antonio D. Córcoles, and Maika Takita · 2023
Closest in time.
“Suppressing quantum errors by scaling a surface code logical qubit”
Google Quantum AI · 2023
Closest in time.
“Encoding a magic state with beyond break-even fidelity” (2023)
Riddhi S. Gupta, Neereja Sundaresan, Thomas Alexander, Christopher J. Wood, Seth T. Merkel, Michael B. Healy, Marius Hillenbrand, Tomas Jochym-O’Connor, James R. Wootton, Theodore J. Yoder, Andrew W. Cross, Maika Takita, and Benjamin J. Brown · 2023
Closest in time.
“Sparse blossom: correcting a million errors per core second with minimum-weight matching” (2023)
Oscar Higgott and Craig Gidney · 2023
Closest in time.
“Empirical overhead of the adapted surface code on defective qubit arrays” (2023)
Sophia Fuhui Lin, Joshua Viszlai, Kaitlin N. Smith, Gokul Subramanian Ravi, Charles Yuan, Frederic T. Chong, and Benjamin J. Brown · 2023
Closest in time.
“A cellular automaton decoder for a noise-bias tailored color code”
Jonathan F. San Miguel, Dominic J. Williamson, and Benjamin J. Brown · 2023
Closest in time.
“Efficient color code decoders in d \ g e q 2 d\backslash geq2 dimensions from toric code decoders”
Aleksander Kubica and Nicolas Delfosse · 2023
Closest in time.
“Performance of planar floquet codes with majorana-based qubits”
Adam Paetznick, Christina Knapp, Nicolas Delfosse, Bela Bauer, Jeongwan Haah, Matthew B. Hastings, and Marcus P. da Silva · 2023
Closest in time.
“Improved decoding of circuit noise and fragile boundaries of tailored surface codes”
Oscar Higgott, Thomas C Bohdanowicz, Aleksander Kubica, Steven T Flammia, and Earl T Campbell · 2023
Closest in time.
“New circuits and an open source decoder for the color code” (2023)
Craig Gidney and Cody Jones · 2023
Closest in time.
“Bias-tailored quantum ldpc codes”
Joschka Roffe, Lawrence Z Cohen, Armanda O Quintavalle, Daryus Chandra, and Earl T Campbell · 2023
Closest in time.
“Strictly local union-find” (2023)
Tim Chan and Simon C. Benjamin · 2023
Closest in time.
“Union-find quantum decoding without union-find” (2023)
Sam J. Griffiths and Dan E. Browne · 2023
Closest in time.