Fetching the paper…
Reading the bibliography…
With the successful demonstration of transversal CNOTs in many recent experiments, it is the right moment to examine its implications on one of the most critical parts of fault-tolerant computation -- magic state preparation.
S. Bravyi and A. Kitaev, Universal quantum computation with ideal Clifford gates and noisy ancillas, Phys. Rev. A 71
2005
Earlier work this paper cites.
K. Patel, I. Markov, and J. Hayes, Optimal synthesis of linear reversible circuits, Quantum Information and Computation 8
2008
Earlier work this paper cites.
S. Bravyi and J. Haah, Magic-state distillation with low overhead, Phys. Rev. A 86
2012
Earlier work this paper cites.
C. Jones, Low-overhead constructions for the fault-tolerant Toffoli gate, Phys. Rev. A 87
2013
Earlier work this paper cites.
P. Selinger, Quantum circuits of $T$-depth one, Phys. Rev. A 87
2013
Earlier work this paper cites.
M. Amy, D. Maslov, and M. Mosca, Polynomial-time t-depth optimization of clifford+t circuits via matroid partitioning, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 33
2014
Earlier work this paper cites.
2014
Earlier work this paper cites.
B. M. Terhal, Quantum error correction for quantum memories, Reviews of Modern Physics 87
2015
Earlier work this paper cites.
E. T. Campbell and M. Howard, Unified framework for magic state distillation and multiqubit gate synthesis with reduced resource cost, Phys. Rev. A 95
2017
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
Earlier work this paper cites.
C. Gidney and A. G. Fowler, Efficient magic state factories with a catalyzed $|CCZ\rangle$ to $2|T\rangle$ transformation, Quantum 3
2019
Cited alongside, same era.
A. G. Fowler and C. Gidney, Low overhead quantum computation using lattice surgery, arXiv (2019)
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.
P. Gokhale, O. Angiuli, Y. Ding, K. Gui, T. Tomesh, M. Suchara, M. Martonosi, and F. T. Chong, Optimization of simultaneous measurement for variational quantum eigensolver applications, in 2020 IEEE international conference on Quantum Computing and Engineering (QCE) (IEEE, 2020) pp. 379–390
2020
Cited alongside, same era.
C. Ryan-Anderson et al. , High-fidelity teleportation of a logical qubit using transversal gates and lattice surgery, Science 385
2024
Later among the works it cites.
R. Acharya et al. , Quantum error correction below the surface code threshold, Nature 10.1038/s41586-024-08449-y (2024)
2024
Later among the works it cites.
2024
Later among the works it cites.
2024
Later among the works it cites.
P. S. Rodriguez et al. , Experimental demonstration of logical magic state distillation, arXiv 10.48550/arXiv.2412.15165 (2024)
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
L. Postler, S. Heußen, I. Pogorelov, M. Rispler, T. Feldker, M. Meth, C. D. Marciniak, R. Stricker, M. Ringbauer, R. Blatt, P. Schindler, M. Müller, and T. Monz, Demonstration of fault-tolerant universal quantum gate operations, Nature 605
2022
Cited alongside, same era.
E. Murphy and A. Kissinger, Global synthesis of cnot circuits with holes, Electronic Proceedings in Theoretical Computer Science 384
2023
Cited alongside, same era.
M. A. Webster, A. O. Quintavalle, and S. D. Bartlett, Transversal diagonal logical operators for stabiliser codes, New Journal of Physics 25
2023
Cited alongside, same era.
Z. Cai, A. Siegel, and S. Benjamin, Looped pipelines enabling effective 3D qubit lattices in a strictly 2D device, PRX Quantum 4
2023
Cited alongside, same era.
D. Bluvstein et al. , Logical quantum processor based on reconfigurable atom arrays, Nature 626
2024
Cited alongside, same era.
D. Litinski, Magic State Distillation: Not as Costly as You Think, Quantum 3
Cited in the paper.
D. Litinski, A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery, Quantum 3
Cited in the paper.
2024
Later among the works it cites.
H. Zhou, C. Zhao, M. Cain, D. Bluvstein, C. Duckering, H.-Y. Hu, S.-T. Wang, A. Kubica, and M. D. Lukin, Algorithmic fault tolerance for fast quantum computing, arXiv 10.48550/arXiv.2406.17653 (2024)
2024
Later among the works it cites.
2024
Later among the works it cites.
2025
Closest in time.
C. Gidney, How to factor 2048 bit RSA integers with less than a million noisy qubits, arXiv 10.48550/arXiv.2505.15917 (2025)
2025
Closest in time.