[Paper Review] Universal fault-tolerant quantum computation with Bacon-Shor codes

Theodore J. Yoder|arXiv (Cornell University)|May 4, 2017

Quantum Computing Algorithms and Architecture28 references19 citations

TL;DR

This paper presents a fault-tolerant universal gate set for Bacon-Shor subsystem codes using transversal Hadamard and controlled-controlled-Z (CCZ) gates, leveraging code asymmetry to enable higher-level Clifford hierarchy gates. It achieves universal fault-tolerant quantum computation on the $3\times3$ Bacon-Shor code with no intermediate error correction, yielding a pseudothreshold of $\sim 8\times10^{-5}$ under circuit depolarizing noise.

ABSTRACT

We present a fault-tolerant universal gate set consisting of Hadamard and controlled-controlled-Z (CCZ) on Bacon-Shor subsystem codes. Transversal non-Clifford gates on these codes are intriguing in that higher levels of the Clifford hierarchy become accessible as the code becomes more asymmetric. For instance, in an appropriate gauge, Bacon-Shor codes on an $m imes m^k$ lattice have transversal $k$-qubit-controlled $Z$. Through a variety of tricks, including intermediate error-correction and non-Pauli recovery, we reduce the overhead required for fault-tolerant CCZ. We calculate pseudothresholds for our universal gate set on the smallest $3 imes3$ Bacon-Shor code and also compare our gates with magic-states within the framework of a proposed ion trap architecture.

Motivation & Objective

• To develop a practical, low-overhead universal fault-tolerant gate set for small-distance Bacon-Shor codes, avoiding reliance on magic-state distillation.
• To address the resource inefficiency of magic-state-based non-Clifford gate implementations in the low-distance regime.
• To enable transversal implementation of non-Clifford gates like CCZ by exploiting code asymmetry in Bacon-Shor codes.
• To reduce fault-tolerant circuit overhead through pieceable fault-tolerance and non-Pauli recovery operations.
• To provide a resource-optimized alternative to magic-state distillation for experimental fault-tolerant quantum computing, particularly in ion trap architectures.

Proposed method

• Utilizes the $m\times m^k$ lattice structure of Bacon-Shor codes to make the $k$-qubit-controlled-Z gate transversal, enabling access to higher levels of the Clifford hierarchy.
• Employs pieceable fault-tolerance by inserting intermediate stabilizer measurements to break circuits into fault-tolerant segments, reducing error propagation.
• Applies non-Pauli recovery operations—allowed by Knill-Laflamme conditions but outside standard stabilizer formalism—to reduce error-correction overhead.
• Tracks errors as complex-weighted Pauli sums through unitary evolution and stabilizer measurements, enabling exact error propagation analysis.
• Uses the Gottesman-Knill theorem for Clifford circuits and exact Pauli sum decomposition for non-Clifford components like CCZ to compute logical error rates.
• Computes pseudothresholds via Monte Carlo simulation of exRECs (effective rounds of error correction) under circuit depolarizing noise models.

Experimental results

Research questions

• RQ1 Can transversal non-Clifford gates be realized in Bacon-Shor codes through code asymmetry, enabling universal fault-tolerant quantum computation?
• RQ2 What is the minimal overhead required to implement fault-tolerant CCZ gates on small Bacon-Shor codes without magic-state distillation?
• RQ3 How does non-Pauli recovery reduce error-correction overhead in fault-tolerant circuits compared to standard Pauli-based recovery?
• RQ4 What are the pseudothresholds for universal gate sets on the $3\times3$ Bacon-Shor code under realistic circuit noise models?
• RQ5 How does the proposed scheme compare in resource cost and speed to magic-state-based implementations in ion trap architectures?

Key findings

• The $3\times3$ Bacon-Shor code supports a universal fault-tolerant gate set using only transversal Hadamard and CCZ gates with no intermediate error correction.
• The pseudothreshold for the CCZ gate on the $3\times3$ code is approximately $8\times10^{-5}$ under circuit depolarizing noise, indicating high fault-tolerance performance.
• The scheme avoids magic-state distillation and postselection, making it suitable for low-distance, near-term experimental implementations.
• Non-Pauli recovery and optimized circuit design reduce the number of required intermediate error-correction cycles, lowering resource overhead.
• In the ion trap MUSICQ architecture, the proposed CCZ implementation is estimated to be roughly four times faster than magic-state-based alternatives.
• The method achieves fault tolerance through pieceable fault-tolerance and exact error tracking via Pauli sum decomposition, enabling accurate pseudothreshold estimation.