Fetching the paper…
Reading the bibliography…
Preparing high-fidelity logical magic states is crucial for fault-tolerant quantum computation.
1905
Earlier work this paper cites.
S. B. Bravyi and A. Y. Kitaev, Quantum codes on a lattice with boundary (1998)
1998
Earlier work this paper cites.
D. Gottesman and I. L. Chuang, Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations, Nature 402
1999
Earlier work this paper cites.
X. Zhou, D. W. Leung, and I. L. Chuang, Methodology for quantum logic gate construction, Physical Review A 62
2000
Earlier work this paper cites.
E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, Topological quantum memory, Journal of Mathematical Physics 43
2002
Earlier work this paper cites.
A. Kitaev, Fault-tolerant quantum computation by anyons, Annals of Physics 303
2003
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.
E. Knill, Quantum computing with realistically noisy devices, Nature 434
2005
Earlier work this paper cites.
2012
Earlier work this paper cites.
A. G. Fowler and S. J. Devitt, A bridge to lower overhead quantum computation (2012)
2012
Earlier work this paper cites.
H. Bombin, G. Duclos-Cianci, and D. Poulin, Universal topological phase of two-dimensional stabilizer codes, New Journal of Physics 14
2012
Earlier work this paper cites.
2013
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
2015
Earlier work this paper cites.
A. Kubica, B. Yoshida, and F. Pastawski, Unfolding the color code, New Journal of Physics 17
2015
Earlier work this paper cites.
J. E. Moussa, Transversal Clifford gates on folded surface codes (2016), arXiv:1603.02286
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
B. J. Brown, K. Laubscher, M. S. Kesselring, and J. R. Wootton, Poking Holes and Cutting Corners to Achieve Clifford Gates with the Surface Code, Physical Review X 7
2017
Cited alongside, same era.
2019
Cited alongside, same era.
2019
Cited alongside, same era.
M. Vasmer and D. E. Browne, Three-dimensional surface codes: Transversal gates and fault-tolerant architectures, Phys. Rev. A 100
2019
Cited alongside, same era.
S. Bravyi, D. Browne, P. Calpin, E. Campbell, D. Gosset, and M. Howard, Simulation of quantum circuits by low-rank stabilizer decompositions, Quantum 3
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…
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.
C. Gidney, Stim: a fast stabilizer circuit simulator, Quantum 5
2021
Cited alongside, same era.
D. Bluvstein, H. Levine, G. Semeghini, T. T. Wang, S. Ebadi, M. Kalinowski, A. Keesling, N. Maskara, H. Pichler, M. Greiner, V. Vuletić, and M. D. Lukin, A quantum processor based on coherent transport of entangled atom arrays, Nature 604
2022
Cited alongside, same era.
A. Kissinger, J. van de Wetering, and R. Vilmart, Classical Simulation of Quantum Circuits with Partial and Graphical Stabiliser Decompositions, LIPIcs, Volume 232, TQC 2022 232
2022
Cited alongside, same era.
2023
Cited alongside, same era.
Quantinuum and Collaborators, A Race-Track Trapped-Ion Quantum Processor, Physical Review X 13
2023
Cited alongside, same era.
M. McEwen, D. Bacon, and C. Gidney, Relaxing Hardware Requirements for Surface Code Circuits using Time-dynamics, Quantum 7
2023
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.
R. Kobayashi and G. Zhu, Cross-Cap Defects and Fault-Tolerant Logical Gates in the Surface Code and the Honeycomb Floquet Code, PRX Quantum 5
2024
Later among the works it cites.
2024
Later among the works it cites.
H. Goto, High-performance fault-tolerant quantum computing with many-hypercube codes, Science Advances 10
2024
Later among the works it cites.
Google Quantum AI and Collaborators, Quantum error correction below the surface code threshold, Nature 638
2025
Closest in time.
2025
Closest in time.
C. Gidney, Sinter: fast QEC sampling, https://pypi.org/project/sinter/ , accessed: 2025-03-13
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.
Z. Chen, Cultiv-T-RP2, https://github.com/Zihan-Chen-PhMA/Cultiv_T_RP2 , accessed: 2025-03-21
2025
Closest in time.