Inplace Access to the Surface Code Y Basis

Abstract

In this paper, I cut the cost of Y basis measurement and initialization in the surface code by nearly an order of magnitude. Fusing twist defects diagonally across the surface code patch reaches the Y basis in $\lfloor d/2\rfloor +2$ rounds, without leaving the bounding box of the patch and without reducing the code distance. I use Monte Carlo sampling to benchmark the performance of the construction under circuit noise, and to analyze the distribution of logical errors. Cheap inplace Y basis measurement reduces the cost of S gates and magic state factories, and unlocks Pauli measurement tomography of surface code qubits on space-limited hardware.

References in corpus (19)

• Surface codes: Towards practical large-scale quantum computation
• Quantum Teleportation is a Universal Computational Primitive
• How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
• Surface code quantum computing by lattice surgery
• Exponential suppression of bit or phase flip errors with repetitive error correction
• A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
• Stim: a fast stabilizer circuit simulator
• Repeated Quantum Error Detection in a Surface Code
• Realization of an Error-Correcting Surface Code with Superconducting Qubits
• Unfolding the color code
• Efficient magic state factories with a catalyzed |CCZ> to 2|T> transformation
• Poking holes and cutting corners to achieve Clifford gates with the surface code
• Quantum accuracy threshold for concatenated distance-3 codes
• A Fault-Tolerant Honeycomb Memory
• Universal quantum computing with twist-free and temporally encoded lattice surgery
• Low overhead quantum computation using lattice surgery
• A bridge to lower overhead quantum computation
• Transversal Clifford gates on folded surface codes
• A slightly smaller surface code S gate

Cited by in corpus (11)

• Quantum error correction below the surface code threshold
• Error-corrected Hadamard gate simulated at the circuit level
• A SAT Scalpel for Lattice Surgery: Representation and Synthesis of Subroutines for Surface-Code Fault-Tolerant Quantum Computing
• Resource Analysis of Low-Overhead Transversal Architectures for Reconfigurable Atom Arrays
• Characterization of errors in a CNOT between surface code patches
• Locality-aware Pauli-based computation for local magic state preparation
• Magic State Injection with Erasure Qubits
• Lattice surgery-based logical state teleportation via noisy links
• Optimal number of stabilizer measurement rounds in an idling surface code patch
• Managing Classical Processing Requirements for Quantum Error Correction
• Network Requirements for Distributed Quantum Computation