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

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE

Application of equivalence classes to the efficient construction of cluster states

Gerald N. Gilbert, Michael Hamrick, Yaakov S. Weinstein

Published May 5, 2006• 0 citations
Publisher

Abstract

We demonstrate a method of constructing L-shape cluster states by exploiting equivalence class properties of graph states. The L-shape cluster state is a primitive which can be used to construct cluster states capable of supporting universal quantum computation. The method is device independent but is shown to be considerably more efficient than previously proposed approaches for photonic cluster construction. Two-dimensional photonic cluster states can be efficiently built via local unitaries and type-I fusion only. To allow for a complete calculation of the cost of two-dimensional photonic cluster-state construction, we also provide a recursion relation relating the length of a photonic cluster chain to the average resources required.

DOI
10.1117/12.666118

Related papers

Construction of Cluster States Using Graph State Equivalence Classes

Gerald N. Gilbert, Michael Hamrick, Yaakov S. Weinstein

We demonstrate an efficient method of constructing cluster state primitives by exploiting graph state equivalency class properties. We also present a recursion relation for photonic cluster chain length in terms of average resources required.

International Conference on Quantum Information•Jan 1, 2007•0 citations

Efficient construction of photonic quantum-computational clusters

Gerald N. Gilbert, Michael Hamrick, Yaakov S. Weinstein

We demonstrate a method of creating photonic two-dimensional cluster states that is considerably more efficient than previously proposed approaches. Our method uses only local unitaries and type-I fusion operations. The increased efficiency of our method compared to previously proposed constructions is obtained by identifying and exploiting local equivalence properties inherent in cluster states.

arXiv:quant-ph/0512110•Physical Review A•Jun 19, 2006•39 citations

Fusing imperfect photonic cluster states

Yaakov S. Weinstein

The ability to construct large photonic cluster states capable of supporting universal quantum computation relies on fusing together cluster primitives. These fusion operations are probabilistic and the efficiency of the construction process relies on recycling remains of cluster primitives that have undergone failed fusion attempts. Here I consider the effects of the inevitable decoherence that must arise while storing cluster primitives. First, I explore the case where dephased two-qubit cluster states are the basic resource for the construction of all larger cluster states, all fusion operations are successful, and no further dephasing occurs during the construction process. This allows us to explore how decoherence of the most basic, primitive clusters translates into imperfections of the larger cluster states constructed from them. I then assume that decoherence occurs before every attempted fusion operation and determine the best way to build a five-qubit cluster. This requires including the effects of the fusion operation failures. Fidelity is used as the measure of accuracy for the constructed cluster states. Finally, I include a short discussion of photon loss and how it affects the construction of simple photonic clusters.

arXiv:1102.1916•Journal of Modern Optics•Aug 4, 2011•3 citations

Towards Efficient Synthesis of Quantum Graph States by Fusing Graph Motifs

Tingxiang Ji, Hansika Weerasena, Demitry Farfurnik +1 more

Photonic graph states with advanced topologies can enable measurement-based quantum computing, distributed quantum sensing, and quantum interconnects. However, the efficient generation of photonic graph states is limited by the probabilistic nature of photonic entangling operations and the exponential dependence of generation rate on resource cost. In this work, we study photonic graph state synthesis as a cost-aware decomposition problem, exploiting local Clifford (LC) equivalence to identify more synthesis-friendly representations of the target graph state before decomposition. Specifically, we propose Cost-aware Fusion-based Decomposition (CFD), a three-stage heuristic framework that decomposes a target graph state into ring, star, and linear motifs, and assembles them via Type-I fusion operations to minimize fusion overhead and physical-qubit consumption. We further show that selecting the LC-equivalent graph state with the minimum number of edges provides a highly effective proxy for near-optimal synthesis: in many cases it matches the best generation rate observed within the LC equivalence class under CFD, and in most remaining cases it remains close to it. Numerical evaluations on graph state orbit data and 2D and 3D lattice graph states demonstrate that CFD achieves up to 84.6\% reduction in resource overhead compared to baseline constructions, and yields improvements in photonic generation rate spanning multiple orders of magnitude. These results suggest that combining structure-aware motif decomposition with LC equivalence is a practical and scalable strategy for photonic graph state synthesis.

quant-pharXiv:2606.02880•Jun 3, 2026•0 citations

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•0 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
We demonstrate a method of constructing L-shape cluster states by exploiting equivalence class properties of graph states. The L-shape cluster state is a primitive which can be used to construct cluster states capable of supporting universal quantum computation. The method is device independent but is shown to be considerably more efficient than previously proposed approaches for photonic cluster construction. Two-dimensional photonic cluster states can be efficiently built via local unitaries and type-I fusion only. To allow for a complete calculation of the cost of two-dimensional photonic cluster-state construction, we also provide a recursion relation relating the length of a photonic cluster chain to the average resources required.
The ability to construct large photonic cluster states capable of supporting universal quantum computation relies on fusing together cluster primitives. These fusion operations are probabilistic and the efficiency of the construction process relies on recycling remains of cluster primitives that have undergone failed fusion attempts. Here I consider the effects of the inevitable decoherence that must arise while storing cluster primitives. First, I explore the case where dephased two-qubit cluster states are the basic resource for the construction of all larger cluster states, all fusion operations are successful, and no further dephasing occurs during the construction process. This allows us to explore how decoherence of the most basic, primitive clusters translates into imperfections of the larger cluster states constructed from them. I then assume that decoherence occurs before every attempted fusion operation and determine the best way to build a five-qubit cluster. This requires including the effects of the fusion operation failures. Fidelity is used as the measure of accuracy for the constructed cluster states. Finally, I include a short discussion of photon loss and how it affects the construction of simple photonic clusters.
Photonic graph states with advanced topologies can enable measurement-based quantum computing, distributed quantum sensing, and quantum interconnects. However, the efficient generation of photonic graph states is limited by the probabilistic nature of photonic entangling operations and the exponential dependence of generation rate on resource cost. In this work, we study photonic graph state synthesis as a cost-aware decomposition problem, exploiting local Clifford (LC) equivalence to identify more synthesis-friendly representations of the target graph state before decomposition. Specifically, we propose Cost-aware Fusion-based Decomposition (CFD), a three-stage heuristic framework that decomposes a target graph state into ring, star, and linear motifs, and assembles them via Type-I fusion operations to minimize fusion overhead and physical-qubit consumption. We further show that selecting the LC-equivalent graph state with the minimum number of edges provides a highly effective proxy for near-optimal synthesis: in many cases it matches the best generation rate observed within the LC equivalence class under CFD, and in most remaining cases it remains close to it. Numerical evaluations on graph state orbit data and 2D and 3D lattice graph states demonstrate that CFD achieves up to 84.6\% reduction in resource overhead compared to baseline constructions, and yields improvements in photonic generation rate spanning multiple orders of magnitude. These results suggest that combining structure-aware motif decomposition with LC equivalence is a practical and scalable strategy for photonic graph state synthesis.
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.
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.