{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T08:45:36Z","timestamp":1774773936215,"version":"3.50.1"},"reference-count":36,"publisher":"Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften","license":[{"start":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T00:00:00Z","timestamp":1719878400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["quantum-journal.org"],"crossmark-restriction":false},"short-container-title":["Quantum"],"abstract":"<jats:p>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 <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>X<\/mml:mi><\/mml:math> and <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>Z<\/mml:mi><\/mml:math> 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 <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>S<\/mml:mi><mml:mi>W<\/mml:mi><mml:mi>A<\/mml:mi><mml:mi>P<\/mml:mi><\/mml:math>-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 \\cite{McEwenBaconGidney} can be constructed.<\/jats:p>","DOI":"10.22331\/q-2024-07-02-1394","type":"journal-article","created":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T16:44:27Z","timestamp":1719938667000},"page":"1394","update-policy":"https:\/\/doi.org\/10.22331\/q-crossmark-policy-page","source":"Crossref","is-referenced-by-count":17,"title":["Error-corrected Hadamard gate simulated at the circuit level"],"prefix":"10.22331","volume":"8","author":[{"given":"Gy\u00f6rgy P.","family":"Geh\u00e9r","sequence":"first","affiliation":[{"name":"Riverlane, Cambridge, CB2 3BZ, UK"}]},{"given":"Campbell","family":"McLauchlan","sequence":"additional","affiliation":[{"name":"Riverlane, Cambridge, CB2 3BZ, UK"},{"name":"DAMTP, University of Cambridge, Wilberforce Road, Cambridge, CB3 0WA, UK"}]},{"given":"Earl T.","family":"Campbell","sequence":"additional","affiliation":[{"name":"Riverlane, Cambridge, CB2 3BZ, UK"},{"name":"Department of Physics and Astronomy, University of Sheffield, Sheffield S3 7RH, UK"}]},{"given":"Alexandra E.","family":"Moylett","sequence":"additional","affiliation":[{"name":"Riverlane, Cambridge, CB2 3BZ, UK"}]},{"given":"Ophelia","family":"Crawford","sequence":"additional","affiliation":[{"name":"Riverlane, Cambridge, CB2 3BZ, UK"}]}],"member":"9598","published-online":{"date-parts":[[2024,7,2]]},"reference":[{"key":"0","doi-asserted-by":"publisher","unstructured":"Matt McEwen, Dave Bacon, and Craig Gidney. ``Relaxing hardware requirements for surface code circuits using time-dynamics&apos;&apos;. Quantum 7, 1172 (2023).","DOI":"10.22331\/q-2023-11-07-1172"},{"key":"1","unstructured":"Daniel Gottesman. ``Stabilizer codes and quantum error correction&apos;&apos; (1997) arXiv:quant-ph\/9705052."},{"key":"2","doi-asserted-by":"publisher","unstructured":"Barbara M. Terhal. ``Quantum error correction for quantum memories&apos;&apos;. Reviews of Modern Physics 87, 307 (2015).","DOI":"10.1103\/RevModPhys.87.307"},{"key":"3","doi-asserted-by":"publisher","unstructured":"Earl T. Campbell, Barbara M. Terhal, and Christophe Vuillot. ``Roads towards fault-tolerant universal quantum computation&apos;&apos;. Nature 549, 172\u2013179 (2017).","DOI":"10.1038\/nature23460"},{"key":"4","doi-asserted-by":"publisher","unstructured":"Joschka Roffe. ``Quantum error correction: an introductory guide&apos;&apos;. Contemporary Physics 60, 226\u2013245 (2019).","DOI":"10.1080\/00107514.2019.1667078"},{"key":"5","doi-asserted-by":"publisher","unstructured":"Craig Gidney. ``Stim: a fast stabilizer circuit simulator&apos;&apos;. Quantum 5, 497 (2021).","DOI":"10.22331\/q-2021-07-06-497"},{"key":"6","doi-asserted-by":"publisher","unstructured":"R. Raussendorf, J. Harrington, and K. Goyal. ``Topological fault-tolerance in cluster state quantum computation&apos;&apos;. New Journal of Physics 9, 199 (2007).","DOI":"10.1088\/1367-2630\/9\/6\/199"},{"key":"7","doi-asserted-by":"publisher","unstructured":"Austin G. Fowler, Matteo Mariantoni, John M. Martinis, and Andrew N. Cleland. ``Surface codes: Towards practical large-scale quantum computation&apos;&apos;. Physical Review A 86, 032324 (2012).","DOI":"10.1103\/PhysRevA.86.032324"},{"key":"8","doi-asserted-by":"publisher","unstructured":"Yu Tomita and Krysta M. Svore. ``Low-distance surface codes under realistic quantum noise&apos;&apos;. Physical Review A 90, 062320 (2014).","DOI":"10.1103\/physreva.90.062320"},{"key":"9","doi-asserted-by":"publisher","unstructured":"Christopher Chamberland, Guanyu Zhu, Theodore J. Yoder, Jared B. Hertzberg, and Andrew W. Cross. ``Topological and subsystem codes on low-degree graphs with flag qubits&apos;&apos;. Physical Review X 10, 011022 (2020).","DOI":"10.1103\/PhysRevX.10.011022"},{"key":"10","doi-asserted-by":"publisher","unstructured":"Oscar Higgott, Thomas C. Bohdanowicz, Aleksander Kubica, Steven T. Flammia, and Earl T. Campbell. ``Improved decoding of circuit noise and fragile boundaries of tailored surface codes&apos;&apos;. Physical Review X 13, 031007 (2023).","DOI":"10.1103\/PhysRevX.13.031007"},{"key":"11","doi-asserted-by":"publisher","unstructured":"Christopher Chamberland and Earl T. Campbell. ``Circuit-level protocol and analysis for twist-based lattice surgery&apos;&apos;. Physical Review Research 4, 023090 (2022).","DOI":"10.1103\/PhysRevResearch.4.023090"},{"key":"12","doi-asserted-by":"publisher","unstructured":"Christopher Chamberland and Earl T. Campbell. ``Universal quantum computing with twist-free and temporally encoded lattice surgery&apos;&apos;. PRX Quantum 3, 010331 (2022).","DOI":"10.1103\/PRXQuantum.3.010331"},{"key":"13","doi-asserted-by":"publisher","unstructured":"Dominic Horsman, Austin G. Fowler, Simon Devitt, and Rodney Van Meter. ``Surface code quantum computing by lattice surgery&apos;&apos;. New Journal of Physics 14, 123011 (2012).","DOI":"10.1088\/1367-2630\/14\/12\/123011"},{"key":"14","doi-asserted-by":"publisher","unstructured":"Gy\u00f6rgy P. Geh\u00e9r, Ophelia Crawford, and Earl T. Campbell. ``Tangling schedules eases hardware connectivity requirements for quantum error correction&apos;&apos;. PRX Quantum 5, 010348 (2024).","DOI":"10.1103\/prxquantum.5.010348"},{"key":"15","doi-asserted-by":"publisher","unstructured":"Sergey Bravyi, Graeme Smith, and John A. Smolin. ``Trading classical and quantum computational resources&apos;&apos;. Physical Review X 6, 021043 (2016).","DOI":"10.1103\/PhysRevX.6.021043"},{"key":"16","doi-asserted-by":"publisher","unstructured":"Nick S. Blunt, Gy\u00f6rgy P. Geh\u00e9r, and Alexandra E. Moylett. ``Compilation of a simple chemistry application to quantum error correction primitives&apos;&apos;. Phys. Rev. Res. 6, 013325 (2024).","DOI":"10.1103\/PhysRevResearch.6.013325"},{"key":"17","doi-asserted-by":"publisher","unstructured":"Craig Gidney and Martin Eker\u00e5. ``How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits&apos;&apos;. Quantum 5, 433 (2021).","DOI":"10.22331\/q-2021-04-15-433"},{"key":"18","unstructured":"Daniel Litinski and Naomi Nickerson. ``Active volume: An architecture for efficient fault-tolerant quantum computers with limited non-local connections&apos;&apos; (2022). arXiv:2211.15465."},{"key":"19","doi-asserted-by":"publisher","unstructured":"Hector Bombin, Chris Dawson, Ryan V. Mishmash, Naomi Nickerson, Fernando Pastawski, and Sam Roberts. ``Logical blocks for fault-tolerant topological quantum computation&apos;&apos;. PRX Quantum 4, 020303 (2023).","DOI":"10.1103\/PRXQuantum.4.020303"},{"key":"20","doi-asserted-by":"publisher","unstructured":"Daniel Litinski. ``A game of surface codes: Large-scale quantum computing with lattice surgery&apos;&apos;. Quantum 3, 128 (2019).","DOI":"10.22331\/q-2019-03-05-128"},{"key":"21","doi-asserted-by":"publisher","unstructured":"Daniel Litinski and Felix von Oppen. ``Lattice surgery with a twist: simplifying Clifford gates of surface codes&apos;&apos;. Quantum 2, 62 (2018).","DOI":"10.22331\/q-2018-05-04-62"},{"key":"22","doi-asserted-by":"publisher","unstructured":"Eric Dennis, Alexei Kitaev, Andrew Landahl, and John Preskill. ``Topological quantum memory&apos;&apos;. Journal of Mathematical Physics 43, 4452\u20134505 (2002).","DOI":"10.1063\/1.1499754"},{"key":"23","unstructured":"Felix Thomsen, Markus S. Kesselring, Stephen D. Bartlett, and Benjamin J. Brown. ``Low-overhead quantum computing with the color code&apos;&apos; (2022). arXiv:2201.07806."},{"key":"24","doi-asserted-by":"publisher","unstructured":"Oscar Higgott and Craig Gidney. ``Sparse blossom: correcting a million errors per core second with minimum-weight matching&apos;&apos;. arXiv:2303.15933 (2023).","DOI":"10.48550\/arXiv.2303.15933"},{"key":"25","doi-asserted-by":"publisher","unstructured":"Gy\u00f6rgy P. Geh\u00e9r, Campbell McLauchlan, Earl T. Campbell, Alexandra E. Moylett, and Ophelia Crawford. ``Stim circuits and collected data for `Error-corrected Hadamard gate simulated at the circuit level&apos; manuscript&apos;&apos;. https:\/\/doi.org\/10.5281\/zenodo.10391116 (2023).","DOI":"10.5281\/zenodo.10391116"},{"key":"26","doi-asserted-by":"publisher","unstructured":"Craig Gidney, Michael Newman, and Matt McEwen. ``Benchmarking the Planar Honeycomb Code&apos;&apos;. Quantum 6, 813 (2022).","DOI":"10.22331\/q-2022-09-21-813"},{"key":"27","doi-asserted-by":"publisher","unstructured":"Alexandru Paler and Austin G. Fowler. ``Pipelined correlated minimum weight perfect matching of the surface code&apos;&apos;. arXiv:2205.09828 (2022).","DOI":"10.48550\/arXiv.2205.09828"},{"key":"28","unstructured":"Ben Barber, Kenton M. Barnes, Tomasz Bialas, Okan Bu\u011fdayc\u0131, Earl T. Campbell, Neil I. Gillespie, Kauser Johar, Ram Rajan, Adam W. Richardson, Luka Skoric, Canberk Topal, Mark L. Turner, and Abbas B. Ziad. ``A real-time, scalable, fast and highly resource efficient decoder for a quantum computer&apos;&apos; (2023). arXiv:2309.05558."},{"key":"29","doi-asserted-by":"publisher","unstructured":"Craig Gidney. ``Inplace access to the surface code Y basis&apos;&apos;. Quantum 8, 1310 (2024).","DOI":"10.22331\/q-2024-04-08-1310"},{"key":"30","doi-asserted-by":"publisher","unstructured":"Daniel Litinski. ``Magic state distillation: Not as costly as you think&apos;&apos;. Quantum 3, 205 (2019).","DOI":"10.22331\/q-2019-12-02-205"},{"key":"31","unstructured":"Craig Gidney, Michael Newman, Peter Brooks, and Cody Jones. ``Yoked surface codes&apos;&apos; (2023). arXiv:2312.04522."},{"key":"32","doi-asserted-by":"publisher","unstructured":"Benjamin J. Brown, Katharina Laubscher, Markus S. Kesselring, and James R. Wootton. ``Poking holes and cutting corners to achieve clifford gates with the surface code&apos;&apos;. Physical Review X 7, 021029 (2017).","DOI":"10.1103\/physrevx.7.021029"},{"key":"33","doi-asserted-by":"publisher","unstructured":"Hector Bombin. ``Topological order with a twist: Ising anyons from an abelian model&apos;&apos;. Physical Review Letters 105, 030403 (2010).","DOI":"10.1103\/physrevlett.105.030403"},{"key":"34","unstructured":"Andrew J. Landahl and Benjamin C. A. Morrison. ``Logical fermions for fault-tolerant quantum simulation&apos;&apos; (2023). arXiv:2110.10280."},{"key":"35","doi-asserted-by":"publisher","unstructured":"Markus S. Kesselring, Fernando Pastawski, Jens Eisert, and Benjamin J. Brown. ``The boundaries and twist defects of the color code and their applications to topological quantum computation&apos;&apos;. Quantum 2, 101 (2018).","DOI":"10.22331\/q-2018-10-19-101"}],"container-title":["Quantum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/quantum-journal.org\/papers\/q-2024-07-02-1394\/pdf\/","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T16:44:37Z","timestamp":1719938677000},"score":1,"resource":{"primary":{"URL":"https:\/\/quantum-journal.org\/papers\/q-2024-07-02-1394\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,2]]},"references-count":36,"URL":"https:\/\/doi.org\/10.22331\/q-2024-07-02-1394","archive":["CLOCKSS"],"relation":{},"ISSN":["2521-327X"],"issn-type":[{"value":"2521-327X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,2]]},"article-number":"1394"}}