Related Experiment Video
Updated: Jul 12, 2026

Generation and Coherent Control of Pulsed Quantum Frequency Combs
Published on: June 8, 2018
Clifford Hierarchy Stabilizer Codes: Transversal Non-Clifford Gates and Magic States
Ryohei Kobayashi1, Guanyu Zhu2,3, Po-Shen Hsin4
1Institute for Advanced Study, School of Natural Sciences, Princeton, New Jersey 08540, USA.
Researchers developed new quantum error correction codes that overcome limitations in dimensionality and universality. These advanced Clifford hierarchy stabilizer codes enable transversal non-Clifford gates, improving fault-tolerant quantum computation.
Area of Science:
- Quantum Information Science
- Condensed Matter Physics
- High Energy Physics
Background:
- A key challenge in fault-tolerant quantum computation is balancing code universality with dimensionality.
- The Bravyi-König bound highlights this tradeoff for n-dimensional topological stabilizer codes.
Purpose of the Study:
- To extend topological Pauli stabilizer codes to higher levels of the Clifford hierarchy in n-dimensional space.
- To construct transversal non-Clifford gates for enhanced quantum error correction.
Main Methods:
- Generalization of topological stabilizer codes to n-dimensional Clifford hierarchy stabilizer codes.
- Utilizing automorphism symmetries of twisted gauge theories (e.g., Z_{2}^{3}, Z_{2}^{4}) to realize transversal gates.
- Employing code switching with just-in-time decoders for magic state preparation.
Main Results:
- First demonstration of transversal non-Clifford logical gates (t, cnot) for Clifford stabilizer codes in 2D.
- Construction of a transversal logical sqrt[T] gate in a 3D non-Clifford stabilizer code.
- Achieved logical gates at the (n+1)th Clifford hierarchy level in n spatial dimensions, surpassing the Bravyi-König bound.
Conclusions:
- The developed Clifford hierarchy stabilizer codes offer a pathway to overcome the universality-dimensionality tradeoff in quantum computation.
- These findings pave the way for more robust and efficient fault-tolerant quantum computers.
Related Concept Videos
Routh-Hurwitz Criterion I
To apply the Routh-Hurwitz criterion, a Routh table is constructed. The table's rows are labeled with powers of the complex frequency variable s, starting from the...
Stability of structures
Woodward–Hoffmann Selection Rules and Microscopic Reversibility
Routh-Hurwitz Criterion II
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first column of the Routh...
Underflow Gates
Signal Flow Graphs
In a signal-flow graph, branches denote the system's transfer functions, while nodes represent the signals. The direction of signal flow is indicated by arrows, with the corresponding...