Fetching the paper…
Reading the bibliography…
Proving threshold theorems for fault-tolerant quantum computation is a burdensome endeavor with many moving parts that come together in relatively formulaic but lengthy ways.
“Good quantum error-correcting codes exist”
A Calderbank and Peter Shor · 1996
Earlier work this paper cites.
“Threshold accuracy for quantum computation”
Emanuel Knill, Raymond Laflamme and Wojciech Zurek · 1996
Earlier work this paper cites.
“Fault-tolerant quantum computation”
P.W. Shor · 1996
Earlier work this paper cites.
“Multiple-particle interference and quantum error correction”
Andrew Steane · 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”
A Kitaev · 1997
Earlier work this paper cites.
“Quantum codes on a lattice with boundary”
Sergey Bravyi and A Kitaev · 1998
Earlier work this paper cites.
“Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations”
Daniel Gottesman and Isaac Chuang · 1999
Earlier work this paper cites.
“Projective plane and planar quantum codes”
Michael Freedman and David Meyer · 2001
Earlier work this paper cites.
“Topological quantum memory”
Eric Dennis, Alexei Kitaev, Andrew Landahl and John Preskill · 2002
Earlier work this paper cites.
“Classical and quantum computation”
Alexei Kitaev, Alexander Shen and Mikhail Vyalyi · 2002
Earlier work this paper cites.
“Fault-tolerant quantum computation by anyons”
A Kitaev · 2003
Earlier work this paper cites.
“Combinatorial optimization: polyhedra and efficiency”
Alexander Schrijver · 2003
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.
“Universal quantum computation with ideal Clifford gates and noisy ancillas”
Sergey Bravyi and Alexei Kitaev · 2005
Earlier work this paper cites.
“Topological Quantum Distillation”
H. Bombin and M.. Martin-Delgado · 2006
Earlier work this paper cites.
“Accuracy threshold for postselected quantum computation”
Panos Aliferis, Daniel Gottesman and John Preskill · 2007
Earlier work this paper cites.
“Quantum measurements and gates by code deformation”
H\’ector Bomb\’n and Miguel Martin-Delgado · 2009
Earlier work this paper cites.
“Magic-state distillation with low overhead”
Sergey Bravyi and Jeongwan Haah · 2012
Earlier work this paper cites.
“Surface codes: Towards practical large-scale quantum computation”
Austin. Fowler, Matteo Mariantoni, John. Martinis and Andrew. Cleland · 2012
Earlier work this paper cites.
“Surface code quantum computing by lattice surgery”
Dominic Horsman, Austin Fowler, Simon Devitt and Rodney Meter · 2012
Earlier work this paper cites.
“Quantum Computation and Quantum Information: 10th Anniversary Edition”
Michael. Nielsen and Isaac. Chuang · 2012
Earlier work this paper cites.
“Fault tolerance of quantum low-density parity check codes with sublinear distance scaling”
Alexey Kovalev and Leonid Pryadko · 2013
Earlier work this paper cites.
“Universal Fault-Tolerant Quantum Computation with Only Transversal Gates and Error Correction”
Adam Paetznick and Ben. Reichardt · 2013
Earlier work this paper cites.
“Fault-tolerant quantum computation with constant overhead”
Daniel Gottesman · 2014
Earlier work this paper cites.
“Gauge color codes: optimal transversal gates and gauge fixing in topological stabilizer codes”
H\’ector Bomb\’n · 2015
Earlier work this paper cites.
“Universal transversal gates with color codes: A simplified approach”
Aleksander Kubica and Michael Beverland · 2015
Earlier work this paper cites.
“Unfolding the color code”
Aleksander Kubica, Beni Yoshida and Fernando Pastawski · 2015
Cited alongside, same era.
“A magic state’s fidelity can be superior to the operations that created it”
Ying Li · 2015
Cited alongside, same era.
“Simple scheme for encoding and decoding a qubit in unknown state for various topological codes”
Justyna odyga, Pawe Mazurek, Andrzej Grudka and Micha Horodecki · 2015
Cited alongside, same era.
“Dimensional jump in quantum error correction”
H\’ector Bomb\’n · 2016
Cited alongside, same era.
“Trading Classical and Quantum Computational Resources”
S. Bravyi, G. Smith and J.. Smolin · 2016
Cited alongside, same era.
“Transversal Clifford gates on folded surface codes”
Jonathan. Moussa · 2016
Cited alongside, same era.
“Parallel window decoding enables scalable fault tolerant quantum computation”
Luka Skoric, Dan Browne, Kenton Barnes, Neil Gillespie and Earl Campbell · 2023
Later among the works it cites.
“Quantum computing is scalable on a planar array of qubits with fabrication defects”
Armands Strikis, Simon Benjamin and Benjamin Brown · 2023
Later among the works it cites.
“Scalable surface-code decoders with parallelization in time”
Xinyu Tan, Fang Zhang, Rui Chao, Yaoyun Shi and Jianxin Chen · 2023
Later among the works it cites.
“Fold-Transversal Clifford Gates for Quantum Codes”
Nikolas. Breuckmann and Simon Burton · 2024
Later among the works it cites.
“Lifting Topological Codes: Three-Dimensional Subsystem Codes from Two-Dimensional Anyon Models”
Jacob. Bridgeman, Aleksander Kubica and Michael Vasmer · 2024
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“Weight reduction for quantum codes”
Mathew. Hastings · 2017
Cited alongside, same era.
“Correcting coherent errors with surface codes”
Sergey Bravyi, Matthias Englbrecht, Robert K\"onig and Nolan Peard · 2018
Cited alongside, same era.
“Low overhead quantum computation using lattice surgery”
Austin. Fowler and Craig Gidney · 2018
Cited alongside, same era.
“Distillation with sublogarithmic overhead”
Matthew Hastings and Jeongwan Haah · 2018
Cited alongside, same era.
“A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery”
D. Litinski · 2019
Cited alongside, same era.
“Code deformation and lattice surgery are gauge fixing”
Christophe Vuillot, Lingling Lao, Ben Criger, Carmen Garcíaéver, Koen Bertels and Barbara Terhal · 2019
Cited alongside, same era.
Matthias Christandl, Omar Fawzi and Ashutosh Goswami · 2024
Later among the works it cites.
“SSIP: automated surgery with quantum LDPC codes”
A. Cowtan · 2024
Later among the works it cites.
“Improved QLDPC Surgery: Logical Measurements and Bridging Codes”
Andrew Cross, Zhiyang He, Patrick Rall and Theodore Yoder · 2024
Later among the works it cites.
“Quantum computation from dynamic automorphism codes”
Margarita Davydova, Nathanan Tantivasadakarn, Shankar Balasubramanian and David Aasen · 2024
Later among the works it cites.
“Single-shot decoding of good quantum LDPC codes”
Shouzhen Gu, Eugene Tang, Libor Caha, Shin Choe, Zhiyang He and Aleksander Kubica · 2024
Later among the works it cites.
“Fault-tolerant logical measurements via homological measurement”
Benjamin Ide, Manoj Gowda, Priya Nadkarni and Guillaume Dauphinais · 2024
Later among the works it cites.
“Quantum fault tolerance with constant-space and logarithmic-time overheads”
Quynh Nguyen and Christopher Pattison · 2024
Later among the works it cites.
“Universal adapters between quantum LDPC codes”
Esha Swaroop, Tomas Jochym-O’Connor and Theodore Yoder · 2024
Later among the works it cites.
Shiro Tamiya, Masato Koashi and Hayata Yamasaki · 2024
Later among the works it cites.
“Low-overhead fault-tolerant quantum computation by gauging logical operators”
Dominic Williamson and Theodore Yoder · 2024
Later among the works it cites.
“Constant-overhead magic state distillation”
Adam Wills, Min-Hsiu Hsieh and Hayata Yamasaki · 2024
Later among the works it cites.
“Time-efficient logical operations on quantum LDPC codes”
Guo Zhang and Ying Li · 2024
Later among the works it cites.
“Algorithmic fault tolerance for fast quantum computing”
Hengyun Zhou, Chen Zhao, Madelyn Cain, Dolev Bluvstein, Casey Duckering, Hong-Ye Hu, Sheng-Tao Wang, Aleksander Kubica and Mikhail Lukin · 2024
Later among the works it cites.
“Fast correlated decoding of transversal logical algorithms”
Madelyn Cain, Dolev Bluvstein, Chen Zhao, Shouzhen Gu, Nishad Maskara, Marcin Kalinowski, Alexandra Geim, Aleksander Kubica, Mikhail Lukin and Hengyun Zhou · 2025
Closest in time.
“Parallel Logical Measurements via Quantum Code Surgery”
Alexander Cowtan, Zhiyang He, Dominic. Williamson and Theodore. Yoder · 2025
Closest in time.
“A constant rate quantum computer on a line”
Craig Gidney and Thiago Bergamaschi · 2025
Closest in time.
“Asymptotically good quantum codes with transversal non-clifford gates”
Louis Golowich and Venkatesan Guruswami · 2025
Closest in time.
“Extractors: QLDPC Architectures for Efficient Pauli-Based Computation”
Zhiyang He, Alexander Cowtan, Dominic Williamson and Theodore Yoder · 2025
Closest in time.
“Good binary quantum codes with transversal CCZ gate”
Quynh Nguyen · 2025
Closest in time.
“Decoding across transversal Clifford gates in the surface code”
Marc Serra-Peralta, Mackenzie Shaw and Barbara Terhal · 2025
Closest in time.
Yugo Takada and Hayata Yamasaki · 2025
Closest in time.
“Tour de gross: A modular quantum computer based on bivariate bicycle codes”
Theodore Yoder, Eddie Schoute, Patrick Rall, Emily Pritchett, Jay Gambetta, Andrew Cross, Malcolm Carroll and Michael Beverland · 2025
Closest in time.