Fault-Tolerant Logical Clifford Gates from Code Automorphisms

J. Leon, Computing automorphism groups of error-correcting codes, IEEE Transactions on Information Theory 28

1982

Earlier work this paper cites.

A. Calderbank, E. Rains, P. Shor, and N. Sloane, Quantum error correction via codes over GF(4), in Proceedings of IEEE International Symposium on Information Theory (1997) pp. 292–, https://ieeexplore.ieee.org/document/613213

1997

Earlier work this paper cites.

W. Bosma, J. Cannon, and C. Playoust, The Magma Algebra System I: The User Language, Journal of Symbolic Computation 24

1997

Earlier work this paper cites.

D. Gottesman, Stabilizer Codes and Quantum Error Correction (1997), arXiv:quant-ph/9705052

1997

Earlier work this paper cites.

D. Gottesman, Theory of fault-tolerant quantum computation, Phys. Rev. A 57

1998

Earlier work this paper cites.

N. Sendrier and G. Skersys, On the computation of the automorphism group of a linear code, in Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) (2001) pp. 13–

2001

Earlier work this paper cites.

D. Kielpinski, C. Monroe, and D. J. Wineland, Architecture for a large-scale ion-trap quantum computer, Nature 417

2002

Earlier work this paper cites.

S. Aaronson and D. Gottesman, Improved Simulation of Stabilizer Circuits, Physical Review A 70

2004

Earlier work this paper cites.

M. Grassl, Bounds on the minimum distance of linear codes and quantum codes, Online available at http://www.codetables.de (2007)

2007

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.

M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information: 10th Anniversary Edition (2010), iSBN: 9780511976667 Publisher: Cambridge University Press

2010

Cited alongside, same era.

T. Junttila and P. Kaski, Conflict propagation and component recursion for canonical labeling, in Theory and Practice of Algorithms in (Computer) Systems , edited by A. Marchetti-Spaccamela and M. Segal (Springer Berlin Heidelberg, Berlin, Heidelberg, 2011) pp. 151–162

2011

Cited alongside, same era.

B. Zeng, A. Cross, and I. L. Chuang, Transversality versus universality for additive quantum codes, IEEE Transactions on Information Theory 57

2011

Cited alongside, same era.

M. Grassl and M. Roetteler, Leveraging automorphisms of quantum codes for fault-tolerant quantum computation, in 2013 IEEE International Symposium on Information Theory (2013) pp. 534–538, iSSN: 2157-8117

2013

Cited alongside, same era.

S. J. Evered, D. Bluvstein, M. Kalinowski, S. Ebadi, T. Manovitz, H. Zhou, S. H. Li, A. A. Geim, T. T. Wang, N. Maskara, H. Levine, G. Semeghini, M. Greiner, V. Vuletić, and M. D. Lukin, High-fidelity parallel entangling gates on a neutral-atom quantum computer, Nature 622

2023

Later among the works it cites.

N. P. Breuckmann and S. Burton, Fold-transversal clifford gates for quantum codes, Quantum 8

2024

Closest in time.

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

Closest in time.

D. Schoenberger, S. Hillmich, M. Brandl, and R. Wille, Shuttling for scalable trapped-ion quantum computers, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems , 1 (2024)

2024

Closest in time.