Subsystem stabilizer codes cannot have a universal set of transversal gates for even one encoded qudit
read the original 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.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Fortuity and Complexity in a Simple Quark Model
In a toy qubit model of quarks, BRST cohomology designates baryons as fortuitous and mesons as monotone, with the former displaying super-exponential complexity and the latter power-law complexity in the Veneziano limit.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.