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:1306.4062

Success rates for linear optical generation of cluster states in coincidence basis

Dmitry B. Uskov, Paul M. Alsing, Michael L. Fanto, Lev Kaplan, A. Matthew Smith

Published Jun 18, 2013• 1 citation
arXivHTMLPDF

Abstract

We report on theoretical research in photonic cluster-state computing. Finding optimal schemes of generating non-classical photonic states is of critical importance for this field as physically implementable photon-photon entangling operations are currently limited to measurement-assisted stochastic transformations. A critical parameter for assessing the efficiency of such transformations is the success probability of a desired measurement outcome. At present there are several experimental groups which are capable of generating multi-photon cluster states carrying more than eight qubits. Separate photonic qubits or small clusters can be fused into a single cluster state by a probabilistic optical CZ gate conditioned on simultaneous detection of all photons with 1/9 success probability of each gate. This design mechanically follows the original theoretical scheme of cluster state generation proposed more than a decade ago by Raussendorf, Browne and Briegel. The optimality of the destructive CZ gate in application to linear optical cluster state generation has not been analyzed previously. Our results reveal that this method is far from the optimal one. Employing numerical optimization we have identified that maximal success probability of fusing n unentangled dual-rail optical qubits into a linear cluster state is equal to 1/2^(n-1); m-tuple of photonic Bell pair states, commonly generated via spontaneous parametric down-conversion, can be fused into a single cluster with the maximal success probability of 1/4^(m-1).

DOI
10.48550/arxiv.1306.4062

Related papers

Resource-efficient generation of linear cluster states by linear optics with postselection

Dmitry B. Uskov, Paul M. Alsing, Michael L. Fanto +4 more

Abstract We report on theoretical research in photonic cluster-state computing. Finding optimal schemes of generating non-classical photonic states is of critical importance for this field as physically implementable photon–photon entangling operations are currently limited to measurement-assisted stochastic transformations. A critical parameter for assessing the efficiency of such transformations is the success probability of a desired measurement outcome. At present there are several experimental groups that are capable of generating multi-photon cluster states carrying more than eight qubits. Separate photonic qubits or small clusters can be fused into a single cluster state by a probabilistic optical CZ gate conditioned on simultaneous detection of all photons with 1/9 success probability for each gate. This design mechanically follows the original theoretical scheme of cluster state generation proposed more than a decade ago by Raussendorf, Browne and Briegel. The optimality of the destructive CZ gate in application to linear optical cluster state generation has not been analyzed previously. Our results reveal that this method is far from the optimal one. Employing numerical optimization we have identified that the maximal success probability of fusing n unentangled dual-rail optical qubits into a linear cluster state is equal to an m -tuple of photonic Bell pair states, commonly generated via spontaneous parametric down-conversion, can be fused into a single cluster with the maximal success probability of (1/4) m −1 .

Journal of Physics B Atomic Molecular and Optical Physics•Jan 30, 2015•6 citations

Optimal Fusion Transformations for Linear Optical Cluster State Generation

Dmitry B. Uskov, Pavel Lougovski, Paul M. Alsing +3 more

We analyze the generation of linear optical cluster states (LOCS) via addition of one and two qubits. Existing approaches employ the stochastic linear optical two-qubit CZ gate with success rate of 1/9 per fusion operation. The question of optimality of the CZ gate with respect to LOCS generation remains open. We report that there are alternative schemes to the CZ gate that are exponentially more efficient and show that sequential LOCS growth is globally optimal. We find that the optimal cluster growth operation is a state transformation on a subspace of the full Hilbert space. We show that the maximal success rate of fusing n photonic qubits or m Bell pairs is 1/2^n-1 and 1/4^m-1 respectively and give an explicit optical design.

arXiv:1407.6055•Jul 22, 2014•1 citation

Optimal mode transformations for linear-optical cluster-state generation

Dmitry B. Uskov, Pavel Lougovski, Paul M. Alsing +3 more

We analyze the generation of linear-optical cluster states (LOCSs) via sequential addition of one and two qubits. Existing approaches employ the stochastic linear-optical two-qubit controlled-Z (cz) gate with success rate of $\frac{1}{9}$ per operation. The question of optimality of the cz gate with respect to LOCS generation has remained open. We report that there are alternative schemes to the cz gate that are exponentially more efficient and show that sequential LOCS growth is indeed globally optimal. We find that the optimal cluster growth operation is a state transformation on a subspace of the full Hilbert space. We show that the maximal success rate of postselected entangling $n$ photonic qubits or $m$ Bell pairs into a cluster is ${(\frac{1}{2})}^{n\ensuremath{-}1}$ and ${(\frac{1}{4})}^{m\ensuremath{-}1}$, respectively, with no ancilla photons, and we give an explicit optical description of the optimal mode transformations.

Physical Review A•Jun 15, 2015•4 citations

Experimental generation of a high-fidelity four-photon linear cluster state

Chao Zhang, Yun‐Feng Huang, Bi‐Heng Liu +2 more

Cluster state plays a crucial role in one-way quantum computation. Here, we propose and experimentally demonstrate a scheme to prepare an ultrahigh-fidelity four-photon linear cluster state via a spontaneous parametric down-conversion process. The state fidelity is measured to be $0.9517\ifmmode\pm\else\textpm\fi{}0.0027$. Our scheme can be directly extended to more photons to generate an $N$-qubit linear cluster state. Furthermore, our scheme is optimal for generating photonic linear cluster states in the sense of achieving the maximal success probability and having the simplest strategy. The key idea is that the photon pairs are prepared in some special nonmaximally entangled states instead of the normal Bell states. To generate a $2N$-qubit linear cluster state from $N$ pairs of entangled photons, only $(N\ensuremath{-}1)$ Hong-Ou-Mandel interferences are needed and a success probability of ${(\frac{1}{4})}^{N\ensuremath{-}1}$ is achieved.

arXiv:1610.00232•Physical Review A•Jun 22, 2016•19 citations

Percolation thresholds for photonic quantum computing

Mihir Pant, Don Towsley, Dirk 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•78 citations

Potential and limits to cluster-state quantum computing using probabilistic gates

D. Gross, Konrad Kieling, Jens Eisert

We establish bounds to the necessary resource consumption when building up cluster states for one-way computing using probabilistic gates. Emphasis is put on state preparation with linear optical gates, as the probabilistic character is unavoidable here. We identify rigorous general bounds to the necessary consumption of initially available maximally entangled pairs when building up one-dimensional cluster states with individually acting linear optical quantum gates, entangled pairs, and vacuum modes. As the known linear optics gates have a limited maximum success probability, as we show, this amounts to finding the optimal classical strategy of fusing pieces of linear cluster states. A formal notion of classical configurations and strategies is introduced for probabilistic nonfaulty gates. We study the asymptotic performance of strategies that can be simply described, and prove ultimate bounds to the performance of the globally optimal strategy. The arguments employ methods of random walks and convex optimization. This optimal strategy is also the one that requires the shortest storage time, and necessitates the fewest invocations of probabilistic gates. For two-dimensional cluster states, we find, for any elementary success probability, an essentially deterministic preparation of a cluster state with quadratic, hence optimal, asymptotic scaling in the use of entangled pairs. We also identify a percolation effect in state preparation, in that from a threshold probability on, almost all preparations will be either successful or fail. We outline the implications on linear optical architectures and fault-tolerant computations.

arXiv:quant-ph/0605014•Physical Review A•Oct 31, 2006•63 citations
We report on theoretical research in photonic cluster-state computing. Finding optimal schemes of generating non-classical photonic states is of critical importance for this field as physically implementable photon-photon entangling operations are currently limited to measurement-assisted stochastic transformations. A critical parameter for assessing the efficiency of such transformations is the success probability of a desired measurement outcome. At present there are several experimental groups which are capable of generating multi-photon cluster states carrying more than eight qubits. Separate photonic qubits or small clusters can be fused into a single cluster state by a probabilistic optical CZ gate conditioned on simultaneous detection of all photons with 1/9 success probability of each gate. This design mechanically follows the original theoretical scheme of cluster state generation proposed more than a decade ago by Raussendorf, Browne and Briegel. The optimality of the destructive CZ gate in application to linear optical cluster state generation has not been analyzed previously. Our results reveal that this method is far from the optimal one. Employing numerical optimization we have identified that maximal success probability of fusing n unentangled dual-rail optical qubits into a linear cluster state is equal to 1/2^(n-1); m-tuple of photonic Bell pair states, commonly generated via spontaneous parametric down-conversion, can be fused into a single cluster with the maximal success probability of 1/4^(m-1).
Abstract We report on theoretical research in photonic cluster-state computing. Finding optimal schemes of generating non-classical photonic states is of critical importance for this field as physically implementable photon–photon entangling operations are currently limited to measurement-assisted stochastic transformations. A critical parameter for assessing the efficiency of such transformations is the success probability of a desired measurement outcome. At present there are several experimental groups that are capable of generating multi-photon cluster states carrying more than eight qubits. Separate photonic qubits or small clusters can be fused into a single cluster state by a probabilistic optical CZ gate conditioned on simultaneous detection of all photons with 1/9 success probability for each gate. This design mechanically follows the original theoretical scheme of cluster state generation proposed more than a decade ago by Raussendorf, Browne and Briegel. The optimality of the destructive CZ gate in application to linear optical cluster state generation has not been analyzed previously. Our results reveal that this method is far from the optimal one. Employing numerical optimization we have identified that the maximal success probability of fusing n unentangled dual-rail optical qubits into a linear cluster state is equal to an m -tuple of photonic Bell pair states, commonly generated via spontaneous parametric down-conversion, can be fused into a single cluster with the maximal success probability of (1/4) m −1 .
We analyze the generation of linear optical cluster states (LOCS) via addition of one and two qubits. Existing approaches employ the stochastic linear optical two-qubit CZ gate with success rate of 1/9 per fusion operation. The question of optimality of the CZ gate with respect to LOCS generation remains open. We report that there are alternative schemes to the CZ gate that are exponentially more efficient and show that sequential LOCS growth is globally optimal. We find that the optimal cluster growth operation is a state transformation on a subspace of the full Hilbert space. We show that the maximal success rate of fusing n photonic qubits or m Bell pairs is 1/2^n-1 and 1/4^m-1 respectively and give an explicit optical design.
We analyze the generation of linear-optical cluster states (LOCSs) via sequential addition of one and two qubits. Existing approaches employ the stochastic linear-optical two-qubit controlled-Z (cz) gate with success rate of 19\frac{1}{9}91​ per operation. The question of optimality of the cz gate with respect to LOCS generation has remained open. We report that there are alternative schemes to the cz gate that are exponentially more efficient and show that sequential LOCS growth is indeed globally optimal. We find that the optimal cluster growth operation is a state transformation on a subspace of the full Hilbert space. We show that the maximal success rate of postselected entangling nnn photonic qubits or mmm Bell pairs into a cluster is ${(\frac{1}{2})}^{n\ensuremath{-}1}$ and ${(\frac{1}{4})}^{m\ensuremath{-}1}$, respectively, with no ancilla photons, and we give an explicit optical description of the optimal mode transformations.
Cluster state plays a crucial role in one-way quantum computation. Here, we propose and experimentally demonstrate a scheme to prepare an ultrahigh-fidelity four-photon linear cluster state via a spontaneous parametric down-conversion process. The state fidelity is measured to be $0.9517\ifmmode\pm\else\textpm\fi{}0.0027$. Our scheme can be directly extended to more photons to generate an NNN-qubit linear cluster state. Furthermore, our scheme is optimal for generating photonic linear cluster states in the sense of achieving the maximal success probability and having the simplest strategy. The key idea is that the photon pairs are prepared in some special nonmaximally entangled states instead of the normal Bell states. To generate a 2N2N2N-qubit linear cluster state from NNN pairs of entangled photons, only $(N\ensuremath{-}1)$ Hong-Ou-Mandel interferences are needed and a success probability of ${(\frac{1}{4})}^{N\ensuremath{-}1}$ is achieved.
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.
We establish bounds to the necessary resource consumption when building up cluster states for one-way computing using probabilistic gates. Emphasis is put on state preparation with linear optical gates, as the probabilistic character is unavoidable here. We identify rigorous general bounds to the necessary consumption of initially available maximally entangled pairs when building up one-dimensional cluster states with individually acting linear optical quantum gates, entangled pairs, and vacuum modes. As the known linear optics gates have a limited maximum success probability, as we show, this amounts to finding the optimal classical strategy of fusing pieces of linear cluster states. A formal notion of classical configurations and strategies is introduced for probabilistic nonfaulty gates. We study the asymptotic performance of strategies that can be simply described, and prove ultimate bounds to the performance of the globally optimal strategy. The arguments employ methods of random walks and convex optimization. This optimal strategy is also the one that requires the shortest storage time, and necessitates the fewest invocations of probabilistic gates. For two-dimensional cluster states, we find, for any elementary success probability, an essentially deterministic preparation of a cluster state with quadratic, hence optimal, asymptotic scaling in the use of entangled pairs. We also identify a percolation effect in state preparation, in that from a threshold probability on, almost all preparations will be either successful or fail. We outline the implications on linear optical architectures and fault-tolerant computations.