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

Abstract

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.

arXiv comment21 pages, 17 figures

References in corpus (19)

• Mixed State Entanglement and Quantum Error Correction
• Persistent entanglement in arrays of interacting particles
• Improved Simulation of Stabilizer Circuits
• Quantum privacy amplification and the security of quantum cryptography over noisy channels
• Resource-efficient linear optical quantum computation
• A fault-tolerant one-way quantum computer
• Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory
• Topological quantum computing with a very noisy network and local error rates approaching one percent
• 3/4-efficient Bell measurement with passive linear optics and unentangled ancillae
• Fault tolerant quantum computation with very high threshold for loss errors
• Foliated Quantum Codes
• Linear-Time Maximum Likelihood Decoding of Surface Codes over the Quantum Erasure Channel
• Phase Structure of the Random-Plaquette Z_2 Gauge Model: Accuracy Threshold for a Toric Quantum Memory
• Logical blocks for fault-tolerant topological quantum computation
• Benchmarking the Planar Honeycomb Code
• Fault-tolerant quantum computation with non-deterministic entangling gates
• Generating Fault-Tolerant Cluster States from Crystal Structures
• A local and scalable lattice renormalization method for ballistic quantum computation
• Near-term $n$ to $k$ distillation protocols using graph codes