Fetching the paper…
Reading the bibliography…
In this paper, we introduce the gauge-fixed QLDPC surgery scheme, an improved logical measurement scheme based on the construction of Cohen et al.
The generation of Sp(F2) by transvections
David Callan · 1976
Earlier work this paper cites.
Fault-tolerant quantum computation with constant error
D. Aharonov and M. Ben-Or · 1997
Earlier work this paper cites.
Stabilizer Codes and Quantum Error Correction
D. Gottesman · 1997
Earlier work this paper cites.
Quantum Error Correction with Imperfect Gates
A. Yu. Kitaev · 1997
Earlier work this paper cites.
Quantum codes on a lattice with boundary
S. B. Bravyi and A. Yu. Kitaev · 1998
Earlier work this paper cites.
Resilient Quantum Computation
Emanuel Knill, Raymond Laflamme, and Wojciech H. Zurek · 1998
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.
Topological quantum memory
Eric Dennis, Alexei Kitaev, Andrew Landahl, and John Preskill · 2002
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.
Scalable quantum computing in the presence of large detected-error rates
E. Knill · 2005
Earlier work this paper cites.
Fault-tolerant logical gate networks for Calderbank-Shor-Steane codes
Andrew M. Steane and Ben Ibinson · 2005
Earlier work this paper cites.
Quantum accuracy threshold for concatenated distance-3 codes
Panos Aliferis, Daniel Gottesman, and John Preskill · 2006
Earlier work this paper cites.
Effective Fault-Tolerant Quantum Computation with Slow Measurements
D. P. DiVincenzo and P. Aliferis · 2007
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.
An Introduction to Quantum Error Correction and Fault-Tolerant Quantum Computation
D. Gottesman · 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.
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.
Surface code quantum computing by lattice surgery
Dominic Horsman, Austin G Fowler, Simon Devitt, and Rodney Van Meter · 2012
Earlier work this paper cites.
Fault-Tolerant Quantum Computation with Constant Overhead
Daniel Gottesman · 2014
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 · 2014
Earlier work this paper cites.
A magic state’s fidelity can be superior to the operations that created it
Ying Li · 2015
Earlier work this paper cites.
Trading Classical and Quantum Computational Resources
S. Bravyi, G. Smith, and J. A. Smolin · 2016
Earlier work this paper cites.
Hyperbolic and semi-hyperbolic surface codes for quantum storage
Nikolas P Breuckmann, Christophe Vuillot, Earl Campbell, Anirudh Krishna, and Barbara M Terhal · 2017
Earlier work this paper cites.
Roads towards fault-tolerant universal quantum computation
Earl T. Campbell, Barbara M. Terhal, and Christophe Vuillot · 2017
Earlier work this paper cites.
Fault-tolerant interface between quantum memories and quantum processors
Hendrik Poulsen Nautrup, Nicolai Friis, and Hans J. Briegel · 2017
Earlier work this paper cites.
Constant Overhead Quantum Fault-Tolerance with Quantum Expander Codes
Omar Fawzi, Antoine Grospellier, and Anthony Leverrier · 2018
Cited alongside, same era.
Low overhead Clifford gates from joint measurements in surface, color, and hyperbolic codes
Ali Lavasani and Maissam Barkeshli · 2018
Cited alongside, same era.
Fault-tolerant gates via homological product codes
Tomas Jochym-O’Connor · 2019
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 Almudéver, Koen Bertels, and Barbara M Terhal · 2019
Cited alongside, same era.
Decoding across the quantum low-density parity-check code landscape
J. Roffe, D. R. White, S. Burton, and E. Campbell · 2020
Matching Generalized-Bicycle Codes to Neutral Atoms for Low-Overhead Fault-Tolerance
J. Viszlai, W. Yang, S. F. Lin, J. Liu, N. Nottingham, J. M. Baker, and F. T. Chong · 2023
Later among the works it cites.
G. Zhu, S. Sikander, E. Portnoy, A. W. Cross, and B. J. Brown · 2023
Later among the works it cites.
Fold-Transversal Clifford Gates for Quantum Codes
Nikolas P. Breuckmann and Simon Burton · 2024
Closest in time.
High-threshold and low-overhead fault-tolerant quantum memory
S. Bravyi, A. W. Cross, J. M. Gambetta, D. Maslov, P. Rall, and T. J. Yoder · 2024
Closest in time.
Fault tolerance of stabilizer channels
M. E. Beverland, S. Huang, and V. Kliuchnikov · 2024
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Balanced Product Quantum Codes
Nikolas P. Breuckmann and Jens N. Eberhardt · 2021
Cited alongside, same era.
Quantum Low-Density Parity-Check Codes
Nikolas P. Breuckmann and Jens Niklas Eberhardt · 2021
Cited alongside, same era.
Building manifolds from quantum codes
Michael Freedman and Matthew Hastings · 2021
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
Cited alongside, same era.
Stim: a fast stabilizer circuit simulator
C. Gidney · 2021
Cited alongside, same era.
M. B. Hastings · 2021
Cited alongside, same era.
Closest in time.
SSIP: automated surgery with quantum LDPC codes
A. Cowtan · 2024
Closest in time.
Toward Low-latency Iterative Decoding of QLDPC Codes Under Circuit-Level Noise
A. Gong, S. Cammerer, and J. M. Renes · 2024
Closest in time.
Constructions and performance of hyperbolic and semi-hyperbolic floquet codes
Oscar Higgott and Nikolas P Breuckmann · 2024
Closest in time.
Weight-Reduced Stabilizer Codes with Lower Overhead
Eric Sabo, Lane G. Gunderman, Benjamin Ide, Michael Vasmer, and Guillaume Dauphinais · 2024
Closest in time.
High-threshold, low-overhead and single-shot decodable fault-tolerant quantum memory
T. R. Scruby, T. Hillmann, and J. Roffe · 2024
Closest in time.
Universal adapters between quantum LDPC codes
Esha Swaroop, Tomas Jochym-O’Connor, and Theodore J Yoder · 2024
Closest in time.
Ambiguity Clustering: an accurate and efficient decoder for qLDPC codes
S. Wolanski and B. Barber · 2024
Closest in time.
Low-overhead fault-tolerant quantum computation by gauging logical operators
Dominic J Williamson and Theodore J Yoder · 2024
Closest in time.
Constant-overhead fault-tolerant quantum computation with reconfigurable atom arrays
Qian Xu, J. Pablo Bonilla Ataides, Christopher A. Pattison, Nithin Raveendran, Dolev Bluvstein, Jonathan Wurtz, Bane Vasić, Mikhail D. Lukin, Liang Jiang, and Hengyun Zhou · 2024
Closest in time.
Toward a 2D local implementation of quantum low-density parity-check codes
Noah Berthusen, Dhruv Devulapalli, Eddie Schoute, Andrew M. Childs, Michael J. Gullans, Alexey V. Gorshkov, and Daniel Gottesman · 2025
Closest in time.
Parallel Logical Measurements via Quantum Code Surgery
Alexander Cowtan, Zhiyang He, Dominic J. Williamson, and Theodore J. Yoder · 2025
Closest in time.
Extractors: QLDPC Architectures for Efficient Pauli-Based Computation
Zhiyang He, Alexander Cowtan, Dominic J Williamson, and Theodore J Yoder · 2025
Closest in time.
Sparse Blossom: correcting a million errors per core second with minimum-weight matching
Oscar Higgott and Craig Gidney · 2025
Closest in time.
Fault-tolerant logical measurements via homological measurement
Benjamin Ide, Manoj G. Gowda, Priya J. Nadkarni, and Guillaume Dauphinais · 2025
Closest in time.
Architecture for fast implementation of quantum low-density parity-check codes with optimized rydberg gates
C. Poole, T. M. Graham, M. A. Perlin, M. Otten, and M. Saffman · 2025
Closest in time.
Multivariate bicycle codes
Lukas Voss, Sim Jian Xian, Tobias Haug, and Kishor Bharti · 2025
Closest in time.
Fast and parallelizable logical computation with homological product codes
Qian Xu, Hengyun Zhou, Guo Zheng, Dolev Bluvstein, J. Pablo Bonilla Ataides, Mikhail D. Lukin, and Liang Jiang · 2025
Closest in time.
Tour de gross: A modular quantum computer based on bivariate bicycle codes
Theodore J Yoder, Eddie Schoute, Patrick Rall, Emily Pritchett, Jay M Gambetta, Andrew W Cross, Malcolm Carroll, and Michael E Beverland · 2025
Closest in time.
Time-Efficient Logical Operations on Quantum Low-Density Parity Check Codes
Guo Zhang and Ying Li · 2025
Closest in time.