Fetching the paper…
Reading the bibliography…
We nearly triple the number of logical qubits per physical qubit of surface codes in the teraquop regime by concatenating them into high-density parity check codes.
“Algorithms for quantum computation: Discrete logarithms and factoring”
Peter Shor · 1994
Earlier work this paper cites.
“Simple quantum error-correcting codes”
A.. Steane · 1996
Earlier work this paper cites.
“Optimal and efficient decoding of concatenated quantum block codes”
David Poulin · 2006
Earlier work this paper cites.
“A no-go theorem for a two-dimensional self-correcting quantum memory based on stabilizer codes”
Sergey Bravyi and Barbara Terhal · 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.
“Subsystem codes with spatially local generators”
Sergey Bravyi · 2011
Earlier work this paper cites.
“Surface codes: Towards practical large-scale quantum computation” arXiv:1208.0928
A.. Fowler, M. Mariantoni, J.. Martinis and A.. Cleland · 2012
Earlier work this paper cites.
“Surface code quantum computing by lattice surgery”
Clare Horsman, Austin Fowler, Simon Devitt and Rodney Van · 2012
Earlier work this paper cites.
“Optimal complexity correction of correlated errors in the surface code”
Austin Fowler · 2013
Earlier work this paper cites.
“Fault-tolerant quantum computation with constant overhead”
Daniel Gottesman · 2013
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.
“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.
“Efficient Markov chain Monte Carlo algorithm for the surface code”
Adrian Hutter, James. Wootton and Daniel Loss · 2014
Earlier work this paper cites.
“The ZX calculus is a language for surface code lattice surgery”
Niel de Beaudrap and Dominic Horsman · 2017
Earlier work this paper cites.
“Low overhead quantum computation using lattice surgery”
Austin. Fowler and Craig Gidney · 2018
Cited alongside, same era.
“A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery”
Daniel Litinski · 2019
Cited alongside, same era.
“Constant overhead quantum fault tolerance with quantum expander codes”
Omar Fawzi, Antoine Grospellier and Anthony Leverrier · 2020
Cited alongside, same era.
“Improved quantum circuits for elliptic curve discrete logarithms”
Thomas Häner, Samuel Jaques, Michael Naehrig, Martin Roetteler and Mathias Soeken · 2020
Cited alongside, same era.
“A numerical study of bravyi-bacon-shor and subsystem hypergraph product codes”
Muyuan Li and Theodore Yoder · 2020
Cited alongside, same era.
“How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits”
Craig Gidney and Martin Ekerå · 2021
“Constant-Overhead Quantum Error Correction with Thin Planar Connectivity”
Maxime. Tremblay, Nicolas Delfosse and Michael. Beverland · 2022
Later among the works it cites.
“Improved rate-distance trade-offs for quantum codes with restricted connectivity”
Nouédyn Baspin, Venkatesan Guruswami, Anirudh Krishna and Ray Li · 2023
Closest in time.
“Partial Syndrome Measurement for Hypergraph Product Codes”
Noah Berthusen and Daniel Gottesman · 2023
Closest in time.
“Logical blocks for fault-tolerant topological quantum computation”
Hector Bombin, Chris Dawson, Ryan Mishmash, Naomi Nickerson, Fernando Pastawski and Sam Roberts · 2023
Closest in time.
“High-threshold and low-overhead fault-tolerant quantum memory”
Sergey Bravyi, Andrew Cross, Jay Gambetta, Dmitri Maslov, Patrick Rall and Theodore Yoder · 2023
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
“Stim: a fast stabilizer circuit simulator”
Craig Gidney · 2021
Cited alongside, same era.
“Subsystem Codes with High Thresholds by Gauge Fixing and Reduced Qubit Overhead”
Oscar Higgott and Nikolas. Breuckmann · 2021
Cited alongside, same era.
“Degenerate quantum LDPC codes with good finite length performance”
Pavel Panteleev and Gleb Kalachev · 2021
Cited alongside, same era.
“Connectivity constrains quantum codes”
Nouédyn Baspin and Anirudh Krishna · 2022
Cited alongside, same era.
“Quantifying nonlocality: How outperforming local quantum codes is expensive”
Nouédyn Baspin and Anirudh Krishna · 2022
Cited alongside, same era.
“Fault-tolerant Post-Selection for Low Overhead Magic State Preparation”
Héctor Bombín, Mihir Pant, Sam Roberts and Karthik. Seetharam · 2022
Cited alongside, same era.
“Data for “Yoked surface codes””, 2023
Craig Gidney, Michael Newman, Peter Brooks and Cody Jones · 2023
Closest in time.
“Inplace Access to the Surface Code Y Basis”
Craig Gidney · 2023
Closest in time.
“How to compute a 256-bit elliptic curve private key with only 50 million Toffoli gates”
Daniel Litinski · 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.
“Distance-preserving stabilizer measurements in hypergraph product codes”
Argyris Manes and Jahan Claes · 2023
Closest in time.
“Hierarchical memories: Simulating quantum LDPC codes with local gates”
Christopher. Pattison, Anirudh Krishna and John Preskill · 2023
Closest in time.
“Constant-overhead fault-tolerant quantum computation with reconfigurable atom arrays”
Qian Xu, J Ataides, Christopher Pattison, Nithin Raveendran, Dolev Bluvstein, Jonathan Wurtz, Bane Vasic, Mikhail Lukin, Liang Jiang and Hengyun Zhou · 2023
Closest in time.
“Hyperbolic and semi-hyperbolic surface codes for quantum storage”
Nikolas Breuckmann, Christophe Vuillot, Earl Campbell, Anirudh Krishna and Barbara Terhal · 2058
Closest in time.