Universal fault-tolerant quantum computation with Bacon-Shor codes
Theodore J. Yoder

TL;DR
This paper introduces a fault-tolerant universal gate set for Bacon-Shor codes, enabling efficient implementation of complex quantum gates with reduced overhead, advancing practical quantum computing.
Contribution
It presents a novel fault-tolerant universal gate set on Bacon-Shor codes, including transversal non-Clifford gates and techniques to lower overhead for fault-tolerance.
Findings
Calculated pseudothresholds for the 3x3 Bacon-Shor code
Compared gate performance with magic-states in ion trap architecture
Demonstrated reduction in overhead for fault-tolerant CCZ
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 lattice have transversal -qubit-controlled . 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 Bacon-Shor code and also compare our gates with magic-states within the framework of a proposed ion trap architecture.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications
