pith. machine review for the scientific record. sign in

arxiv: 1705.01686 · v1 · submitted 2017-05-04 · 🪐 quant-ph

Recognition: unknown

Universal fault-tolerant quantum computation with Bacon-Shor codes

Authors on Pith no claims yet
classification 🪐 quant-ph
keywords bacon-shorcodesfault-tolerantuniversalcodegategatestransversal
0
0 comments X
read the original 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\times 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\times3$ Bacon-Shor code and also compare our gates with magic-states within the framework of a proposed ion trap architecture.

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. Stabilizer Code-Generic Universal Fault-Tolerant Quantum Computation

    quant-ph 2026-01 unverdicted novelty 6.0

    Ancilla-mediated protocols enable deterministic universal logical gates on any stabilizer code without ancilla consumption or code modification.