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.
- “Relaxing hardware requirements for surface code circuits using time-dynamics”. Quantum 7, 1172 (2023).
- Daniel Gottesman. “Stabilizer codes and quantum error correction” (1997) arXiv:quant-ph/9705052.
- Barbara M. Terhal. “Quantum error correction for quantum memories”. Reviews of Modern Physics 87, 307 (2015).
- “Roads towards fault-tolerant universal quantum computation”. Nature 549, 172–179 (2017).
- Joschka Roffe. “Quantum error correction: an introductory guide”. Contemporary Physics 60, 226–245 (2019).
- Craig Gidney. “Stim: a fast stabilizer circuit simulator”. Quantum 5, 497 (2021).
- “Topological fault-tolerance in cluster state quantum computation”. New Journal of Physics 9, 199 (2007).
- “Surface codes: Towards practical large-scale quantum computation”. Physical Review A 86, 032324 (2012).
- Yu Tomita and Krysta M. Svore. “Low-distance surface codes under realistic quantum noise”. Physical Review A 90, 062320 (2014).
- “Topological and subsystem codes on low-degree graphs with flag qubits”. Physical Review X 10, 011022 (2020).
- “Improved decoding of circuit noise and fragile boundaries of tailored surface codes”. Physical Review X 13, 031007 (2023).
- “Circuit-level protocol and analysis for twist-based lattice surgery”. Physical Review Research 4, 023090 (2022).
- “Universal quantum computing with twist-free and temporally encoded lattice surgery”. PRX Quantum 3, 010331 (2022).
- “Surface code quantum computing by lattice surgery”. New Journal of Physics 14, 123011 (2012).
- “Tangling schedules eases hardware connectivity requirements for quantum error correction” (2023) arXiv:2307.10147.
- “Trading classical and quantum computational resources”. Physical Review X 6, 021043 (2016).
- “Compilation of a simple chemistry application to quantum error correction primitives” (2023). arXiv:2307.03233.
- “How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits”. Quantum 5, 433 (2021).
- “Active volume: An architecture for efficient fault-tolerant quantum computers with limited non-local connections” (2022). arXiv:2211.15465.
- “Logical blocks for fault-tolerant topological quantum computation”. PRX Quantum 4, 020303 (2023).
- Daniel Litinski. “A game of surface codes: Large-scale quantum computing with lattice surgery”. Quantum 3, 128 (2019).
- Daniel Litinski and Felix von Oppen. “Lattice surgery with a twist: simplifying Clifford gates of surface codes”. Quantum 2, 62 (2018).
- “Topological quantum memory”. Journal of Mathematical Physics 43, 4452–4505 (2002).
- “Low-overhead quantum computing with the color code” (2022). arXiv:2201.07806.
- “Sparse blossom: correcting a million errors per core second with minimum-weight matching”. arXiv:2303.15933 (2023).
- “Stim circuits and collected data for ‘Error-corrected Hadamard gate simulated at the circuit level’ manuscript”. https://doi.org/10.5281/zenodo.10391116 (2023).
- “Benchmarking the Planar Honeycomb Code”. Quantum 6, 813 (2022).
- “Pipelined correlated minimum weight perfect matching of the surface code”. arXiv:2205.09828 (2022).
- “A real-time, scalable, fast and highly resource efficient decoder for a quantum computer” (2023). arXiv:2309.05558.
- Craig Gidney. “Inplace access to the surface code Y basis”. arXiv:2302.07395 (2023).
- Daniel Litinski. “Magic state distillation: Not as costly as you think”. Quantum 3, 205 (2019).
- “Poking holes and cutting corners to achieve clifford gates with the surface code”. Physical Review X 7, 021029 (2017).
- H. Bombin. “Topological order with a twist: Ising anyons from an abelian model”. Physical Review Letters 105, 030403 (2010).
- Andrew J. Landahl and Benjamin C. A. Morrison. “Logical fermions for fault-tolerant quantum simulation” (2023). arXiv:2110.10280.
- “The boundaries and twist defects of the color code and their applications to topological quantum computation”. Quantum 2, 101 (2018).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.