Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Computer Science Review

Realization of measurement-based quantum computing model in fault-tolerant distributed quantum systems

Namisha Gupta, Divya Punia, Kumar Gautam, Geeta Sikka, Ajay K Sharma, Ahmed Farouk

Published Mar 11, 2026• 3 citations
Publisher
DOI
10.1016/j.cosrev.2026.100942

Related papers

Measurement-based Quantum Computation and the Fault-tolerant System

Yuuki Tokunaga

Quantum computation provides us with a new form of information processing that surpasses current computer technology.In a new model of quantum computation, measurement-based quantum computation, the computation proceeds via simple measurements on previously prepared quantum entangled states.This model has attracted attention for its good potential for realizing quantum computers.This article reviews the basic concepts of measurement-based quantum computation and the elegant fault-tolerant system called topological one-way quantum computation.

NTT technical review•Jul 1, 2011•0 citations

Fault-tolerant measurement-based quantum computing

Debbie Leung

Cambridge University Press eBooks•Sep 5, 2013•0 citations

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

Yves van Montfort, Sébastian de Bone, David Elkouss

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:2402.19323•Quantum•May 5, 2025•9 citations

Network-Based Quantum Computing: an efficient design framework for many-small-node distributed fault-tolerant quantum computing

Soshun Naito, Yasunari Suzuki, Yuuki Tokunaga

In fault-tolerant quantum computing, a large number of physical qubits are required to construct a single logical qubit, and a single quantum node may be able to hold only a small number of logical qubits. In such a case, the idea of distributed fault-tolerant quantum computing (DFTQC) is important to demonstrate large-scale quantum computation using small-scale nodes. However, the design of distributed systems on small-scale nodes, where each node can store only one or a few logical qubits for computation, has not been explored well yet. In this paper, we propose network-based quantum computation (NBQC) to efficiently realize distributed fault-tolerant quantum computation using many small-scale nodes. A key idea of NBQC is to let computational data continuously move throughout the network while maintaining the connectivity to other nodes. We numerically show that, for practical benchmark tasks, our method achieves shorter execution times than circuit-based strategies and more node-efficient constructions than measurement-based quantum computing. Also, if we are allowed to specialize the network to the structure of quantum programs, such as peak access frequencies, the number of nodes can be significantly reduced. Thus, our methods provide a foundation in designing DFTQC architecture exploiting the redundancy of many small fault-tolerant nodes.

quant-pharXiv:2601.09374•IEEE Transactions on Quantum Engineering•Jan 15, 2026•7 citations

Measurement-free fault-tolerant quantum computing

Markus Müller

•Jan 1, 2026•0 citations

Demonstration of measurement-free universal fault-tolerant quantum computation

Friederike Butt, Ivan Pogorelov, Freund, Robert +4 more

•Jan 1, 2025•0 citations
Quantum computation provides us with a new form of information processing that surpasses current computer technology.In a new model of quantum computation, measurement-based quantum computation, the computation proceeds via simple measurements on previously prepared quantum entangled states.This model has attracted attention for its good potential for realizing quantum computers.This article reviews the basic concepts of measurement-based quantum computation and the elegant fault-tolerant system called topological one-way quantum computation.
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.
In fault-tolerant quantum computing, a large number of physical qubits are required to construct a single logical qubit, and a single quantum node may be able to hold only a small number of logical qubits. In such a case, the idea of distributed fault-tolerant quantum computing (DFTQC) is important to demonstrate large-scale quantum computation using small-scale nodes. However, the design of distributed systems on small-scale nodes, where each node can store only one or a few logical qubits for computation, has not been explored well yet. In this paper, we propose network-based quantum computation (NBQC) to efficiently realize distributed fault-tolerant quantum computation using many small-scale nodes. A key idea of NBQC is to let computational data continuously move throughout the network while maintaining the connectivity to other nodes. We numerically show that, for practical benchmark tasks, our method achieves shorter execution times than circuit-based strategies and more node-efficient constructions than measurement-based quantum computing. Also, if we are allowed to specialize the network to the structure of quantum programs, such as peak access frequencies, the number of nodes can be significantly reduced. Thus, our methods provide a foundation in designing DFTQC architecture exploiting the redundancy of many small fault-tolerant nodes.