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:2306.15148 · Quantum

Efficient Graph State Generation in Linear Optics

Seungbeom Chin, William J. Munro

Published Aug 13, 2026• 6 citations
arXivHTMLPDF

Abstract

Graph states are central resources for quantum information processing, supporting applications in computation, communication, and error correction. In photonic systems, they are typically assembled from smaller entangled states using probabilistic fusion gates, which demand many photons and suffer from low success rates. We present an optimized scheme for directly generating caterpillar graph states (CGSs)—essential resource states for constructing high-dimensional lattice graph states—using only single-photon sources, linear optics, and heralded measurements. Based on the linear quantum graph (LQG) picture, our method produces CGSs efficiently. For CGSs of length l ≥ 3 , it requires l − 2 fewer photons and achieves a success rate 2 l − 2 times higher than fusion-based approaches. These results demonstrate that the LQG picture provides a powerful and flexible route to generating complex photonic graph states for efficient quantum information processing.

DOI
10.22331/q-2026-08-13-2189

Related papers

Algorithmic Design of Heralded Linear Optical Circuits for Multipartite Entanglement

Jaehee Kim, Hon Wai Lau, William J. Munro +2 more

Heralded multipartite entanglement is a key resource for various quantum information tasks. However, designing linear optical circuits that generate specific target states is generally challenging due to the complexity of the required optical structures. Here we formulate the design of heralded photonic circuits as an algorithmic graph-search problem. Our framework enables the automated construction and optimization of heralded photonic circuits by substantially reducing the search space using the linear quantum graph (LQG) picture. Our strategy reconstructs circuit structures as graphs in the picture and identifies suitable graphs automatically. As a result, we design efficient schemes for a broad range of useful multipartite resource states, including hypergraph magic states, quantum error correcting codes, general three-qubit states and length-1 caterpillar graph states. Our work establishes an algorithmic framework for the systematic discovery of heralded resource states, laying the foundation for the automated design of increasingly complex multipartite entangled resources.

quant-pharXiv:2609.18002•Sep 17, 2026•0 citations

Near-deterministic hybrid generation of arbitrary photonic graph states using a single quantum emitter and linear optics

Paul Hilaire, Leonid Vidro, H. S. Eisenberg +1 more

Since linear-optical two-photon gates are inherently probabilistic, measurement-based implementations are particularly well suited for photonic platforms: a large highly-entangled photonic resource state, called a graph state, is consumed through measurements to perform a computation. The challenge is thus to produce these graph states. Several generation procedures, which use either interacting quantum emitters or efficient spin-photon interface, have been proposed to create these photonic graph states deterministically. Yet, these solutions are still out of reach experimentally since the state-of-the-art is the generation of a linear graph state. Here, we introduce near-deterministic solutions for the generation of graph states using the current quantum emitter capabilities. We propose hybridizing quantum-emitter-based graph state generation with all-photonic fusion gates to produce graph states of complex topology near-deterministically. Our results should pave the way towards the practical implementation of resource-efficient quantum information processing, including measurement-based quantum communication and quantum computing.

arXiv:2205.09750•Quantum•Apr 27, 2023•42 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•2 citations

Deterministic and reconfigurable graph state generation with a single solid-state quantum emitter

Hêlio Huet, Polluri Ramesh, Stephen C. Wein +11 more

Measurement-based quantum computing offers a promising route towards scalable, universal photonic quantum computation. This approach relies on the deterministic and efficient generation of photonic graph states in which many photons are mutually entangled with various topologies. Recently, deterministic sources of graph states have been demonstrated with quantum emitters in both the optical and microwave domains. In this work, we demonstrate deterministic and reconfigurable graph state generation with optical solid-state integrated quantum emitters. Specifically, we use a single semiconductor quantum dot in a cavity to generate caterpillar graph states, the most general type of graph state that can be produced with a single emitter. By using fast detuned optical pulses, we achieve full control over the spin state, enabling us to vary the entanglement topology at will. We perform quantum state tomography of two successive photons, measuring Bell state fidelities up to 0.80 ± 0.04 and concurrences up to 0.69 ± 0.09, while maintaining high photon indistinguishability. This simple optical scheme, compatible with commercially available quantum dot-based single photon sources, brings us a step closer to fault-tolerant quantum computing with spins and photons. Quantum emitters have recently been identified as efficient sources of graph states, which are entangled states crucial for photonic quantum computation. Here the authors demonstrate deterministic and reconfigurable generation of caterpillar graph states using a semiconductor quantum dot in a cavity.

arXiv:2410.23518•Nature Communications•May 9, 2025•53 citations

Graph-theoretical optimization of fusion-based graph state generation

Seok-Hyung Lee, Hyunseok Jeong

Graph states are versatile resources for various quantum information processing tasks, including measurement-based quantum computing and quantum repeaters. Although the type-II fusion gate enables all-optical generation of graph states by combining small graph states, its non-deterministic nature hinders the efficient generation of large graph states. In this work, we present a graph-theoretical strategy to effectively optimize fusion-based generation of any given graph state, along with a Python package OptGraphState. Our strategy comprises three stages: simplifying the target graph state, building a fusion network, and determining the order of fusions. Utilizing this proposed method, we evaluate the resource overheads of random graphs and various well-known graphs. Additionally, we investigate the success probability of graph state generation given a restricted number of available resource states. We expect that our strategy and software will assist researchers in developing and assessing experimentally viable schemes that use photonic graph states.

arXiv:2304.11988•Quantum•Dec 20, 2023•26 citations

Heralded Linear Optical Generation of Dicke States

Minhyeok Kang, Jaehee Kim, William J. Munro +2 more

Entanglement is a fundamental feature of quantum mechanics and a key resource for quantum information processing. Among multipartite entangled states, Dicke states $|D_n^k\rangle$ are distinguished by their permutation symmetry, which provides robustness against particle loss and enables applications for quantum communication and computation. Although Dicke states have been realized in various platforms, most optical implementations rely on postselection, which destroys the state upon detection and prevents its further use. A heralded optical scheme is therefore highly desirable. Here, we present a linear-optical heralded scheme for generating arbitrary Dicke states $|D_n^k\rangle$ with $3n+k$ photons through the framework of the linear quantum graph (LQG) picture. By mapping the scheme design into the graph-finding problem, and exploiting the permutation symmetry of Dicke states, we overcome the structural complexity that has hindered previous approaches. Our results provide a resource-efficient pathway toward practical heralded preparation of Dicke states for quantum technologies.

quant-pharXiv:2512.20881•New Journal of Physics•Dec 25, 2025•5 citations
Graph states are central resources for quantum information processing, supporting applications in computation, communication, and error correction. In photonic systems, they are typically assembled from smaller entangled states using probabilistic fusion gates, which demand many photons and suffer from low success rates. We present an optimized scheme for directly generating caterpillar graph states (CGSs)—essential resource states for constructing high-dimensional lattice graph states—using only single-photon sources, linear optics, and heralded measurements. Based on the linear quantum graph (LQG) picture, our method produces CGSs efficiently. For CGSs of length l ≥ 3 , it requires l − 2 fewer photons and achieves a success rate 2 l − 2 times higher than fusion-based approaches. These results demonstrate that the LQG picture provides a powerful and flexible route to generating complex photonic graph states for efficient quantum information processing.
Heralded multipartite entanglement is a key resource for various quantum information tasks. However, designing linear optical circuits that generate specific target states is generally challenging due to the complexity of the required optical structures. Here we formulate the design of heralded photonic circuits as an algorithmic graph-search problem. Our framework enables the automated construction and optimization of heralded photonic circuits by substantially reducing the search space using the linear quantum graph (LQG) picture. Our strategy reconstructs circuit structures as graphs in the picture and identifies suitable graphs automatically. As a result, we design efficient schemes for a broad range of useful multipartite resource states, including hypergraph magic states, quantum error correcting codes, general three-qubit states and length-1 caterpillar graph states. Our work establishes an algorithmic framework for the systematic discovery of heralded resource states, laying the foundation for the automated design of increasingly complex multipartite entangled resources.
Since linear-optical two-photon gates are inherently probabilistic, measurement-based implementations are particularly well suited for photonic platforms: a large highly-entangled photonic resource state, called a graph state, is consumed through measurements to perform a computation. The challenge is thus to produce these graph states. Several generation procedures, which use either interacting quantum emitters or efficient spin-photon interface, have been proposed to create these photonic graph states deterministically. Yet, these solutions are still out of reach experimentally since the state-of-the-art is the generation of a linear graph state. Here, we introduce near-deterministic solutions for the generation of graph states using the current quantum emitter capabilities. We propose hybridizing quantum-emitter-based graph state generation with all-photonic fusion gates to produce graph states of complex topology near-deterministically. Our results should pave the way towards the practical implementation of resource-efficient quantum information processing, including measurement-based quantum communication and quantum computing.
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.
Measurement-based quantum computing offers a promising route towards scalable, universal photonic quantum computation. This approach relies on the deterministic and efficient generation of photonic graph states in which many photons are mutually entangled with various topologies. Recently, deterministic sources of graph states have been demonstrated with quantum emitters in both the optical and microwave domains. In this work, we demonstrate deterministic and reconfigurable graph state generation with optical solid-state integrated quantum emitters. Specifically, we use a single semiconductor quantum dot in a cavity to generate caterpillar graph states, the most general type of graph state that can be produced with a single emitter. By using fast detuned optical pulses, we achieve full control over the spin state, enabling us to vary the entanglement topology at will. We perform quantum state tomography of two successive photons, measuring Bell state fidelities up to 0.80 ± 0.04 and concurrences up to 0.69 ± 0.09, while maintaining high photon indistinguishability. This simple optical scheme, compatible with commercially available quantum dot-based single photon sources, brings us a step closer to fault-tolerant quantum computing with spins and photons. Quantum emitters have recently been identified as efficient sources of graph states, which are entangled states crucial for photonic quantum computation. Here the authors demonstrate deterministic and reconfigurable generation of caterpillar graph states using a semiconductor quantum dot in a cavity.
Graph states are versatile resources for various quantum information processing tasks, including measurement-based quantum computing and quantum repeaters. Although the type-II fusion gate enables all-optical generation of graph states by combining small graph states, its non-deterministic nature hinders the efficient generation of large graph states. In this work, we present a graph-theoretical strategy to effectively optimize fusion-based generation of any given graph state, along with a Python package OptGraphState. Our strategy comprises three stages: simplifying the target graph state, building a fusion network, and determining the order of fusions. Utilizing this proposed method, we evaluate the resource overheads of random graphs and various well-known graphs. Additionally, we investigate the success probability of graph state generation given a restricted number of available resource states. We expect that our strategy and software will assist researchers in developing and assessing experimentally viable schemes that use photonic graph states.
Entanglement is a fundamental feature of quantum mechanics and a key resource for quantum information processing. Among multipartite entangled states, Dicke states ∣Dnk⟩|D_n^k\rangle∣Dnk​⟩ are distinguished by their permutation symmetry, which provides robustness against particle loss and enables applications for quantum communication and computation. Although Dicke states have been realized in various platforms, most optical implementations rely on postselection, which destroys the state upon detection and prevents its further use. A heralded optical scheme is therefore highly desirable. Here, we present a linear-optical heralded scheme for generating arbitrary Dicke states ∣Dnk⟩|D_n^k\rangle∣Dnk​⟩ with 3n+k3n+k3n+k photons through the framework of the linear quantum graph (LQG) picture. By mapping the scheme design into the graph-finding problem, and exploiting the permutation symmetry of Dicke states, we overcome the structural complexity that has hindered previous approaches. Our results provide a resource-efficient pathway toward practical heralded preparation of Dicke states for quantum technologies.