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

International Conference on Quantum Information

Construction of Cluster States Using Graph State Equivalence Classes

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

Published Jan 1, 2007• 0 citations
Publisher

Abstract

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.
DOI
10.1364/icqi.2007.jwc67

Related papers

Application of equivalence classes to the efficient construction of cluster states

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

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.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 5, 2006•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

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

Generation of Multi-Photon Cluster States through the Cavity Input-Output Process

Zheng Hai-Yu, Xiaoting Zhang, Shao Xiao-Qiang +2 more

We propose a scheme to generate the multi-photon cluster states via the cavity input-output process and the single-bit rotations. The method can be generalized to construct a series of multi-photon graph states, and the successful probability is close to unity in the ideal condition.

Chinese Physics Letters•Mar 1, 2008•10 citations

Generating large-scale tree-type photonic cluster states with a recurrent quantum photonic neural network

Jacob Ewaniuk, Bhavin J. Shastri, Nir Rotenberg

Photonics for Quantum (PfQ)•Jul 18, 2025•0 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
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.
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.
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.