Fetching the paper…
Reading the bibliography…
Magic states are essential yet resource-intensive components for realizing universal fault-tolerant quantum computation.
S. Aaronson and D. Gottesman, Improved simulation of stabilizer circuits, Phys. Rev. A 70
2004
Earlier work this paper cites.
S. Bravyi and A. Kitaev, Universal quantum computation with ideal Clifford gates and noisy ancillas, Physical Review A 71
2005
Earlier work this paper cites.
N. Khaneja, T. Reiss, C. Kehlet, T. Schulte-Herbrüggen, and S. J. Glaser, Optimal control of coupled spin dynamics: design of NMR pulse sequences by gradient ascent algorithms, Journal of Magnetic Resonance 172
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.
A. G. Fowler, M. Mariantoni, J. M. Martinis, and A. N. Cleland, Surface codes: Towards practical large-scale quantum computation, Physical Review A 86
2012
Earlier work this paper cites.
D. Horsman, A. G. Fowler, S. Devitt, and R. V. Meter, Surface code quantum computing by lattice surgery, New J. Phys. 14
2012
Earlier work this paper cites.
S. Bravyi and J. Haah, Magic-state distillation with low overhead, Physical Review A 86
2012
Earlier work this paper cites.
T. R. Jochym-O’Connor, A study of the robustness of magic state distillation against Clifford gate faults , Master’s thesis , University of Waterloo (2012)
2012
Earlier work this paper cites.
D. Gottesman, Fault-tolerant quantum computation with constant overhead, Quantum Information and Computation 14
2014
Earlier work this paper cites.
Y. Li, A magic state’s fidelity can be superior to the operations that created it, New Journal of Physics 17
2014
Earlier work this paper cites.
A. A. Emran and M. Elsabrouty, Simplified variable-scaled min sum LDPC decoder for irregular LDPC codes, in 2014 IEEE 11th Consumer Communications and Networking Conference (CCNC) (IEEE, 2014) pp. 518–523
2014
Earlier work this paper cites.
E. T. Campbell, B. M. Terhal, and C. Vuillot, Roads towards fault-tolerant universal quantum computation, Nature 549
2017
Earlier work this paper cites.
J. O’Gorman and E. T. Campbell, Quantum computation with realistic magic-state factories, Physical Review A 95
2017
Earlier work this paper cites.
E. Chitambar and G. Gour, Quantum resource theories, Reviews of Modern Physics (2018)
2018
Earlier work this paper cites.
R. Babbush, C. Gidney, D. W. Berry, N. Wiebe, J. McClean, A. Paler, A. Fowler, and H. Neven, Encoding electronic spectra in quantum circuits with linear T complexity, Physical Review X 8
2018
Earlier work this paper cites.
D. Litinski, A game of surface codes: Large-scale quantum computing with lattice surgery, Quantum 3
2019
Earlier work this paper cites.
C. Vuillot, L. Lao, B. Criger, C. García Almudéver, K. Bertels, and B. M. Terhal, Code deformation and lattice surgery are gauge fixing, New Journal of Physics 21
2019
Cited alongside, same era.
A. Krishna and J.-P. Tillich, Towards low overhead magic state distillation, Physical Review Letters 123
2019
Cited alongside, same era.
C. Chamberland and K. Noh, Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits, npj Quantum Information 6
2020
Cited alongside, same era.
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
Cited alongside, same era.
N. P. Breuckmann and J. N. Eberhardt, Quantum low-density parity-check codes, PRX Quantum 2
2021
Cited alongside, same era.
2024
Later among the works it cites.
2024
Later among the works it cites.
2024
Later among the works it cites.
2024
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
C. Gidney, Stim: a fast stabilizer circuit simulator, Quantum 5
2021
Cited alongside, same era.
P. Panteleev and G. Kalachev, Degenerate quantum LDPC codes with good finite length performance, Quantum 5
2021
Cited alongside, same era.
C. Chamberland and E. T. Campbell, Universal quantum computing with twist-free and temporally encoded lattice surgery, PRX Quantum 3
2022
Cited alongside, same era.
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
Cited alongside, same era.
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 , STOC ’22 (ACM, 2022)
2022
Cited alongside, same era.
A. Leverrier and G. Zemor, Quantum tanner codes, in 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) (IEEE, 2022) pp. 872–883
2022
Cited alongside, same era.
J. Roffe, LDPC: Python tools for low density parity check codes (2022)
2022
Cited alongside, same era.
2024
Later among the works it cites.
2024
Later among the works it cites.
2024
Later among the works it cites.
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
Later among the works it cites.
2024
Later among the works it cites.
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
G. Zhang and Y. Li, Time-efficient logical operations on quantum low-density parity check codes, Physical Review Letters 134
2025
Closest in time.
2025
Closest in time.
2025
Closest in time.
G. Zhang and Y. Zhu, Fast-constant-overhead-random-access-magic-state-injection-on-qldpc-codes (2025)
2025
Closest in time.