Fetching the paper…
Reading the bibliography…
Code-switching is a powerful technique in quantum error correction that allows one to leverage the complementary strengths of different codes to achieve fault-tolerant universal quantum computation.
Expander codes
M. Sipser and D.A. Spielman · 1996
Earlier work this paper cites.
Topological quantum memory
Eric Dennis, Alexei Kitaev, Andrew Landahl, and John Preskill · 2002
Earlier work this paper cites.
Both toffoli and controlled-not need little help to do universal quantum computation
Yaoyun Shi · 2002
Earlier work this paper cites.
A simple proof that toffoli and hadamard are quantum universal
Dorit Aharonov · 2003
Earlier work this paper cites.
Fault-tolerant quantum computation by anyons
A.Yu. Kitaev · 2003
Earlier work this paper cites.
Topological quantum distillation
Hector Bombin and Miguel Angel Martin-Delgado · 2006
Earlier work this paper cites.
Expander graphs and their applications
Shlomo Hoory, Nathan Linial, and Avi Wigderson · 2006
Earlier work this paper cites.
Accuracy threshold for postselected quantum computation
Panos Aliferis, Daniel Gottesman, and John Preskill · 2008
Earlier work this paper cites.
Self-correcting quantum computers
Hector Bombin, Ravindra W Chhajlany, M Horodecki, and Miguel-Angel Martin-Delgado · 2009
Earlier work this paper cites.
Quantum measurements and gates by code deformation
Héctor Bombín and Miguel Angel Martin-Delgado · 2009
Earlier work this paper cites.
Restrictions on transversal encoded quantum gate sets
Bryan Eastin and Emanuel Knill · 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.
Clifford gates by code deformation
Hector Bombin · 2011
Earlier work this paper cites.
Fault-tolerant quantum error correction code conversion
Charles D Hill, Austin G Fowler, David S Wang, and Lloyd CL Hollenberg · 2011
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 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.
Classification of topologically protected gates for local stabilizer codes
Sergey Bravyi and Robert König · 2013
Earlier work this paper cites.
Michael H Freedman and Matthew B Hastings · 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 A. Kovalev and Leonid P. Pryadko · 2013
Earlier work this paper cites.
Universal fault-tolerant quantum computation with only transversal gates¡? format?¿ and error correction
Adam Paetznick and Ben W Reichardt · 2013
Earlier work this paper cites.
Fault-tolerant conversion between the steane and reed-muller quantum codes
Jonas T Anderson, Guillaume Duclos-Cianci, and David Poulin · 2014
Earlier work this paper cites.
Homological product codes
Sergey Bravyi and Matthew B Hastings · 2014
Earlier work this paper cites.
Decoding color codes by projection onto surface codes
Nicolas Delfosse · 2014
Earlier work this paper cites.
Using concatenated quantum codes for universal fault-tolerant quantum gates
Tomas Jochym-O’Connor and Raymond Laflamme · 2014
Earlier work this paper cites.
Ramanujan complexes and high dimensional expanders
Alexander Lubotzky · 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 Zemor · 2014
Earlier work this paper cites.
Gauge color codes: optimal transversal gates and gauge fixing in topological stabilizer codes
Héctor Bombín · 2015
Earlier work this paper cites.
Single-shot fault-tolerant quantum error correction
Héctor Bombín · 2015
Earlier work this paper cites.
Universal transversal gates with color codes: A simplified approach
Aleksander Kubica and Michael E Beverland · 2015
Earlier work this paper cites.
Unfolding the color code
Aleksander Kubica, Beni Yoshida, and Fernando Pastawski · 2015
Earlier work this paper cites.
Quantum expander codes
Anthony Leverrier, Jean-Pierre Tillich, and Gilles Zémor · 2015
Earlier work this paper cites.
Dimensional jump in quantum error correction
Héctor Bombín · 2016
Earlier work this paper cites.
Trading classical and quantum computational resources
Sergey Bravyi, Graeme Smith, and John A Smolin · 2016
Earlier work this paper cites.
Transversal clifford gates on folded surface codes
Jonathan E Moussa · 2016
Earlier work this paper cites.
Universal fault-tolerant gates on concatenated stabilizer codes
Theodore J Yoder, Ryuji Takagi, and Isaac L Chuang · 2016
Earlier work this paper cites.
Lecture notes on quantum algorithms
Andrew M Childs · 2017
Cited alongside, same era.
Transversal gates and error propagation in 3d topological codes
Hector Bombin · 2018
Cited alongside, same era.
Efficient decoding of random errors for quantum expander codes
Omar Fawzi, Antoine Grospellier, and Anthony Leverrier · 2018
Cited alongside, same era.
A theory of single-shot error correction for adversarial noise
Earl T Campbell · 2019
Cited alongside, same era.
A game of surface codes: Large-scale quantum computing with lattice surgery
Daniel Litinski · 2019
Cited alongside, same era.
Three-dimensional surface codes: Transversal gates and fault-tolerant architectures
Michael Vasmer and Dan E Browne · 2019
Single-shot decoding of good quantum ldpc codes
Shouzhen Gu, Eugene Tang, Libor Caha, Shin Ho Choe, Zhiyang He, and Aleksander Kubica · 2024
Later among the works it cites.
Single-shot and measurement-based quantum error correction via fault complexes
Timo Hillmann, Guillaume Dauphinais, Ilan Tzitrin, and Michael Vasmer · 2024
Later among the works it cites.
Single-shot preparation of hypergraph product codes via dimension jump
Yifan Hong · 2024
Later among the works it cites.
Transversal non-clifford gates for quantum ldpc codes on sheaves
Ting-Chun Lin · 2024
Later among the works it cites.
Good binary quantum codes with transversal ccz gate
Quynh T Nguyen · 2024
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Higher-dimensional quantum hypergraph-product codes with finite rates
Weilei Zeng and Leonid P Pryadko · 2019
Cited alongside, same era.
Quantum advantage with noisy shallow circuits
Sergey Bravyi, David Gosset, Robert König, and Marco Tomamichel · 2020
Cited alongside, same era.
A fault-tolerant non-clifford gate for the surface code in two dimensions
Benjamin J Brown · 2020
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.
Balanced product quantum codes
Nikolas P Breuckmann and Jens N Eberhardt · 2021
Cited alongside, same era.
Cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
Michael E Beverland, Aleksander Kubica, and Krysta M Svore · 2021
Cited alongside, same era.
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.
Thomas R Scruby, Arthur Pesah, and Mark Webster · 2024
Later among the works it cites.
Shiro Tamiya, Masato Koashi, and Hayata Yamasaki · 2024
Later among the works it cites.
Resilience of the surface code to error bursts
Shi Jie Samuel Tan, Christopher A Pattison, Matt McEwen, and John Preskill · 2024
Later among the works it cites.
Effective distance of higher dimensional hgps and weight-reduced quantum ldpc codes
Shi Jie Samuel Tan and Lev Stambler · 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 constant-space-overhead fault-tolerant quantum computation
Hayata Yamasaki and Masato Koashi · 2024
Later among the works it cites.
Automorphism gadgets in homological product codes
Noah Berthusen, Michael J Gullans, Yifan Hong, Maryam Mudassar, and Shi Jie Samuel Tan · 2025
Closest in time.
Adaptive syndrome extraction
Noah Berthusen, Shi Jie Samuel Tan, Eric Huang, 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.
No-go theorems for logical gates on product quantum codes
Xiaozhen Fu, Han Zheng, Zimu Li, and Zi-Wen Liu · 2025
Closest in time.
Constant-overhead addressable gates via single-shot code switching
Louis Golowich, Kathleen (Katie) Chang, and Guanyu Zhu · 2025
Closest in time.
Quantum ldpc codes with transversal non-clifford gates via products of algebraic codes
Louis Golowich and Ting-Chun Lin · 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.
Quantum memory at nonzero temperature in a thermodynamically trivial system
Yifan Hong, Jinkang Guo, and Andrew Lucas · 2025
Closest in time.
Efficient fault-tolerant code switching via one-way transversal cnot gates
Sascha Heußen and Janine Hilder · 2025
Closest in time.
Composable quantum fault-tolerance
Zhiyang He, Quynh T Nguyen, and Christopher A Pattison · 2025
Closest in time.
Quantum codes with addressable and transversal non-clifford gates
Zhiyang He, Vinod Vaikuntanathan, Adam Wills, and Rachel Yun Zhang · 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.
Single-shot decoding and fault-tolerant gates with trivariate tricycle codes
Abraham Jacob, Campbell McLauchlan, and Dan E Browne · 2025
Closest in time.
Maximally extendable product codes are good coboundary expanders
Gleb Kalachev and Pavel Panteleev · 2025
Closest in time.
Transversal dimension jump for product qldpc codes
Christine Li, John Preskill, and Qian Xu · 2025
Closest in time.
Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codes
Anthony Leverrier and Gilles Zémor · 2025
Closest in time.
Magic tricycles: efficient magic state generation with finite block-length quantum ldpc codes
Varun Menon, J Pablo Bonilla-Ataides, Rohan Mehta, Daniel Bochen Tan, and Mikhail D Lukin · 2025
Closest in time.
Distance-preserving stabilizer measurements in hypergraph product codes
Argyris Giannisis Manes and Jahan Claes · 2025
Closest in time.
Quantum fault tolerance with constant-space and logarithmic-time overheads
Quynh T Nguyen and Christopher A Pattison · 2025
Closest in time.
Batched high-rate logical operations for quantum ldpc codes
Qian Xu, Hengyun Zhou, Dolev Bluvstein, Madelyn Cain, Marcin Kalinowski, John Preskill, Mikhail D. Lukin, and Nishad Maskara · 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.
Guanyu Zhu · 2025
Closest in time.