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

Quantum 2.0 Conference and Exhibition

Tree Cluster State Generation using Percolation

Ashlesha Patil, Saikat Guha

Published Jan 1, 2023• 1 citation
Publisher

Abstract

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.

DOI
10.1364/quantum.2023.qth4a.3

Related papers

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

An Improved Design for All-Photonic Quantum Repeaters

Ashlesha Patil, Saikat Guha

All-photonic quantum repeaters use multi-qubit photonic graph states, called repeater graph states (RGS), instead of matter-based quantum memories, for protection against predominantly loss errors. The RGS comprises tree-graph-encoded logical qubits for error correction at the repeaters and physical {\em link} qubits to create entanglement between neighboring repeaters. The two methods to generate the RGS are probabilistic stitching -- using linear optical Bell state measurements (fusion) -- of small entangled states prepared via multiplexed-probabilistic linear optical circuits fed with single photons, and a direct deterministic preparation using a small number of quantum-logic-capable solid-state emitters. The resource overhead due to fusions and the circuit depth of the quantum emitter system both increase with the size of the RGS. Therefore engineering a resource-efficient RGS is crucial. We propose a new RGS design, which achieves a higher entanglement rate for all-photonic quantum repeaters using fewer qubits than the previously known RGS would. We accomplish this by boosting the probability of entangling neighboring repeaters with tree-encoded link qubits. We also propose a new adaptive scheme to perform logical BSM on the link qubits for loss-only errors. The adaptive BSM outperforms the previous schemes for logical BSM on tree codes when the qubit loss probability is uniform. It reduces the number of optical modes required to perform logical BSM on link qubits to improve the entanglement rate further.

arXiv:2405.11768•May 20, 2024•10 citations

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

Hussain Zaidi, Chris Dawson, Peter van Loock +1 more

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.

arXiv:1410.3753•Physical Review A•Apr 1, 2015•28 citations

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

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

Resource-Efficient Topological Fault-Tolerant Quantum Computation with Hybrid Entanglement of Light

S. Omkar, Yong Siah Teo, Hyunseok Jeong

We propose an all-linear-optical scheme to ballistically generate a cluster state for measurement-based topological fault-tolerant quantum computation using hybrid photonic qubits entangled in a continuous-discrete domain. Availability of near-deterministic Bell-state measurements on hybrid qubits is exploited for this purpose. In the presence of photon losses, we show that our scheme leads to a significant enhancement in both tolerable photon-loss rate and resource overheads. More specifically, we report a photon-loss threshold of $\ensuremath{\sim}3.3\ifmmode\times\else\texttimes\fi{}{10}^{\ensuremath{-}3}$, which is higher than those of known optical schemes under a reasonable error model. Furthermore, resource overheads to achieve logical error rate of ${10}^{\ensuremath{-}6}({10}^{\ensuremath{-}15})$ is estimated to be $\ensuremath{\sim}8.5\ifmmode\times\else\texttimes\fi{}{10}^{5}(1.7\ifmmode\times\else\texttimes\fi{}{10}^{7})$, which is significantly less by multiple orders of magnitude compared to other reported values in the literature.

arXiv:1906.04864•Physical Review Letters•Aug 4, 2020•50 citations
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.
All-photonic quantum repeaters use multi-qubit photonic graph states, called repeater graph states (RGS), instead of matter-based quantum memories, for protection against predominantly loss errors. The RGS comprises tree-graph-encoded logical qubits for error correction at the repeaters and physical {\em link} qubits to create entanglement between neighboring repeaters. The two methods to generate the RGS are probabilistic stitching -- using linear optical Bell state measurements (fusion) -- of small entangled states prepared via multiplexed-probabilistic linear optical circuits fed with single photons, and a direct deterministic preparation using a small number of quantum-logic-capable solid-state emitters. The resource overhead due to fusions and the circuit depth of the quantum emitter system both increase with the size of the RGS. Therefore engineering a resource-efficient RGS is crucial. We propose a new RGS design, which achieves a higher entanglement rate for all-photonic quantum repeaters using fewer qubits than the previously known RGS would. We accomplish this by boosting the probability of entangling neighboring repeaters with tree-encoded link qubits. We also propose a new adaptive scheme to perform logical BSM on the link qubits for loss-only errors. The adaptive BSM outperforms the previous schemes for logical BSM on tree codes when the qubit loss probability is uniform. It reduces the number of optical modes required to perform logical BSM on link qubits to improve the entanglement rate further.
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.
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 propose an all-linear-optical scheme to ballistically generate a cluster state for measurement-based topological fault-tolerant quantum computation using hybrid photonic qubits entangled in a continuous-discrete domain. Availability of near-deterministic Bell-state measurements on hybrid qubits is exploited for this purpose. In the presence of photon losses, we show that our scheme leads to a significant enhancement in both tolerable photon-loss rate and resource overheads. More specifically, we report a photon-loss threshold of $\ensuremath{\sim}3.3\ifmmode\times\else\texttimes\fi{}{10}^{\ensuremath{-}3}$, which is higher than those of known optical schemes under a reasonable error model. Furthermore, resource overheads to achieve logical error rate of ${10}^{\ensuremath{-}6}({10}^{\ensuremath{-}15})$ is estimated to be $\ensuremath{\sim}8.5\ifmmode\times\else\texttimes\fi{}{10}^{5}(1.7\ifmmode\times\else\texttimes\fi{}{10}^{7})$, which is significantly less by multiple orders of magnitude compared to other reported values in the literature.