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:1410.3753 · Physical Review A

Near-deterministic creation of universal cluster states with probabilistic Bell measurements and three-qubit resource states

Hussain Zaidi, Chris Dawson, Peter van Loock, Terry Rudolph

Published Apr 1, 2015• 28 citations
arXivHTMLPDF

Abstract

We develop a scheme for generating a universal qubit cluster state using probabilistic Bell measurements without the need for feed-forward. Borrowing ideas from percolation theory, we numerically show that using unambiguous Bell measurements that succeed with 75% success probability one could build a cluster state with an underlying pyrochlore geometry such that the probability of having a spanning cluster approaches unity in the limit of infinite lattice size. The initial resources required for the generation of a universal state in our protocol are three-qubit cluster states that are within experimental reach and are a minimal resource for a Bell-measurement-based percolation proposal. Since single and multiphoton losses can be detected in Bell measurements, our protocol raises the prospect of a fully error-robust scheme.

DOI
10.1103/physreva.91.042301

Related papers

Percolation thresholds for photonic quantum computing

Mihir Pant, Don Towsley, Dirk Robert Englund +1 more

Despite linear-optical fusion (Bell measurement) being probabilistic, photonic cluster states for universal quantum computation can be prepared without feed-forward by fusing small n-photon entangled clusters, if the success probability of each fusion attempt is above a threshold, [Formula: see text]. We prove a general bound [Formula: see text], and develop a conceptual method to construct long-range-connected clusters where [Formula: see text] becomes the bond percolation threshold of a logical graph. This mapping lets us find constructions that require lower fusion success probabilities than currently known, and settle a heretofore open question by showing that a universal cluster state can be created by fusing 3-photon clusters over a 2D lattice with a fusion success probability that is achievable with linear optics and single photons, making this attractive for integrated-photonic realizations.

arXiv:1701.03775•Nature Communications•Mar 6, 2019•85 citations

Tree Cluster State Generation using Percolation

Ashlesha Patil, Saikat Guha

Tree codes are highly coveted states for error correction against photon loss in all-photonic architectures. The linear optical (LO) method to prepare these states results in huge resource overheads as the LO Bell state measurement used to generate the states is probabilistic in nature. In this paper, we propose a percolation-based method inspired by state preparation for measurement-based quantum computation to deterministically generate infinite tree states as long as photon loss probability is up to 12% if the LO BSM success probability is 75%. This method greatly reduces the resource overhead by getting rid of the need for multiplexing. Smaller tree states used for applications such as all-photonic quantum repeater can be constructed from the large tree by performing Pauli-Z measurements on some of its qubits.

Quantum 2.0 Conference and Exhibition•Jan 1, 2023•1 citation

Generating redundantly encoded resource states for photonic quantum computing

Samuel J. Sheldon, Pieter Kok

Measurement-based quantum computing relies on the generation of large entangled cluster states that act as a universal resource on which logical circuits can be imprinted and executed through local measurements. A number of strategies for constructing sufficiently large photonic cluster states propose fusing many smaller resource states generated by a series of quantum emitters. However, the fusion process is inherently probabilistic with a 50% success probability in standard guise. A recent proposal has shown that, in the limit of low loss, the probability of achieving successful fusion may be boosted to near unity by redundantly encoding the vertices of linear graph states using Greenberger-Horne-Zeilinger states [Quantum 7, 992 (2023)]. Here we present a protocol for deterministically generating redundantly encoded photonic resource states using single quantum emitters, and study the impact of protocol errors and photonic losses on the generated resource states and type-II photonic fusion. Our work provides a route for efficiently constructing complex entangled photonic qubit states for photonic quantum computing and quantum repeaters.

quant-pharXiv:2512.03131•Dec 4, 2025•2 citations

Physical-depth architectural requirements for generating universal photonic cluster states

Sam Morley-Short, Sara Bartolucci, Mercedes Gimeno-Segovia +3 more

Most leading proposals for linear-optical quantum computing (LOQC) use cluster states, which act as a universal resource for measurement-based (one-way) quantum computation. In ballistic approaches to LOQC, cluster states are generated passively from small entangled resource states using so-called fusion operations. Results from percolation theory have previously been used to argue that universal cluster states can be generated in the ballistic approach using schemes which exceed the critical threshold for percolation, but these results consider cluster states with unbounded size. Here we consider how successful percolation can be maintained using a physical architecture with fixed physical depth, assuming that the cluster state is continuously generated and measured, and therefore that only a finite portion of it is visible at any one point in time. We show that universal LOQC can be implemented using a constant-size device with modest physical depth, and that percolation can be exploited using simple pathfinding strategies without the need for high-complexity algorithms.

arXiv:1706.07325•Quantum Science and Technology•Oct 5, 2017•26 citations

High-efficiency cluster-state generation with atomic ensembles via the dipole-blockade mechanism

Marcin Zwierz, Pieter Kok

We demonstrate theoretically a scheme for cluster-state generation, based on atomic ensembles and the dipole-blockade mechanism. In the protocol, atomic ensembles serve as single-qubit systems. Therefore, we review single-qubit operations on qubit defined as collective states of atomic ensemble. Our entangling protocol requires nearly identical single-photon sources, one ultracold ensemble per physical qubit, and regular photodetectors. The general entangling procedure is presented, as well as a procedure that generates in a single step $Q$-qubit GHZ states with success probability ${p}_{\text{success}}\ensuremath{\sim}{\ensuremath{\eta}}^{Q∕2}$, where $\ensuremath{\eta}$ is the combined detection and source efficiency. This is significantly more efficient than any known robust probabilistic entangling operation. GHZ states form the basic building block for universal cluster states, a resource for the one-way quantum computer.

arXiv:0807.3645•Physical Review A•Feb 4, 2009•26 citations

Percolation-based architecture for cluster state creation using photon-mediated entanglement between atomic memories

Hyeongrak Choi, Mihir Pant, Saikat Guha +1 more

Abstract A central challenge for many quantum technologies concerns the generation of large entangled states of individually addressable quantum memories. Here, we show that percolation theory allows the rapid generation of arbitrarily large graph states by heralding the entanglement in a lattice of atomic memories with single-photon detection. This approach greatly reduces the time required to produce large cluster states for quantum information processing including universal one-way quantum computing. This reduction puts our architecture in an operational regime where demonstrated coupling, collection, detection efficiencies, and coherence time are sufficient. The approach also dispenses the need for time-consuming feed-forward, high cooperativity interfaces and ancilla single photons, and can tolerate a high rate of site imperfections. We derive the minimum coherence time to scalably create large cluster states, as a function of photon-collection efficiency. We also propose a variant of the architecture with long-range connections, which is even more resilient to site yields. We analyze our architecture for nitrogen vacancy (NV) centers in diamond, but the approach applies to any atomic or atom-like systems.

arXiv:1704.07292•npj Quantum Information•Nov 22, 2019•68 citations
We develop a scheme for generating a universal qubit cluster state using probabilistic Bell measurements without the need for feed-forward. Borrowing ideas from percolation theory, we numerically show that using unambiguous Bell measurements that succeed with 75% success probability one could build a cluster state with an underlying pyrochlore geometry such that the probability of having a spanning cluster approaches unity in the limit of infinite lattice size. The initial resources required for the generation of a universal state in our protocol are three-qubit cluster states that are within experimental reach and are a minimal resource for a Bell-measurement-based percolation proposal. Since single and multiphoton losses can be detected in Bell measurements, our protocol raises the prospect of a fully error-robust scheme.
Despite linear-optical fusion (Bell measurement) being probabilistic, photonic cluster states for universal quantum computation can be prepared without feed-forward by fusing small n-photon entangled clusters, if the success probability of each fusion attempt is above a threshold, [Formula: see text]. We prove a general bound [Formula: see text], and develop a conceptual method to construct long-range-connected clusters where [Formula: see text] becomes the bond percolation threshold of a logical graph. This mapping lets us find constructions that require lower fusion success probabilities than currently known, and settle a heretofore open question by showing that a universal cluster state can be created by fusing 3-photon clusters over a 2D lattice with a fusion success probability that is achievable with linear optics and single photons, making this attractive for integrated-photonic realizations.
Tree codes are highly coveted states for error correction against photon loss in all-photonic architectures. The linear optical (LO) method to prepare these states results in huge resource overheads as the LO Bell state measurement used to generate the states is probabilistic in nature. In this paper, we propose a percolation-based method inspired by state preparation for measurement-based quantum computation to deterministically generate infinite tree states as long as photon loss probability is up to 12% if the LO BSM success probability is 75%. This method greatly reduces the resource overhead by getting rid of the need for multiplexing. Smaller tree states used for applications such as all-photonic quantum repeater can be constructed from the large tree by performing Pauli-Z measurements on some of its qubits.
Measurement-based quantum computing relies on the generation of large entangled cluster states that act as a universal resource on which logical circuits can be imprinted and executed through local measurements. A number of strategies for constructing sufficiently large photonic cluster states propose fusing many smaller resource states generated by a series of quantum emitters. However, the fusion process is inherently probabilistic with a 50% success probability in standard guise. A recent proposal has shown that, in the limit of low loss, the probability of achieving successful fusion may be boosted to near unity by redundantly encoding the vertices of linear graph states using Greenberger-Horne-Zeilinger states [Quantum 7, 992 (2023)]. Here we present a protocol for deterministically generating redundantly encoded photonic resource states using single quantum emitters, and study the impact of protocol errors and photonic losses on the generated resource states and type-II photonic fusion. Our work provides a route for efficiently constructing complex entangled photonic qubit states for photonic quantum computing and quantum repeaters.
Most leading proposals for linear-optical quantum computing (LOQC) use cluster states, which act as a universal resource for measurement-based (one-way) quantum computation. In ballistic approaches to LOQC, cluster states are generated passively from small entangled resource states using so-called fusion operations. Results from percolation theory have previously been used to argue that universal cluster states can be generated in the ballistic approach using schemes which exceed the critical threshold for percolation, but these results consider cluster states with unbounded size. Here we consider how successful percolation can be maintained using a physical architecture with fixed physical depth, assuming that the cluster state is continuously generated and measured, and therefore that only a finite portion of it is visible at any one point in time. We show that universal LOQC can be implemented using a constant-size device with modest physical depth, and that percolation can be exploited using simple pathfinding strategies without the need for high-complexity algorithms.
We demonstrate theoretically a scheme for cluster-state generation, based on atomic ensembles and the dipole-blockade mechanism. In the protocol, atomic ensembles serve as single-qubit systems. Therefore, we review single-qubit operations on qubit defined as collective states of atomic ensemble. Our entangling protocol requires nearly identical single-photon sources, one ultracold ensemble per physical qubit, and regular photodetectors. The general entangling procedure is presented, as well as a procedure that generates in a single step QQQ-qubit GHZ states with success probability ${p}_{\text{success}}\ensuremath{\sim}{\ensuremath{\eta}}^{Q∕2}$, where $\ensuremath{\eta}$ is the combined detection and source efficiency. This is significantly more efficient than any known robust probabilistic entangling operation. GHZ states form the basic building block for universal cluster states, a resource for the one-way quantum computer.
Abstract A central challenge for many quantum technologies concerns the generation of large entangled states of individually addressable quantum memories. Here, we show that percolation theory allows the rapid generation of arbitrarily large graph states by heralding the entanglement in a lattice of atomic memories with single-photon detection. This approach greatly reduces the time required to produce large cluster states for quantum information processing including universal one-way quantum computing. This reduction puts our architecture in an operational regime where demonstrated coupling, collection, detection efficiencies, and coherence time are sufficient. The approach also dispenses the need for time-consuming feed-forward, high cooperativity interfaces and ancilla single photons, and can tolerate a high rate of site imperfections. We derive the minimum coherence time to scalably create large cluster states, as a function of photon-collection efficiency. We also propose a variant of the architecture with long-range connections, which is even more resilient to site yields. We analyze our architecture for nitrogen vacancy (NV) centers in diamond, but the approach applies to any atomic or atom-like systems.