pith. machine review for the scientific record. sign in

arxiv: 0706.1382 · v3 · submitted 2007-06-11 · 🪐 quant-ph

Recognition: unknown

Transversality versus Universality for Additive Quantum Codes

Authors on Pith no claims yet
classification 🪐 quant-ph
keywords codesquantumoperationsuniversaladditivetransversalcomputationfault-tolerant
0
0 comments X
read the original abstract

Certain quantum codes allow logic operations to be performed on the encoded data, such that a multitude of errors introduced by faulty gates can be corrected. An important class of such operations are {\em transversal}, acting bitwise between corresponding qubits in each code block, thus allowing error propagation to be carefully limited. If any quantum operation could be implemented using a set of such gates, the set would be {\em universal}; codes with such a universal, transversal gate set have been widely desired for efficient fault-tolerant quantum computation. We study the structure of GF(4)-additive quantum codes and prove that no universal set of transversal logic operations exists for these codes. This result strongly supports the idea that additional primitive operations, based for example on quantum teleportation, are necessary to achieve universal fault-tolerant computation on additive codes.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Homological origin of transversal implementability of logical diagonal gates in quantum CSS codes

    quant-ph 2026-02 unverdicted novelty 6.0

    A homological framework identifies necessary and sufficient obstruction conditions for transversal logical diagonal gates in quantum CSS codes.