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

Finds and Results from the Swedish Cyprus Expedition: A Gender Perspective at the Medelhavsmuseet

Distributed quantum computation, A measurement-based approach

Ellie D’Hondt

Published Jan 1, 2005• 23 citations
OpenAlex

Related papers

Distributed Quantum Computations

Ming‐Xing Luo

Springer eBooks•Jan 1, 2024•0 citations

Perhaps they are everywhere? Undetectable distributed quantum computation and communication for alien civilizations can be established using thermal light from stars

Terry Rudolph

We show that free-space diffraction of photons distributes highly useful entanglement: the receivers of the propagated modes can do a distributed quantum computation using only linear optics and photon counting. The distributed computation requires classical communication between receivers, however, similar to standard measurement-based computation, that communication is of purely random outcomes and so can be indistinguishable from noise. The speculation in the title arises from the further observation that the natural way for a circumspect civilization to hide their photonic entanglement distribution is to use the thermal light already being emitted from the various stars they visit. This requires them knowing the number of photons in the modes they have chosen to use, and as such they would need to perform a quantum non-demolition measurement of photon number. Because the thermal light they are measuring is diagonal in the number basis even this process can be rendered in principle indiscernible to those of us excluded from the conversation.

arXiv:2107.13023•Jul 27, 2021•1 citation

Measurement-based quantum computation

Hans J. Briegel, Dan E. Browne, Wolfgang Dür +2 more

arXiv:0910.1116•Nature Physics•Jan 1, 2009•1,087 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•6 citations

Asymmetry-aided measurement-based quantum repeaters and distributed quantum computing with a decoder-free client

Wooyeong Song, Sungyeon Kook, Wonhyuk Lee +1 more

Distributed quantum computation needs to move logical qubits across lossy optical links, yet this transmission layer is usually designed separately from the computation it serves. We treat the two together by recognizing that a measurement-based quantum repeater is a two-dimensional code foliated along the transmission axis, so that the dominant channel loss is concentrated on the transmitted sector while the locally measured qubits are largely spared. Matching a code's distance to this structural asymmetry, we show that a rectangular Bacon-Shor subsystem code transmits a logical qubit markedly more efficiently than transmission-unaware encodings. Over continental distances, its cost-optimal repeater density is about an order of magnitude lower than that of a recent $[[48,6,8]]$ benchmark at comparable transmission rate, and roughly half that of a symmetric code of equal size. Moreover, we extend the framework to a central-to-client round trip in which a code-level, distance-preserving code switch joins the transmission legs to the client's computation, and joint decoding of the heterogeneous syndrome record at the central node lets distributed quantum computation proceed with a decoder-free client.

quant-pharXiv:2607.11238•Jul 14, 2026•0 citations

Distributed Quantum Computing

Harry Buhrman, Hein Röhrig

Lecture notes in computer science•Jan 1, 2003•95 citations
We show that free-space diffraction of photons distributes highly useful entanglement: the receivers of the propagated modes can do a distributed quantum computation using only linear optics and photon counting. The distributed computation requires classical communication between receivers, however, similar to standard measurement-based computation, that communication is of purely random outcomes and so can be indistinguishable from noise. The speculation in the title arises from the further observation that the natural way for a circumspect civilization to hide their photonic entanglement distribution is to use the thermal light already being emitted from the various stars they visit. This requires them knowing the number of photons in the modes they have chosen to use, and as such they would need to perform a quantum non-demolition measurement of photon number. Because the thermal light they are measuring is diagonal in the number basis even this process can be rendered in principle indiscernible to those of us excluded from the conversation.
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.
Distributed quantum computation needs to move logical qubits across lossy optical links, yet this transmission layer is usually designed separately from the computation it serves. We treat the two together by recognizing that a measurement-based quantum repeater is a two-dimensional code foliated along the transmission axis, so that the dominant channel loss is concentrated on the transmitted sector while the locally measured qubits are largely spared. Matching a code's distance to this structural asymmetry, we show that a rectangular Bacon-Shor subsystem code transmits a logical qubit markedly more efficiently than transmission-unaware encodings. Over continental distances, its cost-optimal repeater density is about an order of magnitude lower than that of a recent [[48,6,8]][[48,6,8]][[48,6,8]] benchmark at comparable transmission rate, and roughly half that of a symmetric code of equal size. Moreover, we extend the framework to a central-to-client round trip in which a code-level, distance-preserving code switch joins the transmission legs to the client's computation, and joint decoding of the heterogeneous syndrome record at the central node lets distributed quantum computation proceed with a decoder-free client.