Error-corrected Hadamard gate simulated at the circuit level

Abstract

We simulate the logical Hadamard gate in the surface code under a circuit-level noise model, compiling it to a physical circuit on square-grid connectivity hardware. Our paper is the first to do this for a logical unitary gate on a quantum error-correction code. We consider two proposals, both via patch-deformation: one that applies a transversal Hadamard gate (i.e. a domain wall through time) to interchange the logical $X$ and $Z$ strings, and another that applies a domain wall through space to achieve this interchange. We explain in detail why they perform the logical Hadamard gate by tracking how the stabilisers and the logical operators are transformed in each quantum error-correction round. We optimise the physical circuits and evaluate their logical failure probabilities, which we find to be comparable to those of a quantum memory experiment for the same number of quantum error-correction rounds. We present syndrome-extraction circuits that maintain the same effective distance under circuit-level noise as under phenomenological noise. We also explain how a $SWAP$-quantum error-correction round (required to return the patch to its initial position) can be compiled to only four two-qubit gate layers. This can be applied to more general scenarios and, as a byproduct, explains from first principles how the "stepping" circuits of the recent Google paper [McEwen, Bacon, and Gidney, Quantum 7, 1172 (2023)] can be constructed.

26 pages, 18 figures Slight updates based on referee comments, and fixed typo in Figure 11

References in corpus (27)

• Surface codes: Towards practical large-scale quantum computation
• Topological quantum memory
• Quantum Error Correction for Quantum Memories
• How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
• Topological fault-tolerance in cluster state quantum computation
• Roads towards fault-tolerant universal quantum computation
• Surface code quantum computing by lattice surgery
• A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
• Stim: a fast stabilizer circuit simulator
• Topological Order with a Twist: Ising Anyons from an Abelian Model
• Quantum Error Correction: An Introductory Guide
• Trading classical and quantum computational resources
• Low-distance Surface Codes under Realistic Quantum Noise
• Magic State Distillation: Not as Costly as You Think
• Topological and subsystem codes on low-degree graphs with flag qubits
• Poking holes and cutting corners to achieve Clifford gates with the surface code
• Universal quantum computing with twist-free and temporally encoded lattice surgery
• Lattice Surgery with a Twist: Simplifying Clifford Gates of Surface Codes
• Improved decoding of circuit noise and fragile boundaries of tailored surface codes
• Relaxing Hardware Requirements for Surface Code Circuits using Time-dynamics
• The boundaries and twist defects of the color code and their applications to topological quantum computation
• Logical blocks for fault-tolerant topological quantum computation
• Benchmarking the Planar Honeycomb Code
• A circuit-level protocol and analysis for twist-based lattice surgery
• Inplace Access to the Surface Code Y Basis
• Tangling schedules eases hardware connectivity requirements for quantum error correction
• Compilation of a simple chemistry application to quantum error correction primitives

Cited by in corpus (8)

• Local Clustering Decoder as a fast and adaptive hardware decoder for the surface code
• Unlocking early fault-tolerant quantum computing with mitigated magic dilution
• Characterization of errors in a CNOT between surface code patches
• Erasure conversion for singlet-triplet spin qubits enables high-performance shuttling-based quantum error correction
• Lattice surgery-based logical state teleportation via noisy links
• Transversal CNOT gate with multi-cycle error correction
• Leakage Mobility in Superconducting Qubits as a Leakage Reduction Unit
• Network Requirements for Distributed Quantum Computation