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

Optical generation of matter qubit graph states

Benjamin, S C, Eisert, J, Thomas M. Stace

Published Jun 14, 2005• 39 citations
OpenAlex

Abstract

We present a scheme for rapidly entangling matter qubits in order to create graph states for one-way quantum computing. The qubits can be simple 3-level systems in separate cavities. Coupling involves only local fields and a static (unswitched) linear optics network with detectors that need not be photon number resolving. Fusion of graph state sections occurs with, in principle, zero probability of damaging the nascent graph state. We avoid the finite thresholds of other schemes by operating on two entangled pairs, so that each generates exactly one photon. We do not require the relatively slow single qubit local flips to be applied during the growth phase: growth of the graph state can then become a purely optical process. The scheme naturally generates graph states with vertices of high degree and so is easily able to construct minimal graph states, with consequent resource savings. The most efficient approach will be to create new graph state edges even as qubits elsewhere are measured, in a 'just in time' approach. An error analysis indicates that the scheme is robust against imperfections in the apparatus.

Related papers

Optical generation of matter qubit graph states

S C Benjamin, J Eisert, Thomas M. Stace

We present a scheme for rapidly entangling matter qubits in order to create graph states for one-way quantum computing. The qubits can be simple three-level systems in separate cavities. Coupling involves only local fields and a static (unswitched) linear optics network. Fusion of graph-state sections occurs with, in principle, zero probability of damaging the nascent graph state. We avoid the finite thresholds of other schemes by operating on two entangled pairs, so that each generates exactly one photon. We do not require the relatively slow single qubit local flips to be applied during the growth phase: growth of the graph state can then become a purely optical process. The scheme naturally generates graph states with vertices of high degree and so is easily able to construct minimal graph states, with consequent resource savings. The most efficient approach will be to create new graph-state edges even as qubits elsewhere are measured, in a 'just in time' approach. An error analysis indicates that the scheme is relatively robust against imperfections in the apparatus.

arXiv:quant-ph/0506110•New Journal of Physics•Sep 16, 2005•50 citations

Efficient Graph State Generation in Linear Optics

Seungbeom Chin, William J. Munro

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.

arXiv:2306.15148•Quantum•Aug 13, 2026•2 citations

Efficient deterministic generation of photonic graph states

Sophia E. Economou

Photonic graph states constitute important resources in quantum information processing. They are used in measurement-based and fusion-based quantum computing and in all-photonic repeaters for quantum networks. However, generating such highly entangled states is challenging due to the fact that photons do not interact with each other. We propose a protocol for generating arbitrary graph states using matter qubits as quantum emitters. Our approach guarantees the minimal number of emitters and provides in polynomial time the quantum circuit for the graph state generation (which includes the non-unitary process of photon emission). We find that the quantum circuit depth for general graphs also scale polynomially with system size.

Quantum Computing, Communication, and Simulation•Mar 8, 2023•0 citations

Atom-Mediated Deterministic Generation and Stitching of Photonic Graph States

Ziv Aqua, Barak Dayan

Highly entangled multiphoton graph states are a crucial resource in photonic quantum computation and communication. Yet, the lack of photon-photon interactions makes the construction of such graph states especially challenging. Typically, these states are produced through probabilistic single-photon sources and linear-optics entangling operations that require indistinguishable photons. The resulting inefficiency of these methods necessitates a large overhead in the number of sources and operations, creating a major bottleneck in the photonic approach. Here, we show how harnessing single-atom-based photonic operations can enable deterministic generation of photonic graph states, while also lifting the requirement for photon indistinguishability. To this end, we introduce a multigate quantum node comprising a single atom in a W -type level scheme coupled to an optical resonator. This configuration provides a versatile toolbox for generating graph states, allowing the operation of both the controlled- Z and photon-atom gates, as well as the deterministic generation of single photons. Furthermore, the ability to deterministically entangle photonic qubits enables the expansion of the generated state by stitching together graph states produced by different nodes. We investigate the implementation of this gate-based approach using 87 Rb atoms and evaluate its performance through numerical simulations.

arXiv:2406.00860•PRX Quantum•Mar 4, 2025•3 citations

Generating graph states with a single quantum emitter and the minimum number of fusions

Matthias C. Löbl, Love A. Pettersson, Andrew Jena +3 more

Graph states are the key resources for measurement- and fusion-based quantum computing with photons, yet their creation is experimentally challenging. We optimize a hybrid graph-state generation scheme using a single quantum emitter and linear optics Bell-state measurements called fusions. We first generate a restricted class of states from a single quantum emitter and then apply fusions to create a target graph state, where we use a dynamic programming approach to find the construction that requires the lowest possible number of fusions. Our analysis yields a lookup table for constructing $\ensuremath{\approx}2.8\ifmmode\times\else\texttimes\fi{}{10}^{7}$ nonisomorphic graph states with the minimum number of fusions. The lookup table covers all graph states with up to eight qubits and several other ones with up to 14 qubits. We present construction protocols of selected graph states and provide the lookup table. For large graph states that are not in the lookup table, we derive bounds for the required number of fusions using graph-theoretic properties. Finally, we use the lookup table to search for the best graph codes for loss-tolerant encodings, given a fixed number of fusions for their construction.

arXiv:2412.04587•Physical Review A•May 7, 2025•4 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
We present a scheme for rapidly entangling matter qubits in order to create graph states for one-way quantum computing. The qubits can be simple 3-level systems in separate cavities. Coupling involves only local fields and a static (unswitched) linear optics network with detectors that need not be photon number resolving. Fusion of graph state sections occurs with, in principle, zero probability of damaging the nascent graph state. We avoid the finite thresholds of other schemes by operating on two entangled pairs, so that each generates exactly one photon. We do not require the relatively slow single qubit local flips to be applied during the growth phase: growth of the graph state can then become a purely optical process. The scheme naturally generates graph states with vertices of high degree and so is easily able to construct minimal graph states, with consequent resource savings. The most efficient approach will be to create new graph state edges even as qubits elsewhere are measured, in a 'just in time' approach. An error analysis indicates that the scheme is robust against imperfections in the apparatus.
We present a scheme for rapidly entangling matter qubits in order to create graph states for one-way quantum computing. The qubits can be simple three-level systems in separate cavities. Coupling involves only local fields and a static (unswitched) linear optics network. Fusion of graph-state sections occurs with, in principle, zero probability of damaging the nascent graph state. We avoid the finite thresholds of other schemes by operating on two entangled pairs, so that each generates exactly one photon. We do not require the relatively slow single qubit local flips to be applied during the growth phase: growth of the graph state can then become a purely optical process. The scheme naturally generates graph states with vertices of high degree and so is easily able to construct minimal graph states, with consequent resource savings. The most efficient approach will be to create new graph-state edges even as qubits elsewhere are measured, in a 'just in time' approach. An error analysis indicates that the scheme is relatively robust against imperfections in the apparatus.
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.
Photonic graph states constitute important resources in quantum information processing. They are used in measurement-based and fusion-based quantum computing and in all-photonic repeaters for quantum networks. However, generating such highly entangled states is challenging due to the fact that photons do not interact with each other. We propose a protocol for generating arbitrary graph states using matter qubits as quantum emitters. Our approach guarantees the minimal number of emitters and provides in polynomial time the quantum circuit for the graph state generation (which includes the non-unitary process of photon emission). We find that the quantum circuit depth for general graphs also scale polynomially with system size.
Highly entangled multiphoton graph states are a crucial resource in photonic quantum computation and communication. Yet, the lack of photon-photon interactions makes the construction of such graph states especially challenging. Typically, these states are produced through probabilistic single-photon sources and linear-optics entangling operations that require indistinguishable photons. The resulting inefficiency of these methods necessitates a large overhead in the number of sources and operations, creating a major bottleneck in the photonic approach. Here, we show how harnessing single-atom-based photonic operations can enable deterministic generation of photonic graph states, while also lifting the requirement for photon indistinguishability. To this end, we introduce a multigate quantum node comprising a single atom in a W -type level scheme coupled to an optical resonator. This configuration provides a versatile toolbox for generating graph states, allowing the operation of both the controlled- Z and photon-atom gates, as well as the deterministic generation of single photons. Furthermore, the ability to deterministically entangle photonic qubits enables the expansion of the generated state by stitching together graph states produced by different nodes. We investigate the implementation of this gate-based approach using 87 Rb atoms and evaluate its performance through numerical simulations.
Graph states are the key resources for measurement- and fusion-based quantum computing with photons, yet their creation is experimentally challenging. We optimize a hybrid graph-state generation scheme using a single quantum emitter and linear optics Bell-state measurements called fusions. We first generate a restricted class of states from a single quantum emitter and then apply fusions to create a target graph state, where we use a dynamic programming approach to find the construction that requires the lowest possible number of fusions. Our analysis yields a lookup table for constructing $\ensuremath{\approx}2.8\ifmmode\times\else\texttimes\fi{}{10}^{7}$ nonisomorphic graph states with the minimum number of fusions. The lookup table covers all graph states with up to eight qubits and several other ones with up to 14 qubits. We present construction protocols of selected graph states and provide the lookup table. For large graph states that are not in the lookup table, we derive bounds for the required number of fusions using graph-theoretic properties. Finally, we use the lookup table to search for the best graph codes for loss-tolerant encodings, given a fixed number of fusions for their construction.
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.