Fetching the paper…
Reading the bibliography…
Quantum error correction becomes a practical possibility only if the physical error rate is below a threshold value that depends on a particular quantum code, syndrome measurement circuit, and decoding algorithm.
On the inherent intractability of certain coding problems (corresp.)
Elwyn Berlekamp, Robert McEliece, and Henk Van Tilborg · 1978
Earlier work this paper cites.
Scheme for reducing decoherence in quantum computer memory
Peter W. Shor · 1995
Earlier work this paper cites.
Universal quantum simulators
Seth Lloyd · 1996
Earlier work this paper cites.
Multiple-particle interference and quantum error correction
Andrew Steane · 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.
Fault-tolerant quantum computation with constant error
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.
Fault-tolerant quantum computation by anyons
Alexei Kitaev · 1997
Earlier work this paper cites.
Quantum codes on a lattice with boundary
Sergey B. Bravyi and Alexei Yu. Kitaev · 1998
Earlier work this paper cites.
The thickness of graphs: a survey
Petra Mutzel, Thomas Odenthal, and Mark Scharbrodt · 1998
Earlier work this paper cites.
Quantum computation and quantum information, 2002
Michael A. Nielsen and Isaac Chuang · 2002
Earlier work this paper cites.
Topological quantum memory
Eric Dennis, Alexei Kitaev, Andrew Landahl, and John Preskill · 2002
Earlier work this paper cites.
Improved simulation of stabilizer circuits
Scott Aaronson and Daniel Gottesman · 2004
Earlier work this paper cites.
Quantum accuracy threshold for concatenated distance-3 codes
Panos Aliferis, Daniel Gottesman, and John Preskill · 2005
Earlier work this paper cites.
Quantum algorithm for obtaining the energy spectrum of molecular systems
Hefeng Wang, Sabre Kais, Alán Aspuru-Guzik, and Mark R. Hoffmann · 2008
Earlier work this paper cites.
Controlling the spontaneous emission of a superconducting transmon qubit
A. A. Houck, J. A. Schreier, B. R. Johnson, J. M. Chow, Jens Koch, J. M. Gambetta, D. I. Schuster, L. Frunzio, M. H. Devoret, S. M. Girvin, and R. J. Schoelkopf · 2008
Earlier work this paper cites.
High-threshold universal quantum computation on the surface code
Austin G. Fowler, Ashley M. Stephens, and Peter Groszkowski · 2009
Earlier work this paper cites.
High-threshold surface code quantum computing: threshold calculation
Peter Groszkowski, Austin Fowler, and Ashley M. Stephens · 2009
Earlier work this paper cites.
Tradeoffs for reliable quantum information storage in 2D systems
Sergey Bravyi, David Poulin, and Barbara Terhal · 2010
Earlier work this paper cites.
Protecting superconducting qubits from radiation
Antonio D. Córcoles, Jerry M. Chow, Jay M. Gambetta, Chad Rigetti, J. R. Rozen, George A. Keefe, Mary Beth Rothwell, Mark B. Ketchen, and M. Steffen · 2011
Earlier work this paper cites.
Fault-tolerant quantum computing with color codes
Andrew J. Landahl, Jonas T. Anderson, and Patrick R. Rice · 2011
Earlier work this paper cites.
Topological code autotune
Austin G. Fowler, Adam C. Whiteside, Angus L. McInnes, and Alimohammad Rabbani · 2012
Earlier work this paper cites.
Fault-tolerant quantum computation with constant overhead
Daniel Gottesman · 2013
Earlier work this paper cites.
Quantum LDPC codes with positive rate and minimum distance proportional to the square root of the blocklength
Jean-Pierre Tillich and Gilles Zémor · 2013
Earlier work this paper cites.
Quantum kronecker sum-product low-density parity-check codes with finite rate
Alexey A. Kovalev and Leonid P. Pryadko · 2013
Cited alongside, same era.
Simulation of rare events in quantum error correction
Sergey Bravyi and Alexander Vargo · 2013
Cited alongside, same era.
High-contrast qubit interactions using multimode cavity qed
David C. McKay, Ravi Naik, Philip Reinhold, Lev S. Bishop, and David I. Schuster · 2015
Cited alongside, same era.
Demonstration of weight-four parity measurements in the surface code architecture
Maika Takita, Antonio D. Córcoles, Easwar Magesan, Baleegh Abdo, Markus Brink, Andrew Cross, Jerry M. Chow, and Jay M. Gambetta · 2016
Cited alongside, same era.
Constructions and noise threshold of hyperbolic surface codes
Nikolas P. Breuckmann and Barbara M. Terhal · 2016
Cited alongside, same era.
Universal gate for fixed-frequency qubits via a tunable bus
Realization of an error-correcting surface code with superconducting qubits
Youwei Zhao, Yangsen Ye, He-Liang Huang, Yiming Zhang, Dachao Wu, Huijie Guan, Qingling Zhu, Zuolin Wei, Tan He, Sirui Cao, et al · 2022
Later among the works it cites.
Constant-overhead quantum error correction with thin planar connectivity
Maxime A. Tremblay, Nicolas Delfosse, and Michael E. Beverland · 2022
Later among the works it cites.
Asymptotically good quantum and locally testable classical LDPC codes
Pavel Panteleev and Gleb Kalachev · 2022
Later among the works it cites.
Quantum Tanner codes
Anthony Leverrier and Gilles Zémor · 2022
Later among the works it cites.
Quantifying nonlocality: How outperforming local quantum codes is expensive
Nouédyn Baspin and Anirudh Krishna · 2022
Later among the works it cites.
Low-overhead fault-tolerant quantum computing using long-range connectivity
Lawrence Z. Cohen, Isaac H. Kim, Stephen D. Bartlett, and Benjamin J. Brown · 2022
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
David C. McKay, Stefan Filipp, Antonio Mezzacapo, Easwar Magesan, Jerry M. Chow, and Jay M. Gambetta · 2016
Cited alongside, same era.
Elucidating reaction mechanisms on quantum computers
Markus Reiher, Nathan Wiebe, Krysta M. Svore, Dave Wecker, and Matthias Troyer · 2017
Cited alongside, same era.
Building logical qubits in a superconducting quantum computing system
Jay M. Gambetta, Jerry M. Chow, and Matthias Steffen · 2017
Cited alongside, same era.
Noise analysis for high-fidelity quantum entangling gates in an anharmonic linear Paul trap
Yukai Wu, Sheng-Tao Wang, and L.-M. Duan · 2018
Cited alongside, same era.
Quantum supremacy using a programmable superconducting processor
F. Arute, K. Arya, R. Babbush, and et al · 2019
Cited alongside, same era.
Impact of ionizing radiation on superconducting qubit coherence
Antti P. Vepsäläinen, Amir H. Karamlou, John L. Orrell, Akshunna S. Dogra, Ben Loer, Francisca Vasconcelos, David K. Kim, Alexander J. Melville, Bethany M. Niedzielski, Jonilyn L. Yoder, et al · 2020
Cited alongside, same era.
Decoding across the quantum low-density parity-check code landscape
Joschka Roffe, David R. White, Simon Burton, and Earl Campbell · 2020
Cited alongside, same era.
Later among the works it cites.
The future of quantum computing with superconducting qubits
Sergey Bravyi, Oliver Dial, Jay M. Gambetta, Darío Gil, and Zaira Nazario · 2022
Later among the works it cites.
LDPC: Python tools for low density parity check codes, 2022
Joschka Roffe · 2022
Later among the works it cites.
Fold-transversal Clifford gates for quantum codes
Nikolas P. Breuckmann and Simon Burton · 2022
Later among the works it cites.
Experimental benchmarking of an automated deterministic error suppression workflow for quantum algorithms, 2023
Pranav S. Mundada, Aaron Barbosa, Smarak Maity, Yulun Wang, T. M. Stace, Thomas Merkh, Felicity Nielson, Andre R. R. Carvalho, Michael Hush, Michael J. Biercuk, and Yuval Baum · 2023
Closest in time.
Two-level-system dynamics in a superconducting qubit due to background ionizing radiation
Ted Thorbeck, Andrew Eddins, Isaac Lauer, Douglas T. McClure, and Malcolm Carroll · 2023
Closest in time.
Raman scattering errors in stimulated-raman-induced logic gates in ba+ 133
Matthew J. Boguslawski, Zachary J. Wall, Samuel R. Vizvary, Isam Daniel Moore, Michael Bareian, David T.C. Allcock, David J. Wineland, Eric R. Hudson, and Wesley C. Campbell · 2023
Closest in time.
Suppressing quantum errors by scaling a surface code logical qubit
Google Quantum AI · 2023
Closest in time.
Constructions and performance of hyperbolic and semi-hyperbolic floquet codes
Oscar Higgott and Nikolas P. Breuckmann · 2023
Closest in time.
Quantum two-block group algebra codes
Hsiang-Ku Lin and Leonid P. Pryadko · 2023
Closest in time.
Abelian and non-Abelian quantum two-block codes
Renyu Wang, Hsiang-Ku Lin, and Leonid P. Pryadko · 2023
Closest in time.
Spacetime codes of clifford circuits
Nicolas Delfosse and Adam Paetznick · 2023
Closest in time.
Relaxing hardware requirements for surface code circuits using time-dynamics
Matt McEwen, Dave Bacon, and Craig Gidney · 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.
Tangling schedules eases hardware connectivity requirements for quantum error correction
Gyorgy P. Geher, Ophelia Crawford, and Earl T. Campbell · 2023
Closest in time.
Sparse blossom: correcting a million errors per core second with minimum-weight matching
Oscar Higgott and Craig Gidney · 2023
Closest in time.
Hierarchical memories: Simulating quantum LDPC codes with local gates
Christopher A. Pattison, Anirudh Krishna, and John Preskill · 2023
Closest in time.
Private communication, 2023
Alexander Ivrii · 2023
Closest in time.