{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T03:10:10Z","timestamp":1775013010108,"version":"3.50.1"},"reference-count":35,"publisher":"Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften","license":[{"start":{"date-parts":[[2024,6,18]],"date-time":"2024-06-18T00:00:00Z","timestamp":1718668800000},"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":"There are several models of quantum computation which exhibit shared fundamental fault-tolerance properties. This article makes commonalities explicit by presenting these different models in a unifying framework based on the ZX calculus. We focus on models of topological fault tolerance \u2013 specifically surface codes \u2013 including circuit-based, measurement-based and fusion-based quantum computation, as well as the recently introduced model of Floquet codes. We find that all of these models can be viewed as different flavors of the same underlying stabilizer fault-tolerance structure, and sustain this through a set of local equivalence transformations which allow mapping between flavors. We anticipate that this unifying perspective will pave the way to transferring progress among the different views of stabilizer fault-tolerance and help researchers familiar with one model easily understand others.<\/jats:p>","DOI":"10.22331\/q-2024-06-18-1379","type":"journal-article","created":{"date-parts":[[2024,6,18]],"date-time":"2024-06-18T10:57:12Z","timestamp":1718708232000},"page":"1379","update-policy":"https:\/\/doi.org\/10.22331\/q-crossmark-policy-page","source":"Crossref","is-referenced-by-count":31,"title":["Unifying flavors of fault tolerance with the ZX calculus"],"prefix":"10.22331","volume":"8","author":[{"given":"Hector","family":"Bombin","sequence":"first","affiliation":[{"name":"PsiQuantum, Palo Alto"}]},{"given":"Daniel","family":"Litinski","sequence":"additional","affiliation":[{"name":"PsiQuantum, Palo Alto"}]},{"given":"Naomi","family":"Nickerson","sequence":"additional","affiliation":[{"name":"PsiQuantum, Palo Alto"}]},{"given":"Fernando","family":"Pastawski","sequence":"additional","affiliation":[{"name":"PsiQuantum, Palo Alto"}]},{"given":"Sam","family":"Roberts","sequence":"additional","affiliation":[{"name":"PsiQuantum, Palo Alto"}]}],"member":"9598","published-online":{"date-parts":[[2024,6,18]]},"reference":[{"key":"0","doi-asserted-by":"publisher","unstructured":"Alexei Yu Kitaev. ``Fault-tolerant quantum computation by anyons''. Annals of Physics 303, 2\u201330 (2003).","DOI":"10.1016\/S0003-4916(02)00018-0"},{"key":"1","doi-asserted-by":"publisher","unstructured":"Eric Dennis, Alexei Kitaev, Andrew Landahl, and John Preskill. ``Topological quantum memory''. Journal of Mathematical Physics 43, 4452\u20134505 (2002).","DOI":"10.1063\/1.1499754"},{"key":"2","doi-asserted-by":"publisher","unstructured":"Robert Raussendorf, Daniel E. Browne, and Hans J. Briegel. ``Measurement-based quantum computation on cluster states''. Physical Review A 68, 022312 (2003).","DOI":"10.1103\/PhysRevA.68.022312"},{"key":"3","doi-asserted-by":"publisher","unstructured":"H. J. Briegel, D. E. Browne, W. D\u00fcr, R. Raussendorf, and M. Van Den Nest. ``Measurement-based quantum computation''. Nature Physics 2009 5:1 5, 19\u201326 (2009).","DOI":"10.1038\/nphys1157"},{"key":"4","doi-asserted-by":"publisher","unstructured":"R. Raussendorf, J. Harrington, and K. Goyal. ``A fault-tolerant one-way quantum computer''. Annals of Physics 321, 2242\u20132270 (2006).","DOI":"10.1016\/j.aop.2006.01.012"},{"key":"5","doi-asserted-by":"publisher","unstructured":"Sara Bartolucci, Patrick Birchall, Hector Bombin, Hugo Cable, Chris Dawson, Mercedes Gimeno-Segovia, Eric Johnston, Konrad Kieling, Naomi Nickerson, Mihir Pant, et al. ``Fusion-based quantum computation''. Nature Communications 14, 912 (2023).","DOI":"10.1038\/s41467-023-36493-1"},{"key":"6","doi-asserted-by":"publisher","unstructured":"Matthew B. Hastings and Jeongwan Haah. ``Dynamically generated logical qubits''. Quantum 5, 564 (2021).","DOI":"10.22331\/q-2021-10-19-564"},{"key":"7","doi-asserted-by":"publisher","unstructured":"Adam Paetznick, Christina Knapp, Nicolas Delfosse, Bela Bauer, Jeongwan Haah, Matthew B. Hastings, and Marcus P. da Silva. ``Performance of planar Floquet codes with Majorana-based qubits''. PRX Quantum 4, 010310 (2023).","DOI":"10.1103\/PRXQuantum.4.010310"},{"key":"8","doi-asserted-by":"publisher","unstructured":"Jeongwan Haah and Matthew B. Hastings. ``Boundaries for the honeycomb code''. Quantum 6, 693 (2022).","DOI":"10.22331\/q-2022-04-21-693"},{"key":"9","doi-asserted-by":"publisher","unstructured":"Craig Gidney, Michael Newman, and Matt McEwen. ``Benchmarking the planar honeycomb code''. Quantum 6, 813 (2022).","DOI":"10.22331\/q-2022-09-21-813"},{"key":"10","doi-asserted-by":"publisher","unstructured":"Craig Gidney. ``A pair measurement surface code on pentagons''. Quantum 7, 1156 (2023).","DOI":"10.22331\/q-2023-10-25-1156"},{"key":"11","doi-asserted-by":"publisher","unstructured":"Markus S. Kesselring, Julio C. Magdalena de la Fuente, Felix Thomsen, Jens Eisert, Stephen D. Bartlett, and Benjamin J. Brown. ``Anyon condensation and the color code''. PRX Quantum 5, 010342 (2024).","DOI":"10.1103\/PRXQuantum.5.010342"},{"key":"12","doi-asserted-by":"publisher","unstructured":"Ram\u00f3n Aguado and Leo P. Kouwenhoven. ``Majorana qubits for topological quantum computing''. Physics Today 73, 44 (2020).","DOI":"10.1063\/PT.3.4499"},{"key":"13","doi-asserted-by":"publisher","unstructured":"H\u00e9ctor Bomb\u00edn, Chris Dawson, Ryan V. Mishmash, Naomi Nickerson, Fernando Pastawski, and Sam Roberts. ``Logical blocks for fault-tolerant topological quantum computation''. PRX Quantum 4, 020303 (2023).","DOI":"10.1103\/PRXQuantum.4.020303"},{"key":"14","doi-asserted-by":"publisher","unstructured":"Daniel Gottesman. ``Opportunities and challenges in fault-tolerant quantum computation'' arXiv:2210.15844 (2022).","DOI":"10.48550\/arXiv.2210.15844"},{"key":"15","doi-asserted-by":"publisher","unstructured":"Bob Coecke and Ross Duncan. ``Interacting quantum observables: categorical algebra and diagrammatics''. New Journal of Physics 13, 043016 (2011).","DOI":"10.1088\/1367-2630\/13\/4\/043016"},{"key":"16","doi-asserted-by":"publisher","unstructured":"Miriam Backens. ``The ZX-calculus is complete for stabilizer quantum mechanics''. New Journal of Physics 16, 093021 (2014).","DOI":"10.1088\/1367-2630\/16\/9\/093021"},{"key":"17","doi-asserted-by":"publisher","unstructured":"Bob Coecke and Aleks Kissinger. ``Picturing quantum processes: A first course in quantum theory and diagrammatic reasoning''. Cambridge University Press. (2017).","DOI":"10.1017\/9781316219317"},{"key":"18","doi-asserted-by":"publisher","unstructured":"Niel de Beaudrap and Dominic Horsman. ``The ZX calculus is a language for surface code lattice surgery''. Quantum 4, 218 (2020).","DOI":"10.22331\/q-2020-01-09-218"},{"key":"19","doi-asserted-by":"publisher","unstructured":"Amar Hadzihasanovic, Kang Feng Ng, and Quanlong Wang. ``Two complete axiomatisations of pure-state qubit quantum computing''. Proceedings - Symposium on Logic in Computer SciencePages 502\u2013511 (2018).","DOI":"10.1145\/3209108.3209128"},{"key":"20","doi-asserted-by":"publisher","unstructured":"Emmanuel Jeandel, Simon Perdrix, and Renaud Vilmart. ``A complete axiomatisation of the ZX-calculus for Clifford+T quantum mechanics''. Proceedings - Symposium on Logic in Computer SciencePages 559\u2013568 (2018).","DOI":"10.1145\/3209108.3209131"},{"key":"21","doi-asserted-by":"publisher","unstructured":"John van de Wetering. ``ZX-calculus for the working quantum computer scientist'' arXiv:2012.13966 (2020).","DOI":"10.48550\/arXiv.2012.13966"},{"key":"22","doi-asserted-by":"publisher","unstructured":"Tom Peham, Lukas Burgholzer, and Robert Wille. ``Equivalence checking of quantum circuits with the ZX-calculus''. IEEE Journal on Emerging and Selected Topics in Circuits and SystemsPages 1\u20131 (2022).","DOI":"10.1109\/jetcas.2022.3202204"},{"key":"23","doi-asserted-by":"publisher","unstructured":"Matt McEwen, Dave Bacon, and Craig Gidney. ``Relaxing Hardware Requirements for Surface Code Circuits using Time-dynamics''. Quantum 7, 1172 (2023).","DOI":"10.22331\/q-2023-11-07-1172"},{"key":"24","doi-asserted-by":"publisher","unstructured":"Margarita Davydova, Nathanan Tantivasadakarn, and Shankar Balasubramanian. ``Floquet codes without parent subsystem codes''. PRX Quantum 4, 020341 (2023).","DOI":"10.1103\/PRXQuantum.4.020341"},{"key":"25","doi-asserted-by":"publisher","unstructured":"Robert Raussendorf, Sergey Bravyi, and Jim Harrington. ``Long-range quantum entanglement in noisy cluster states''. Phys. Rev. A 71, 062313 (2005).","DOI":"10.1103\/PhysRevA.71.062313"},{"key":"26","unstructured":"Naomi Nickerson and Hector Bombin. ``Measurement based fault tolerance beyond foliation'' (2018)."},{"key":"27","unstructured":"Hector Bombin, Isaac H. Kim, Daniel Litinski, Naomi Nickerson, Mihir Pant, Fernando Pastawski, Sam Roberts, and Terry Rudolph. ``Interleaving: Modular architectures for fault-tolerant photonic quantum computing'' (2021)."},{"key":"28","doi-asserted-by":"publisher","unstructured":"Michael Newman, Leonardo Andreta de Castro, and Kenneth R. Brown. ``Generating Fault-Tolerant Cluster States from Crystal Structures''. Quantum 4, 295 (2020).","DOI":"10.22331\/q-2020-07-13-295"},{"key":"29","doi-asserted-by":"publisher","unstructured":"H. Bombin and M. A. Martin-Delgado. ``Topological quantum distillation''. Phys. Rev. Lett. 97, 180501 (2006).","DOI":"10.1103\/PhysRevLett.97.180501"},{"key":"30","doi-asserted-by":"publisher","unstructured":"Hector Bombin. ``2D quantum computation with 3D topological codes'' arXiv:1810.09571 (2018).","DOI":"10.48550\/arXiv.1810.09571"},{"key":"31","doi-asserted-by":"publisher","unstructured":"Nikolas P. Breuckmann and Jens Niklas Eberhardt. ``Quantum low-density parity-check codes''. PRX Quantum 2, 040101 (2021).","DOI":"10.1103\/PRXQuantum.2.040101"},{"key":"32","doi-asserted-by":"publisher","unstructured":"Andrey Boris Khesin, Jonathan Z Lu, and Peter W Shor. ``Graphical quantum Clifford-encoder compilers from the ZX calculus'' arXiv:2301.02356 (2023).","DOI":"10.48550\/arXiv.2301.02356"},{"key":"33","doi-asserted-by":"publisher","unstructured":"H\u00e9ctor Bomb\u00edn, Chris Dawson, Ye-Hua Liu, Naomi Nickerson, Fernando Pastawski, and Sam Roberts. ``Modular decoding: parallelizable real-time decoding for quantum computers'' arXiv:2303.04846 (2023).","DOI":"10.48550\/arXiv.2303.04846"},{"key":"34","doi-asserted-by":"publisher","unstructured":"Daniel Litinski and Naomi Nickerson. ``Active volume: An architecture for efficient fault-tolerant quantum computers with limited non-local connections'' arXiv:2211.15465 (2022).","DOI":"10.48550\/arXiv.2211.15465"}],"container-title":["Quantum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/quantum-journal.org\/papers\/q-2024-06-18-1379\/pdf\/","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,6,18]],"date-time":"2024-06-18T10:57:22Z","timestamp":1718708242000},"score":1,"resource":{"primary":{"URL":"https:\/\/quantum-journal.org\/papers\/q-2024-06-18-1379\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,18]]},"references-count":35,"URL":"https:\/\/doi.org\/10.22331\/q-2024-06-18-1379","archive":["CLOCKSS"],"relation":{},"ISSN":["2521-327X"],"issn-type":[{"value":"2521-327X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,18]]},"article-number":"1379"}}