Fetching the paper…
Reading the bibliography…
Quantum code surgery is a flexible and low overhead technique for performing logical measurements on quantum error-correcting codes, which generalises lattice surgery.
An Introduction to Homological Algebra
C. A. Weibel · 1994
Earlier work this paper cites.
Stabilizer codes and quantum error correction
Daniel Gottesman · 1997
Earlier work this paper cites.
Categories for the Working Mathematician
S. MacLane · 1997
Earlier work this paper cites.
Topological quantum memory
E. Dennis, A. Kitaev, A. Landahl, and J. Preskill · 2002
Earlier work this paper cites.
The intractability of computing the minimum distance of a code
Alexander Vardy · 2002
Earlier work this paper cites.
Fault-tolerant quantum computation by anyons
A. Kitaev · 2003
Earlier work this paper cites.
Hardness of approximating the minimum distance of a linear code
I. Dumer, D. Micciancio, and M. Sudan · 2003
Earlier work this paper cites.
String and membrane condensation on three-dimensional lattices
A. Hamma, P. Zanardi, and X. G. Wen · 2005
Earlier work this paper cites.
Quantum computing with realistically noisy devices
E. Knill · 2005
Earlier work this paper cites.
Restrictions on Transversal Encoded Quantum Gate Sets
B. Eastin and E. Knill · 2009
Earlier work this paper cites.
A no-go theorem for a two-dimensional self-correcting quantum memory based on stabilizer codes
S. Bravyi and B. Terhal · 2009
Earlier work this paper cites.
Surface code quantum computing by lattice surgery
D. Horsman, A. G. Fowler, S. Devitt, and R. Van Meter · 2012
Earlier work this paper cites.
Leveraging automorphisms of quantum codes for fault-tolerant quantum computation
Markus Grassl and Martin Roetteler · 2013
Earlier work this paper cites.
Quantum LDPC Codes With Positive Rate and Minimum Distance Proportional to the Square Root of the Blocklength
J. P. Tillich and G. Zémor · 2013
Earlier work this paper cites.
Fault-tolerant quantum computation with constant overhead
Daniel Gottesman · 2013
Earlier work this paper cites.
Transversal Clifford gates on folded surface codes
J. Moussa · 2016
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.
Weight reduction for quantum codes
M. B Hastings · 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.
A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
D. Litinski · 2019
Earlier work this paper cites.
Code deformation and lattice surgery are gauge fixing
C. Vuillot, L. Lao, B. Criger, C. G. Almudéver, K. Bertels, and B. M. Terhal · 2019
Earlier work this paper cites.
SZX-Calculus: Scalable Graphical Quantum Reasoning, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
T. Carette, D. Horsman, and S. Perdrix · 2019
Earlier work this paper cites.
On tensor products of CSS Codes
B. Audoux and A. Couvreur · 2019
Earlier work this paper cites.
Quantum Low-Density Parity-Check Codes
N. P. Breuckmann and J. N. Eberhardt · 2021
Earlier work this paper cites.
M. B Hastings · 2021
Earlier work this paper cites.
Building manifolds from quantum codes
M. Freedman and M. Hastings · 2021
Cited alongside, same era.
Low-overhead fault-tolerant quantum computing using long-range connectivity
L. Z. Cohen, I. H. Kim, S. D. Bartlett, and B. J. Brown · 2022
Cited alongside, same era.
Universal Quantum Computing with Twist-Free and Temporally Encoded Lattice Surgery
C. Chamberland and E. T. Campbell · 2022
Cited alongside, same era.
Asymptotically good Quantum and locally testable classical LDPC codes
P. Panteleev and G. Kalachev · 2022
Cited alongside, same era.
Fault-tolerant resource estimate for quantum chemical simulations: Case study on Li-ion battery electrolyte molecules
I. H. Kim, Y. Liu, S. Pallister, W. Pol, S. Roberts, and E. Lee · 2022
Cited alongside, same era.
Suppressing quantum errors by scaling a surface code logical qubit
Improved QLDPC Surgery: Logical Measurements and Bridging Codes
A. Cross, Z. He, P. Rall, and T. J. Yoder · 2024
Later among the works it cites.
Low-overhead fault-tolerant quantum computation by gauging logical operators
Dominic J Williamson and Theodore J Yoder · 2024
Later among the works it cites.
Universal adapters between quantum LDPC codes
Esha Swaroop, Tomas Jochym-O’Connor, and Theodore J Yoder · 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 Locally Testable Code with Constant Soundness
A. Cross, Z. He, A. Natarajan, M. Szegedy, and G. Zhu · 2024
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Google Quantum AI · 2023
Cited alongside, same era.
Partitioning qubits in hypergraph product codes to implement logical gates
A. Quintavalle, P. Webster, and M. Vasmer · 2023
Cited alongside, same era.
Guanyu Zhu, Shehryar Sikander, Elia Portnoy, Andrew W Cross, and Benjamin J Brown · 2023
Cited alongside, same era.
Homomorphic Logical Measurements
S. Huang, T. Jochym-O’Connor, and T. J. Yoder · 2023
Cited alongside, same era.
Quantum error correction below the surface code threshold
Google Quantum AI and Collaborators · 2024
Cited alongside, same era.
Logical quantum processor based on reconfigurable atom arrays
D. Bluvstein, S. J. Evered, A. A. Geim, S. H. Li, H. Zhou, T. Manovitz, et al · 2024
Cited alongside, same era.
Experimental demonstration of logical magic state distillation
P. S. Rodriguez, J. M. Robinson, P. N. Jepsen, Z. He, C. Duckering, C. Zhao, K. Wu, J. Campo, K. Bagnall, M. Kwon, et al · 2024
Cited alongside, same era.
Later among the works it cites.
Scaling and logic in the color code on a superconducting quantum processor
N. Lacroix, A. Bourassa, F. J. H. Heras, L. M. Zhang, et al · 2025
Closest in time.
Logical Operators and Fold-Transversal Gates of Bivariate Bicycle Codes
J. N. Eberhardt and V. Steffan · 2025
Closest in time.
Guanyu Zhu · 2025
Closest in time.
Fast and Parallelizable Logical Computation with Homological Product Codes
Q. Xu, H. Zhou, G. Zheng, D. Bluvstein, J. P. B. Ataides, M. D. Lukin, and L. Jiang · 2025
Closest in time.
Quantum Codes with Addressable and Transversal Non-Clifford Gates
Z. He, V. Vaikuntanathan, A. Wills, and R. Y. Zhang · 2025
Closest in time.
Fault-Tolerant Logical Measurements via Homological Measurement
B. Ide, M. G. Gowda, P. J. Nadkarni, and G. Dauphinais · 2025
Closest in time.
Time-Efficient Logical Operations on Quantum Low-Density Parity Check Codes
Guo Zhang and Ying Li · 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.
Extractors: QLDPC Architectures for Efficient Pauli-Based Computation
Z. He, A. Cowtan, D. J. Williamson, and T. J. Yoder · 2025
Closest in time.
Tour de gross: A modular quantum computer based on bivariate bicycle codes
T. J. Yoder, E. Schoute, P. Rall, E. Pritchett, J. M. Gambetta, A. W. Cross, M. Carroll, and M. E. Beverland · 2025
Closest in time.
Stabilizer Entanglement Distillation and Efficient Fault-Tolerant Encoders
Yu Shi, Ashlesha Patil, and Saikat Guha · 2025
Closest in time.
Geometrically Enhanced Topological Quantum Codes
David Aasen, Jeongwan Haah, Matthew B Hastings, and Zhenghan Wang · 2025
Closest in time.
Simplified quantum weight reduction with optimal bounds
Min-Hsiu Hsieh, Xingjian Li, and Ting-Chun Lin · 2025
Closest in time.
High-rate surgery: towards constant-overhead logical operations
Guo Zheng, Liang Jiang, and Qian Xu · 2025
Closest in time.
Fast surgery for quantum ldpc codes, 2025
Nouédyn Baspin, Lucas Berent, and Lawrence Z. Cohen · 2025
Closest in time.
Fast and fault-tolerant logical measurements: Auxiliary hypergraphs and transversal surgery
Alexander Cowtan, Zhiyang He, Dominic J. Williamson, and Theodore J. Yoder · 2025
Closest in time.
Homology, hopf algebras and quantum code surgery
Alexander Cowtan · 2025
Closest in time.
Fault-tolerant transformations of spacetime codes, 2025
Arthur Pesah, Austin K. Daniel, Ilan Tzitrin, and Michael Vasmer · 2025
Closest in time.
Composable quantum fault-tolerance
Zhiyang He, Quynh T. Nguyen, and Christopher A. Pattison · 2025
Closest in time.