cff-version: 1.2.0
abstract: "<p>In this work, we introduce a method to construct fault-tolerant 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 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.</p>"
authors:
  - family-names: van Montfort
    given-names: Yves
  - family-names: de Bone
    given-names: Sebastian
    orcid: "https://orcid.org/0000-0001-6423-8761"
  - family-names: Elkouss
    given-names: David
    orcid: "https://orcid.org/0000-0003-2023-2768"
title: "Data/software underlying the publication: Fault-tolerant structures for measurement-based quantum computation on a network"
keywords:
version: 1
identifiers:
  - type: doi
    value: 10.4121/929e24f9-31fa-4816-99fa-3356e272df43.v1
license: CC BY 4.0
date-released: 2024-01-19