Transversality Versus Universality for Additive Quantum Codes

  title={Transversality Versus Universality for Additive Quantum Codes},
  author={Bei Zeng and Andrew W. Cross and Isaac L. Chuang},
  journal={IEEE Transactions on Information Theory},
Logic gates can be performed on data encoded in quantum code blocks such that errors introduced by faulty gates can be corrected. The important class of transversal gates acts bitwise between corresponding qubits of code blocks and thus limits error propagation. If any quantum gate could be implemented using transversal gates, the set would be universal. We study the structure of GF(4)-additive quantum codes and prove that no universal set of transversal logic gates exists for these codes. This… 

Tables from this paper

Restrictions on transversal encoded quantum gate sets.
It is shown that the ability of a quantum code to detect an arbitrary error on any single physical subsystem is incompatible with the existence of a universal, transversal encoded gate set for the code.
Universal Fault-Tolerant Gates on Concatenated Stabilizer Codes
It is shown how the limits of non-transversality can be overcome by performing rounds of intermediate error-correction to create logical gates on stabilizer codes that use no ancillas other than those required for syndrome measurement.
Partitioning qubits in hypergraph product codes to implement logical gates
It is demonstrated that transversal gates can be used as the basis for universal quantum computing on LDPC codes, when supplemented with state injection.
Leveraging automorphisms of quantum codes for fault-tolerant quantum computation
It is shown how the automorphism group of a quantum code can be used to implement some operators on the encoded quantum states in a fault-tolerant way by merely permuting the physical qubits.
Universal Logical Gates on Topologically Encoded Qubits via Constant-Depth Unitary Circuits.
It is demonstrated that non-Abelian anyons in Turaev-Viro quantum error correcting codes can be moved over a distance of order of the code distance, and thus braided, by a constant depth local unitary quantum circuit followed by a permutation of qubits.
Clifford Synthesis for Stabilizer Codes
A mathematical framework for synthesizing physical circuits that implement logical Clifford operators for stabilizer codes, and it is proved that for an [[m, k]] stabilizer code every logical Clifford operator has 2 symplectic solutions, up to stabilizer degeneracy.
Limitations on transversal computation through quantum homomorphic encryption
This work builds on almost any QECC, and implements that code's transversal gate set homomorphically, implying that any ITS quantum homomorphic scheme (ITS-QFHE) implementing the full set of classical reversible functions must be highly inefficient.
Dual-code quantum computation model
This work proposes the dual-code quantum computation model—a fault-tolerant quantum computation scheme which alternates between two different quantum error-correction codes which can implement a universal set of gates transversally, thereby reducing the overall cost.
Continuous groups of transversal gates for quantum error correcting codes from finite clock reference frames
There is a direct relationship between how small this error can be and how accurate quantum clocks can be: the more accurate the clock, the smaller the error; and the no-go theorem would be violated if time could be measured perfectly in quantum mechanics.
The disjointness of stabilizer codes and limitations on fault-tolerant logical gates
The disjointness is introduced, which, roughly speaking, is the number of mostly non-overlapping representatives of any given non-trivial logical Pauli operator, and is used to prove that transversal gates on error-detecting stabilizer codes are necessarily in a finite level of the Clifford hierarchy.


Both Toffoli and controlled-NOT need little help to do universal quantum computing
It is proved that Controlled-NOT plus any single-qubit real gate that does not preserve the computational basis and is not Hadamard (or its alike) are universal for quantum computing.
Quantum Universality from Magic States Distillation Applied to CSS Codes
A sharp threshold is shown in the Hadamard “magic” direction of the Bloch sphere between those ρ allowing universal quantum computation, and those for which any calculation can be efficiently classically simulated.
Improved magic states distillation for quantum universality
Given stabilizer operations and the ability to repeatedly prepare a single-qubit mixed state ρ , can we do universal quantum computation? As motivation for this question, “magic state” distillation
Quantum error correction via codes over GF(4)
In the present paper the problem of finding quantum-error-correcting codes is transformed into one of finding additive codes over the field GF(4) which are self-orthogonal with respect to a certain trace inner product.
Stabilizer Codes and Quantum Error Correction
An overview of the field of quantum error correction and the formalism of stabilizer codes is given and a number of known codes are discussed, the capacity of a quantum channel, bounds on quantum codes, and fault-tolerant quantum computation are discussed.
Methodology for quantum logic gate construction
We present a general method to construct fault-tolerant quantum logic gates with a simple primitive, which is an analog of quantum teleportation. The technique extends previous results based on
Theory of fault-tolerant quantum computation
It is demonstrated that fault-tolerant universal computation is possible for any stabilizer code, including the five-quantum-bit code.
A Practical Architecture for Reliable Quantum Computers
A proposed architecture is described that uses code teleportation, quantum memory refresh units, dynamic compilation of quantum programs, and scalable error correction to achieve system-level efficiencies and indicates the underlying technology's reliability is crucial.
Reliable quantum computers
  • J. Preskill
  • Physics
    Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
  • 1998
The new field of quantum error correction has developed spectacularly since its origin less than two years ago. Encoded quantum information can be protected from errors that arise due to uncontrolled
Subsystem fault tolerance with the Bacon-Shor code.
A lower bound on the quantum accuracy threshold, 1.94 x 10(-4) for adversarial stochastic noise, is proved, that improves previous lower bounds by nearly an order of magnitude.