Fetching the paper…
Reading the bibliography…
The promise of high-rate low-density parity check (LDPC) codes to substantially reduce the overhead of fault-tolerant quantum computation depends on constructing efficient, fault-tolerant implementations of logical gates on such codes.
“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.
“Multiple-particle interference and quantum error correction”
Andrew Steane · 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.
“Resilient quantum computation”
Emanuel Knill, Raymond Laflamme, and Wojciech Zurek · 1996
Earlier work this paper cites.
“The Magma algebra system I: The user language”
Wieb Bosma, John Cannon, and Catherine Playoust · 1997
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.
“Quantum Reed-Muller codes”
A.M. Steane · 1999
Earlier work this paper cites.
“Methodology for quantum logic gate construction”
Xinlan Zhou, Debbie W. Leung, and Isaac L. Chuang · 2000
Earlier work this paper cites.
“Quantum computation and quantum information”
Michael A Nielsen and Isaac Chuang · 2002
Earlier work this paper cites.
“Fault-tolerant quantum computation by anyons”
A Yu Kitaev · 2003
Earlier work this paper cites.
“Information theory, inference and learning algorithms”
David JC MacKay · 2003
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.
“Bounds on the minimum distance of linear codes” (2008)
Markus Grassl · 2008
Earlier work this paper cites.
“Restrictions on transversal encoded quantum gate sets”
Bryan Eastin and Emanuel Knill · 2009
Earlier work this paper cites.
“Transversality versus universality for additive quantum codes”
Bei Zeng, Andrew Cross, and Isaac L. Chuang · 2011
Earlier work this paper cites.
“Improved quantum hypergraph-product ldpc codes”
Alexey A Kovalev and Leonid P Pryadko · 2012
Earlier work this paper cites.
“Magic-state distillation with low overhead”
Sergey Bravyi and Jeongwan Haah · 2012
Earlier work this paper cites.
“Classification of topologically protected gates for local stabilizer codes”
Sergey Bravyi and Robert König · 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.
“Fault-tolerant quantum computation with constant overhead”
Daniel Gottesman · 2014
Cited alongside, same era.
“Homological product codes”
Sergey Bravyi and Matthew B Hastings · 2014
Cited alongside, same era.
“Quantum LDPC codes with positive rate and minimum distance proportional to the square root of the blocklength”
Jean-Pierre Tillich and Gilles Zémor · 2014
Cited alongside, same era.
“Fault-tolerant conversion between the Steane and Reed-Muller quantum codes”
Jonas T. Anderson, Guillaume Duclos-Cianci, and David Poulin · 2014
Cited alongside, same era.
“Fault-tolerant logical gates in quantum error-correcting codes”
Fernando Pastawski and Beni Yoshida · 2015
“How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits”
Craig Gidney and Martin Ekerå · 2021
Later among the works it cites.
“Quantum low-density parity-check codes”
Nikolas P Breuckmann and Jens Niklas Eberhardt · 2021
Later among the works it cites.
“Fault-tolerant gates on hypergraph product codes”
Anirudh Krishna and David Poulin · 2021
Later among the works it cites.
“Single-shot error correction of three-dimensional homological product codes”
Armanda O Quintavalle, Michael Vasmer, Joschka Roffe, and Earl T Campbell · 2021
Later among the works it cites.
“Four-dimensional toric code with non-Clifford transversal gates”
Tomas Jochym-O’Connor and Theodore J Yoder · 2021
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.
“On tensor products of CSS codes” (2015)
Benjamin Audoux and Alain Couvreur · 2015
Cited alongside, same era.
“Unfolding the color code”
Aleksander Kubica, Beni Yoshida, and Fernando Pastawski · 2015
Cited alongside, same era.
“Universal fault-tolerant gates on concatenated stabilizer codes”
Theodore J Yoder, Ryuji Takagi, and Isaac L Chuang · 2016
Cited alongside, same era.
“Transversal Clifford gates on folded surface codes”
Jonathan E Moussa · 2016
Cited alongside, same era.
“Weight reduction for quantum codes”
Matthew B Hastings · 2016
Cited alongside, same era.
“Disjointness of stabilizer codes and limitations on fault-tolerant logical gates”
Tomas Jochym-O’Connor, Aleksander Kubica, and Theodore J Yoder · 2018
Cited alongside, same era.
MB Hastings · 2021
Later among the works it cites.
“Degenerate quantum LDPC codes with good finite length performance”
Pavel Panteleev and Gleb Kalachev · 2021
Later among the works it cites.
“Fiber bundle codes: breaking the N 1 / 2 polylog ( N ) N^{1/2}\text{polylog}(N) barrier for quantum LDPC codes”
Matthew B Hastings, Jeongwan Haah, and Ryan O’Donnell · 2021
Later among the works it cites.
“Balanced product quantum codes”
Nikolas P Breuckmann and Jens N Eberhardt · 2021
Later among the works it cites.
“Fault-tolerant resource estimate for quantum chemical simulations: Case study on Li-ion battery electrolyte molecules”
Isaac H Kim, Eunseok Lee, Ye-Hua Liu, Sam Pallister, William Pol, and Sam Roberts · 2022
Closest in time.
“Asymptotically good quantum and locally testable classical LDPC codes”
Pavel Panteleev and Gleb Kalachev · 2022
Closest in time.
“Low-overhead fault-tolerant quantum computing using long-range connectivity”
Lawrence Z Cohen, Isaac H Kim, Stephen D Bartlett, and Benjamin J Brown · 2022
Closest in time.
“Universal fault-tolerant quantum computing with stabilizer codes”
Paul Webster, Michael Vasmer, Thomas R Scruby, and Stephen D Bartlett · 2022
Closest in time.
“Decodable quantum LDPC codes beyond the n \sqrt{n} distance barrier using high-dimensional expanders”
Shai Evra, Tali Kaufman, and Gilles Zémor · 2022
Closest in time.
“Reshape: A decoder for hypergraph product codes”
Armanda O Quintavalle and Earl T Campbell · 2022
Closest in time.
“Limitations on transversal gates for hypergraph product codes”
Simon Burton and Dan Browne · 2022
Closest in time.
“Fold-transversal Clifford gates for quantum codes” (2022)
Nikolas P Breuckmann and Simon Burton · 2022
Closest in time.
“Quantum tanner codes”
Anthony Leverrier and Gilles Zémor · 2022
Closest in time.