Fetching the paper…
Reading the bibliography…
We introduce transversal dimension jump, a code-switching protocol for lifted product (LP) quantum low-density parity-check (qLDPC) codes across different chain-complex dimensions, enabling universal fault-tolerant quantum computation with low overhead.
A. Hatcher, Algebraic topology (2005)
2005
Earlier work this paper cites.
B. Eastin and E. Knill, Restrictions on transversal encoded quantum gate sets, Physical review letters 102
2009
Earlier work this paper cites.
D. Gottesman, Fault-Tolerant Quantum Computation with Constant Overhead, Quantum Information and Computation 14
2013
Earlier work this paper cites.
S. Bravyi and R. König, Classification of topologically protected gates for local stabilizer codes, Physical review letters 110
2013
Earlier work this paper cites.
J.-P. Tillich and G. Zemor, Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2} (2013)
2013
Earlier work this paper cites.
J. P. Tillich and G. Zemor, Quantum LDPC codes with positive rate and minimum distance proportional to the square root of the blocklength, IEEE Transactions on Information Theory 60
2014
Earlier work this paper cites.
H. Bombín, Dimensional jump in quantum error correction, New Journal of Physics 18
2016
Earlier work this paper cites.
E. T. Campbell, A theory of single-shot error correction for adversarial noise, Quantum Science and Technology 4
2019
Earlier work this paper cites.
G. V. Kalachev and P. A. Panteleev, On the minimum distance in one class of quantum ldpc codes, Intelligent systems. Theory and applications 24
2020
Earlier work this paper cites.
J. Roffe, D. R. White, S. Burton, and E. Campbell, Decoding across the quantum low-density parity-check code landscape, Physical Review Research 2
2020
Earlier work this paper cites.
C. Gidney, Stim: a fast stabilizer circuit simulator, Quantum 5
2021
Earlier work this paper cites.
P. Panteleev and G. Kalachev, Asymptotically good quantum and locally testable classical ldpc codes, in Proceedings of the 54th annual ACM SIGACT symposium on theory of computing (2022) pp. 375–388
2022
Earlier work this paper cites.
2022
Earlier work this paper cites.
S. Gu, C. A. Pattison, and E. Tang, An efficient decoder for a linear distance quantum LDPC code, Proceedings of the Annual ACM Symposium on Theory of Computing , 919 (2022)
2022
Earlier work this paper cites.
2022
Earlier work this paper cites.
2022
Earlier work this paper cites.
L. Z. Cohen, I. H. Kim, S. D. Bartlett, and B. J. Brown, Low-overhead fault-tolerant quantum computing using long-range connectivity, Science Advances 8
2022
Earlier work this paper cites.
Lifted-product (lp) code, in The Error Correction Zoo , edited by V. V. Albert and P. Faist (2022)
2022
Earlier work this paper cites.
M. A. Tremblay, N. Delfosse, and M. E. Beverland, Constant-Overhead Quantum Error Correction with Thin Planar Connectivity, Physical Review Letters 129
2022
Cited alongside, same era.
2023
Cited alongside, same era.
R. Wang, H.-K. Lin, and L. P. Pryadko, Abelian and non-abelian quantum two-block codes, in 2023 12th International Symposium on Topics in Coding (ISTC) (IEEE, 2023) pp. 1–5
2023
Cited alongside, same era.
Two-block group-algebra (2bga) codes, in The Error Correction Zoo , edited by V. V. Albert and P. Faist (2023)
2023
Cited alongside, same era.
S. Huang, T. Jochym-O’Connor, and T. J. Yoder, Homomorphic logical measurements, PRX Quantum 4
Q. Xu, H. Zhou, G. Zheng, D. Bluvstein, J. P. B. Ataides, M. D. Lukin, and L. Jiang, Fast and parallelizable logical computation with homological product codes, Physical Review X 15
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2023
Cited alongside, same era.
D. Bluvstein, S. J. Evered, A. A. Geim, S. H. Li, H. Zhou, T. Manovitz, S. Ebadi, M. Cain, M. Kalinowski, D. Hangleiter, J. P. B. Ataides, N. Maskara, I. Cong, X. Gao, P. S. Rodriguez, T. Karolyshyn, G. Semeghini, M. J. Gullans, M. Greiner, V. Vuletić, and M. D. Lukin, Logical quantum processor based on reconfigurable atom arrays, Nature 2023 , 1 (2023)
2023
Cited alongside, same era.
S. Bravyi, A. W. Cross, J. M. Gambetta, D. Maslov, P. Rall, and T. J. Yoder, High-threshold and low-overhead fault-tolerant quantum memory, Nature 627
2024
Cited alongside, same era.
Q. Xu, J. P. Bonilla Ataides, C. A. Pattison, N. Raveendran, D. Bluvstein, J. Wurtz, B. Vasić, M. D. Lukin, L. Jiang, and H. Zhou, Constant-overhead fault-tolerant quantum computation with reconfigurable atom arrays, Nature Physics 20
2024
Cited alongside, same era.
2024
Cited alongside, same era.
2024
Cited alongside, same era.
2024
Cited alongside, same era.
H.-K. Lin and L. P. Pryadko, Quantum two-block group algebra codes, Physical Review A 109
2024
Cited alongside, same era.
L. Golowich and V. Guruswami, Asymptotically good quantum codes with transversal non-clifford gates, in Proceedings of the 57th Annual ACM Symposium on Theory of Computing (2025) pp. 707–717
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
L. Daguerre and I. H. Kim, Code switching revisited: Low-overhead magic state preparation using color codes, Physical Review Research 7
2025
Closest in time.
L. Golowich and T.-C. Lin, Quantum ldpc codes with transversal non-clifford gates via products of algebraic codes, in Proceedings of the 57th Annual ACM Symposium on Theory of Computing (2025) pp. 689–696
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
O. Higgott and C. Gidney, Sparse Blossom: correcting a million errors per core second with minimum-weight matching, Quantum 9
2025
Closest in time.