Fault-tolerant structures for measurement-based quantum computation on a network

Yves van Montfort1, Sébastian de Bone1,2, and David Elkouss1,3

1QuTech, Delft University of Technology, Lorentzweg 1, 2628 CJ Delft, The Netherlands
2QuSoft, CWI, Science Park 123, 1098 XG Amsterdam, The Netherlands
3Networked Quantum Devices Unit, Okinawa Institute of Science and Technology Graduate University, Okinawa, Japan

Find this paper interesting or want to discuss? Scite or leave a comment on SciRate.

Abstract

In this work, we introduce a method to construct fault-tolerant $\textit{measurement-based quantum computation}$ (MBQC) architectures and numerically estimate their performance over various types of networks. A possible application of such a paradigm is distributed quantum computation, where separate computing nodes work together on a fault-tolerant computation through entanglement. We gauge error thresholds of the architectures with an efficient stabilizer simulator to investigate the resilience against both circuit-level and network noise. We show that, for both monolithic (i.e., non-distributed) and distributed implementations, an architecture based on the diamond lattice may outperform the conventional cubic lattice. Moreover, the high erasure thresholds of non-cubic lattices may be exploited further in a distributed context, as their performance may be boosted through $\textit{entanglement distillation}$ by trading in entanglement success rates against erasure errors during the error-decoding process. These results highlight the significance of lattice geometry in the design of fault-tolerant measurement-based quantum computing on a network, emphasizing the potential for constructing robust and scalable distributed quantum computers.

► BibTeX data

► References

[1] K. Fujii, Quantum Computation with Topological Codes: From Qubit to Topological Fault-Tolerance, SpringerBriefs in Mathematical Physics, Vol. 8 (Springer, Singapore, 2015).
https:/​/​doi.org/​10.1007/​978-981-287-996-7

[2] A. Bolt, G. Duclos-Cianci, D. Poulin, and T. M. Stace, Foliated quantum error-correcting codes, Physical Review Letters 117, 070501 (2016).
https:/​/​doi.org/​10.1103/​PhysRevLett.117.070501

[3] R. Raussendorf, J. Harrington, and K. Goyal, A fault-tolerant one-way quantum computer, Annals of Physics 321, 2242 (2006).
https:/​/​doi.org/​10.1016/​j.aop.2006.01.012

[4] S. D. Barrett and T. M. Stace, Fault tolerant quantum computation with very high threshold for loss errors, Physical Review Letters 105, 200502 (2010).
https:/​/​doi.org/​10.1103/​PhysRevLett.105.200502

[5] H. Bombin, I. H. Kim, D. Litinski, N. Nickerson, M. Pant, F. Pastawski, S. Roberts, and T. Rudolph, Interleaving: Modular Architectures for Fault-Tolerant Photonic Quantum Computing, arXiv:2103.08612 [quant-ph].
arXiv:2103.08612

[6] N. Nickerson and H. Bombín, Measurement Based Fault Tolerance beyond Foliation, arXiv:1810.09621 [quant-ph].
arXiv:1810.09621

[7] J. M. Auger, H. Anwar, M. Gimeno-Segovia, T. M. Stace, and D. E. Browne, Fault-tolerant quantum computation with nondeterministic entangling gates, Physical Review A 97, 030301 (2018).
https:/​/​doi.org/​10.1103/​PhysRevA.97.030301

[8] D. Herr, A. Paler, S. J. Devitt, and F. Nori, A local and scalable lattice renormalization method for ballistic quantum computation, npj Quantum Information 4, 1 (2018).
https:/​/​doi.org/​10.1038/​s41534-018-0076-0

[9] S. Bartolucci, P. Birchall, H. Bombín, H. Cable, C. Dawson, M. Gimeno-Segovia, E. Johnston, K. Kieling, N. Nickerson, M. Pant, F. Pastawski, T. Rudolph, and C. Sparrow, Fusion-based quantum computation, Nature Communications 14, 912 (2023).
https:/​/​doi.org/​10.1038/​s41467-023-36493-1

[10] D. D. Awschalom, R. Hanson, J. Wrachtrup, and B. B. Zhou, Quantum technologies with optically interfaced solid-state spins, Nature Photonics 12, 516 (2018).
https:/​/​doi.org/​10.1038/​s41566-018-0232-2

[11] N. Delfosse and N. H. Nickerson, Almost-linear time decoding algorithm for topological codes, Quantum 5, 595 (2021).
https:/​/​doi.org/​10.22331/​q-2021-12-02-595

[12] M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, 2000).
https:/​/​doi.org/​10.2277/​0521635039

[13] H. J. Briegel and R. Raussendorf, Persistent entanglement in arrays of interacting particles, Physical Review Letters 86, 910 (2001).
https:/​/​doi.org/​10.1103/​PhysRevLett.86.910

[14] M. Newman, L. A. de Castro, and K. R. Brown, Generating fault-tolerant cluster states from crystal structures, Quantum 4, 295 (2020).
https:/​/​doi.org/​10.22331/​q-2020-07-13-295

[15] D. E. Browne and T. Rudolph, Resource-efficient linear optical quantum computation, Physical Review Letters 95, 010501 (2005).
https:/​/​doi.org/​10.1103/​PhysRevLett.95.010501

[16] W. P. Grice, Arbitrarily complete Bell-state measurement using only linear optical elements, Physical Review A 84, 042331 (2011).
https:/​/​doi.org/​10.1103/​PhysRevA.84.042331

[17] F. Ewert and P. van Loock, 3/​4-efficient Bell measurement with passive linear optics and unentangled ancillae, Physical Review Letters 113, 140403 (2014).
https:/​/​doi.org/​10.1103/​PhysRevLett.113.140403

[18] C. H. Bennett, D. P. DiVincenzo, J. A. Smolin, and W. K. Wootters, Mixed-state entanglement and quantum error correction, Physical Review A - Atomic, Molecular, and Optical Physics 54, 3824 (1996).
https:/​/​doi.org/​10.1103/​PhysRevA.54.3824

[19] N. Nickerson, Practical Fault-Tolerant Quantum Computing, Doctoral thesis, Imperial College London, London, United Kingdom (2015).

[20] T. Ohno, G. Arakawa, I. Ichinose, and T. Matsui, Phase structure of the random-plaquette Z2 gauge model: Accuracy threshold for a toric quantum memory, Nuclear Physics B 697, 462 (2004).
https:/​/​doi.org/​10.1016/​j.nuclphysb.2004.07.003

[21] N. Delfosse and G. Zémor, Linear-time maximum likelihood decoding of surface codes over the quantum erasure channel, Physical Review Research 2, 033042 (2020).
https:/​/​doi.org/​10.1103/​PhysRevResearch.2.033042

[22] Y. van Montfort, S. de Bone, and D. Elkouss, Data/​software underlying the publication: Fault-tolerant structures for measurement-based quantum computation on a network, 4TU.ResearchData, https:/​/​doi.org/​10.4121/​929e24f9-31fa-4816-99fa-3356e272df43 (2024).
https:/​/​doi.org/​10.4121/​929e24f9-31fa-4816-99fa-3356e272df43

[23] H. Bombín, C. Dawson, R. V. Mishmash, N. Nickerson, F. Pastawski, and S. Roberts, Logical blocks for fault-tolerant topological quantum computation, PRX Quantum 4, 020303 (2023).
https:/​/​doi.org/​10.1103/​PRXQuantum.4.020303

[24] D. König, Graphok es matrixok, Matematikai és Fizikai Lapok 38, 116 (1931).

[25] N. H. Nickerson, Y. Li, and S. C. Benjamin, Topological quantum computing with a very noisy network and local error rates approaching one percent, Nature Communications 4, 1756 (2013).
https:/​/​doi.org/​10.1038/​ncomms2773

[26] D. Deutsch, A. Ekert, R. Jozsa, C. Macchiavello, S. Popescu, and A. Sanpera, Quantum privacy amplification and the security of quantum cryptography over noisy channels, Physical Review Letters 77, 2818 (1996).
https:/​/​doi.org/​10.1103/​PhysRevLett.77.2818

[27] K. Goodenough, S. de Bone, V. L. Addala, S. Krastanov, S. Jansen, D. Gijswijt, and D. Elkouss, Near-Term $n$ to $k$ Distillation Protocols Using Graph Codes, IEEE Journal on Selected Areas in Communications 42, 7, 1830 (2024).
https:/​/​doi.org/​10.1109/​JSAC.2024.3380094

[28] N. H. Nickerson, J. F. Fitzsimons, and S. C. Benjamin, Freely scalable quantum technologies using cells of 5-to-50 qubits with very lossy and noisy photonic links, Physical Review X 4, 041041 (2014).
https:/​/​doi.org/​10.1103/​PhysRevX.4.041041

[29] C. Gidney, M. Newman, and M. McEwen, Benchmarking the planar honeycomb code, Quantum 6, 813 (2022).
https:/​/​doi.org/​10.22331/​q-2022-09-21-813

[30] S. J. Chung, T. Hahn, and W. E. Klee, Nomenclature and generation of three-periodic nets: The vector method, Acta Crystallographica Section A: Foundations of Crystallography 40, 42 (1984).
https:/​/​doi.org/​10.1107/​S0108767384000088

[31] S. Aaronson and D. Gottesman, Improved simulation of stabilizer circuits, Physical Review A 70, 052328 (2004).
https:/​/​doi.org/​10.1103/​PhysRevA.70.052328

[32] C. Wang, J. Harrington, and J. Preskill, Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory, Annals of Physics 303, 31 (2003).
https:/​/​doi.org/​10.1016/​S0003-4916(02)00019-2

Cited by

[1] Namisha Gupta, Divya Punia, Kumar Gautam, Geeta Sikka, Ajay K Sharma, and Ahmed Farouk, "Realization of measurement-based quantum computing model in fault-tolerant distributed quantum systems", Computer Science Review 61, 100942 (2026).

[2] Yifan F. Zhang and Sarang Gopalakrishnan, "Conditional Mutual Information and Information-Theoretic Phases of Decohered Gibbs States", Physical Review Letters 135 16, 160401 (2025).

[3] Harashta Tatimma Larasati and Byung-Soo Choi, "Circuit-based vs. measurement-based quantum computing: a comparative analysis, layered metrics, and decision flow for approach selection", EPJ Quantum Technology 13 1, 39 (2026).

[4] Namisha Gupta, Divya Punia, Kumar Gautam, Geeta Sikka, and Ajay K. Sharma, 2025 OITS International Conference on Information Technology (OCIT) 383 (2025) ISBN:979-8-3315-7702-5.

[5] Junyu Quan, Yuxun Wang, Peishan Li, Yanyan Feng, and Qin Li, "Strictly universal hypergraph states for measurement-based blind quantum computation", Optics & Laser Technology 203, 115531 (2026).

[6] Nitish Kumar Chandra, David Tipper, Reza Nejabati, Eneet Kaur, and Kaushik P. Seshadreesan, "Distributed Realization of Color Codes for Quantum Error Correction", arXiv:2505.10693, (2025).

[7] Joris Kattemölle, "Edge coloring lattice graphs", Journal of Mathematical Physics 66 5, 051901 (2025).

[8] Aaron C Elkins, Sanchit Singh, Adrian Kieback, Sawyer Blankenship, Uyiosa Philip Amadasun, and Aman Chadha, "DAWZY: A New Addition to AI powered "Human in the Loop" Music Co-creation", arXiv:2512.03289, (2025).

The above citations are from Crossref's cited-by service (last updated successfully 2026-07-15 15:34:27) and SAO/NASA ADS (last updated successfully 2026-07-15 15:34:37). The list may be incomplete as not all publishers provide suitable and complete citation data.