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

arXiv:0709.4539 · Physical Review A

Distributed quantum computation based on small quantum registers

Liang Jiang, Jacob M. Taylor, Anders Søndberg Sørensen, Mikhail D. Lukin

Published Dec 26, 2007• 339 citations
arXivHTMLPDF

Abstract

We describe and analyze an efficient register-based hybrid quantum computation scheme. Our scheme is based on a probabilistic, heralded optical connection among local five-qubit quantum registers. We assume high-fidelity local unitary operations within each register, but the error probability for initialization, measurement, and entanglement generation can be very high $(\ensuremath{\sim}5%)$. We demonstrate that with a reasonable time overhead our scheme can achieve deterministic nonlocal coupling gates between arbitrary two registers with very high fidelity, limited only by the imperfections from the local unitary operation. We estimate the clock cycle and the effective error probability for implementation of quantum registers with ion traps or nitrogen-vacancy centers. Our scheme capitalizes on an efficient two-level pumping scheme that in principle can create Bell pairs with arbitrarily high fidelity. We introduce a Markov chain model to study the stochastic process of entanglement pumping and map it onto a deterministic process. Finally we discuss requirements for achieving fault-tolerant operation with our register-based hybrid scheme and also present an alternative approach to fault-tolerant preparation of Greenberger-Horne-Zeilinger states.

DOI
10.1103/physreva.76.062323

Related papers

SCALABLE QUANTUM NETWORKS BASED ON FEW-QUBIT REGISTERS

Liang Jiang, Jacob M. Taylor, Anders Søndberg Sørensen +1 more

We describe and analyze a hybrid approach to scalable quantum computation based on an optically connected network of few-qubit quantum registers. We show that probabilistically connected five-qubit quantum registers suffice for deterministic, fault-tolerant quantum computation even when state preparation, measurement, and entanglement generation all have substantial errors. We discuss requirements for achieving fault-tolerant operation for two specific implementations of our approach.

arXiv:quant-ph/0703029•International Journal of Quantum Information•Feb 1, 2010•11 citations

Efficient high-fidelity quantum computation using matter qubits and linear optics

S. D. Barrett, Pieter Kok

We propose a practical, scalable, and efficient scheme for quantum computation using spatially separated matter qubits and single-photon interference effects. The qubit systems can be nitrogen-vacancy centers in diamond, Pauli-blockade quantum dots with an excess electron, or trapped ions with optical transitions, which are each placed in a cavity and subsequently entangled using a double-heralded single-photon detection scheme. The fidelity of the resulting entanglement is extremely robust against the most important errors such as detector loss, spontaneous emission, and mismatch of cavity parameters. We demonstrate how this entangling operation can be used to efficiently generate cluster states of many qubits, which, together with single-qubit operations and readout, can be used to implement universal quantum computation. Existing experimental parameters indicate that high-fidelity clusters can be generated with a moderate constant overhead.

arXiv:quant-ph/0408040•Physical Review A•Jun 24, 2005•624 citations

Nearly deterministic Bell measurement with multiphoton entanglement for efficient quantum-information processing

Seung-Woo Lee, Ki-min Park B, Timothy C. Ralph +1 more

We present a detailed analysis of the Bell measurement scheme proposed in Lee et al. [Phys. Rev. Lett. 114, 113603 (2015)] based on a logical qubit using Greenberger-Horne-Zeilinger entanglement of photons. The success probability of the proposed Bell measurement can be made arbitrarily high using only linear optics as the number of photons in a logical qubit increases. We compare our scheme with all the other proposals, using single-photon qubits, coherent-state qubits, or hybrid qubits, suggested to enhance the efficiency of the Bell measurement. As a remarkable advantage, our scheme requires only photon on-off measurements, while photon number resolving detectors are necessary for all the other proposals. We find that the scheme based on coherent-state qubits shows the best performance with respect to the attained success probability in terms of the average number of photons used in the process, while our scheme outperforms the schemes using single-photon qubits. We finally show that efficient quantum communication and fault-tolerant quantum computation can be realized using our approach.

arXiv:1510.03142•Physical Review A•Nov 19, 2015•20 citations

Fusion-based quantum computation

Sara Bartolucci, Patrick M. Birchall, Héctor Bombín +10 more

The standard primitives of quantum computing include deterministic unitary entangling gates, which are not natural operations in many systems including photonics. Here, we present fusion-based quantum computation, a model for fault tolerant quantum computing constructed from physical primitives readily accessible in photonic systems. These are entangling measurements, called fusions, which are performed on the qubits of small constant sized entangled resource states. Probabilistic photonic gates as well as errors are directly dealt with by the quantum error correction protocol. We show that this computational model can achieve a higher threshold than schemes reported in literature. We present a ballistic scheme which can tolerate a 10.4% probability of suffering photon loss in each fusion, which corresponds to a 2.7% probability of loss of each individual photon. The architecture is also highly modular and has reduced classical processing requirements compared to previous photonic quantum computing architectures.

arXiv:2101.09310•Nature Communications•Feb 17, 2023•379 citations

High-Probability Heralded Entanglement via Repeated Spin-Photon Phase Encoding with Moderate Cooperativity

Yu Liu, Martin B. Plenio

We propose a heralded high-probability scheme to generate remote entanglement between moderate-cooperativity spin-cavity registers with high fidelity. In conventional single-shot interfaces, limited cooperativity restricts the spin-conditional optical response and thus strongly suppresses the success probability. Our proposal instead recycles a single incident photon for repeated interactions with the spin-cavity register, such that a small spin-conditional phase shift acquired on each round trip accumulates coherently to enable remote entanglement. Moreover, the repeated scheme enables higher spin-photon encoding efficiency by using a spectral-width-scaling photon pulse with a shorter duration. We show that, for realistic imperfections and losses, this repeated phase-encoding approach produces high-fidelity entangled states with an appreciable success probability even at cooperativity $C\sim1$. Our protocol is particularly well suited to weakly coupled, cavity-based solid-state spin platforms and provides a route toward hybrid, photon-loss-tolerant distributed quantum computing.

quant-pharXiv:2602.08834•Feb 10, 2026•0 citations

Architectural Approaches to Fault-Tolerant Distributed Quantum Computing and Their Entanglement Overheads

Nitish Kumar Chandra, Eneet Kaur, Kaushik P. Seshadreesan

Fault tolerant quantum computation over distributed quantum computing (DQC) platforms requires careful evaluation of resource requirements and noise thresholds. As quantum hardware advances toward modular and networked architectures, various fault tolerant DQC schemes have been proposed, which can be broadly categorized into three architectural types. Type 1 architectures consist of small quantum nodes connected via Greenberger-Horne-Zeilinger (GHZ) states, enabling nonlocal stabilizer measurements. Type 2 architectures distribute a large error correcting code block across multiple modules, with most stabilizer measurements remaining local, except for a small subset at patch boundaries that are performed using nonlocal CNOT gates. Type 3 architectures assign code blocks to distinct modules and can perform fault tolerant operations such as transversal gates, lattice surgery, and teleportation to implement logical operations between code blocks. Using the planar surface code and toric code as representative examples, we analyze how the resource requirements, particularly the number of Bell pairs and the average number of generation attempts, scale with increasing code distance across different architectural designs. This analysis provides valuable insights for identifying architectures well suited to fault tolerant distributed quantum computation under near term hardware and resource constraints.

quant-pharXiv:2511.13657•IEEE International Conference on Trust, Privacy and Security in Intelligent Systems and Applications (TPS-ISA)•Nov 18, 2025•1 citation
We describe and analyze an efficient register-based hybrid quantum computation scheme. Our scheme is based on a probabilistic, heralded optical connection among local five-qubit quantum registers. We assume high-fidelity local unitary operations within each register, but the error probability for initialization, measurement, and entanglement generation can be very high (\ensuremath∼5(\ensuremath{\sim}5%)(\ensuremath∼5. We demonstrate that with a reasonable time overhead our scheme can achieve deterministic nonlocal coupling gates between arbitrary two registers with very high fidelity, limited only by the imperfections from the local unitary operation. We estimate the clock cycle and the effective error probability for implementation of quantum registers with ion traps or nitrogen-vacancy centers. Our scheme capitalizes on an efficient two-level pumping scheme that in principle can create Bell pairs with arbitrarily high fidelity. We introduce a Markov chain model to study the stochastic process of entanglement pumping and map it onto a deterministic process. Finally we discuss requirements for achieving fault-tolerant operation with our register-based hybrid scheme and also present an alternative approach to fault-tolerant preparation of Greenberger-Horne-Zeilinger states.
We propose a practical, scalable, and efficient scheme for quantum computation using spatially separated matter qubits and single-photon interference effects. The qubit systems can be nitrogen-vacancy centers in diamond, Pauli-blockade quantum dots with an excess electron, or trapped ions with optical transitions, which are each placed in a cavity and subsequently entangled using a double-heralded single-photon detection scheme. The fidelity of the resulting entanglement is extremely robust against the most important errors such as detector loss, spontaneous emission, and mismatch of cavity parameters. We demonstrate how this entangling operation can be used to efficiently generate cluster states of many qubits, which, together with single-qubit operations and readout, can be used to implement universal quantum computation. Existing experimental parameters indicate that high-fidelity clusters can be generated with a moderate constant overhead.
We present a detailed analysis of the Bell measurement scheme proposed in Lee et al. [Phys. Rev. Lett. 114, 113603 (2015)] based on a logical qubit using Greenberger-Horne-Zeilinger entanglement of photons. The success probability of the proposed Bell measurement can be made arbitrarily high using only linear optics as the number of photons in a logical qubit increases. We compare our scheme with all the other proposals, using single-photon qubits, coherent-state qubits, or hybrid qubits, suggested to enhance the efficiency of the Bell measurement. As a remarkable advantage, our scheme requires only photon on-off measurements, while photon number resolving detectors are necessary for all the other proposals. We find that the scheme based on coherent-state qubits shows the best performance with respect to the attained success probability in terms of the average number of photons used in the process, while our scheme outperforms the schemes using single-photon qubits. We finally show that efficient quantum communication and fault-tolerant quantum computation can be realized using our approach.
The standard primitives of quantum computing include deterministic unitary entangling gates, which are not natural operations in many systems including photonics. Here, we present fusion-based quantum computation, a model for fault tolerant quantum computing constructed from physical primitives readily accessible in photonic systems. These are entangling measurements, called fusions, which are performed on the qubits of small constant sized entangled resource states. Probabilistic photonic gates as well as errors are directly dealt with by the quantum error correction protocol. We show that this computational model can achieve a higher threshold than schemes reported in literature. We present a ballistic scheme which can tolerate a 10.4% probability of suffering photon loss in each fusion, which corresponds to a 2.7% probability of loss of each individual photon. The architecture is also highly modular and has reduced classical processing requirements compared to previous photonic quantum computing architectures.
We propose a heralded high-probability scheme to generate remote entanglement between moderate-cooperativity spin-cavity registers with high fidelity. In conventional single-shot interfaces, limited cooperativity restricts the spin-conditional optical response and thus strongly suppresses the success probability. Our proposal instead recycles a single incident photon for repeated interactions with the spin-cavity register, such that a small spin-conditional phase shift acquired on each round trip accumulates coherently to enable remote entanglement. Moreover, the repeated scheme enables higher spin-photon encoding efficiency by using a spectral-width-scaling photon pulse with a shorter duration. We show that, for realistic imperfections and losses, this repeated phase-encoding approach produces high-fidelity entangled states with an appreciable success probability even at cooperativity C∼1C\sim1C∼1. Our protocol is particularly well suited to weakly coupled, cavity-based solid-state spin platforms and provides a route toward hybrid, photon-loss-tolerant distributed quantum computing.
Fault tolerant quantum computation over distributed quantum computing (DQC) platforms requires careful evaluation of resource requirements and noise thresholds. As quantum hardware advances toward modular and networked architectures, various fault tolerant DQC schemes have been proposed, which can be broadly categorized into three architectural types. Type 1 architectures consist of small quantum nodes connected via Greenberger-Horne-Zeilinger (GHZ) states, enabling nonlocal stabilizer measurements. Type 2 architectures distribute a large error correcting code block across multiple modules, with most stabilizer measurements remaining local, except for a small subset at patch boundaries that are performed using nonlocal CNOT gates. Type 3 architectures assign code blocks to distinct modules and can perform fault tolerant operations such as transversal gates, lattice surgery, and teleportation to implement logical operations between code blocks. Using the planar surface code and toric code as representative examples, we analyze how the resource requirements, particularly the number of Bell pairs and the average number of generation attempts, scale with increasing code distance across different architectural designs. This analysis provides valuable insights for identifying architectures well suited to fault tolerant distributed quantum computation under near term hardware and resource constraints.