Subsystem stabilizer codes cannot have a universal set of transversal gates for even one encoded qudit

Abstract

A long-standing open problem in fault-tolerant quantum computation has been to find a universal set of transversal gates. As three of us proved in arXiv: 0706.1382, such a set does not exist for binary stabilizer codes. Here we generalize our work to show that for subsystem stabilizer codes in $d$ dimensional Hilbert space, such a universal set of transversal gates cannot exist for even one encoded qudit, for any dimension $d$, prime or nonprime. This result strongly supports the idea that other primitives, such as quantum teleportation, are necessary for universal fault-tolerant quantum computation, and may be an important factor for fault tolerance noise thresholds.

16 pages, 3 figures

References in corpus (4)

• Semi-Clifford operations, structure of ${\mathcal{C}}_k$ hierarchy, and gate complexity for fault-tolerant quantum computation
• Local unitary versus local Clifford equivalence of stabilizer and graph states
• Classification of nonproduct states with maximum stabilizer dimension
• Maximum stabilizer dimension for nonproduct states

Cited by in corpus (31)

• Roads towards fault-tolerant universal quantum computation
• Restrictions on Transversal Encoded Quantum Gate Sets
• Negative Quasi-Probability as a Resource for Quantum Computation
• Contextuality in Measurement-based Quantum Computation
• Universal fault-tolerant quantum computation with only transversal gates and error correction
• Entanglement monogamy of multipartite higher-dimensional quantum systems using convex-roof extended negativity
• Enhanced fault-tolerant quantum computing in $d$-level systems
• Quantum secret sharing with qudit graph states
• Magic state distillation in all prime dimensions using quantum Reed-Muller codes
• Continuous symmetries and approximate quantum error correction
• Hardware for Dynamic Quantum Computing
• Universal fault-tolerant gates on concatenated stabilizer codes
• Experimental magic state distillation for fault-tolerant quantum computing
• General polygamy inequality of multi-party quantum entanglement
• Gauge color codes in two dimensions
• Scrambling and decoding the charged quantum information
• The connected wedge theorem and its consequences
• A comparative study of universal quantum computing models: towards a physical unification
• Quasi-exact quantum computation
• Error rates and resource overheads of encoded three-qubit gates
• Symmetries and entanglement of stabilizer states
• A prototype of quantum von Neumann architecture
• Theory of quasi-exact fault-tolerant quantum computing and valence-bond-solid codes
• Fault-tolerant conversion between adjacent Reed-Muller quantum codes based on gauge fixing
• Blind Quantum Computation Using a Circuit-Based Quantum Computer
• Distribution and dynamics of entanglement in high-dimensional quantum systems using convex-roof extended negativity
• Resource optimization for fault-tolerant quantum computing
• State-adaptive quantum error correction and fault-tolerant quantum computing
• The Study of Entangled States in Quantum Computation and Quantum Information Science
• Qudit Clauser-Horne-Shimony-Holt Inequality and Nonlocality from Wigner Negativity
• Automorphisms of stabilizer codes