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:2406.00860 · PRX Quantum

Atom-Mediated Deterministic Generation and Stitching of Photonic Graph States

Ziv Aqua, Barak Dayan

Published Mar 4, 2025• 3 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/prxquantum.6.010340

Related papers

Atom-mediated photonic quantum computation

Barak Dayan, Ziv Aqua

Entangled multi-photon graph states are a crucial resource in photonic quantum computation and communication, yet the lack of photon-photon interactions makes their construction especially challenging. Typically, these graph 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. Harnessing single-atom-based photonic operations enables deterministic generation of photonic graph states, while also lifting the requirement for photon indistinguishability.

Quantum Communications and Quantum Imaging•Sep 18, 2025•0 citations

Efficient generation of entangled multiphoton graph states from a single atom

Philip Thomas, Leonardo Ruscio, Olivier Morin +1 more

Abstract The central technological appeal of quantum science resides in exploiting quantum effects, such as entanglement, for a variety of applications, including computing, communication and sensing 1 . The overarching challenge in these fields is to address, control and protect systems of many qubits against decoherence 2 . Against this backdrop, optical photons, naturally robust and easy to manipulate, represent ideal qubit carriers. However, the most successful technique so far for creating photonic entanglement 3 is inherently probabilistic and, therefore, subject to severe scalability limitations. Here we report the implementation of a deterministic protocol 4–6 for the creation of photonic entanglement with a single memory atom in a cavity 7 . We interleave controlled single-photon emissions with tailored atomic qubit rotations to efficiently grow Greenberger–Horne–Zeilinger (GHZ) states 8 of up to 14 photons and linear cluster states 9 of up to 12 photons with a fidelity lower bounded by 76(6)% and 56(4)%, respectively. Thanks to a source-to-detection efficiency of 43.18(7)% per photon, we measure these large states about once every minute, which is orders of magnitude faster than in any previous experiment 3,10–13 . In the future, this rate could be increased even further, the scheme could be extended to two atoms in a cavity 14,15 or several sources could be quantum mechanically coupled 16 , to generate higher-dimensional cluster states 17 . Overcoming the limitations encountered by probabilistic schemes for photonic entanglement generation, our results may offer a way towards scalable measurement-based quantum computation 18,19 and communication 20,21 .

arXiv:2205.12736•Nature•Aug 24, 2022•208 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•33 citations

Resource-efficient loss-aware photonic-graph-state preparation using atomic emitters

Eneet Kaur, Ashlesha Patil, Saikat Guha

Multiqubit entangled photonic graph states are an important ingredient for all-photonic quantum computing, repeaters, and networking. Preparing them using probabilistic stitching of single photons using linear optics presents a formidable resource challenge due to multiplexing needs. Quantum emitters provide a viable solution to prepare photonic graph states, as they enable deterministic production of photons entangled with emitter qubits and deterministic two-qubit interactions among emitters. A handful of emitters often suffice to generate useful-size graph states that would otherwise require millions of emitters used as single photon sources, using the linear-optics method. Photon loss, however, impedes the emitter method due to a large circuit depth and hence loss accrual on the photons of the graph state produced, given the typically large number of slow two-qubit controlled-not (cnot) gates between emitters. We propose an algorithm that can trade the number of emitters with the graph-state depth, while minimizing the number of emitter cnot gates. We apply our algorithm to generate a repeater graph state (RGS) for an alternative all-photonic repeater protocol, which achieves a far superior rate-distance trade-off compared to using the least number of emitters needed to generate the RGS. Yet it needs five orders of magnitude fewer emitters than the multiplexed linear-optics method---with each emitter used as a photon source---to achieve a desired rate-distance performance.

arXiv:2402.00731•Physical Review A•Nov 7, 2025•3 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•27 citations

Deterministic generation of indistinguishable photons in a cluster state

Dan Cogan, Zu-En Su, Oded Kenneth +1 more

Entanglement between particles is a basic concept of quantum sciences. The ability to produce entangled particles in a controllable manner is essential for any quantum technology. Entanglement between light particles (photons) is particularly crucial for quantum communication due to light's non-interactive nature and long-lasting coherence. Resources producing entangled multiphoton cluster states will enable communication between remote quantum nodes, as the inbuilt redundancy of cluster photons allows for repeated local measurements-compensating for losses and probabilistic Bell measurements. For feasible applications, the cluster generation should be fast, deterministic and, most importantly, its photons indistinguishable, which will allow measurements and fusion of clusters by interfering photons. Here, using periodic excitation of a semiconductor quantum-dot-confined spin, we demonstrate a multi-indistinguishable photon cluster, featuring a continuously generated string of photons at deterministic gigahertz generation rates, and an optimized entanglement length of about ten photons. The indistinguishability of the photons opens up new possibilities for scaling up the cluster's dimensionality by fusion, thus building graph states suited for measurement-based photonic quantum computers and all-photonic quantum repeaters.

Nature Photonics•Feb 9, 2023•132 citations
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.
Entangled multi-photon graph states are a crucial resource in photonic quantum computation and communication, yet the lack of photon-photon interactions makes their construction especially challenging. Typically, these graph 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. Harnessing single-atom-based photonic operations enables deterministic generation of photonic graph states, while also lifting the requirement for photon indistinguishability.
Abstract The central technological appeal of quantum science resides in exploiting quantum effects, such as entanglement, for a variety of applications, including computing, communication and sensing 1 . The overarching challenge in these fields is to address, control and protect systems of many qubits against decoherence 2 . Against this backdrop, optical photons, naturally robust and easy to manipulate, represent ideal qubit carriers. However, the most successful technique so far for creating photonic entanglement 3 is inherently probabilistic and, therefore, subject to severe scalability limitations. Here we report the implementation of a deterministic protocol 4–6 for the creation of photonic entanglement with a single memory atom in a cavity 7 . We interleave controlled single-photon emissions with tailored atomic qubit rotations to efficiently grow Greenberger–Horne–Zeilinger (GHZ) states 8 of up to 14 photons and linear cluster states 9 of up to 12 photons with a fidelity lower bounded by 76(6)% and 56(4)%, respectively. Thanks to a source-to-detection efficiency of 43.18(7)% per photon, we measure these large states about once every minute, which is orders of magnitude faster than in any previous experiment 3,10–13 . In the future, this rate could be increased even further, the scheme could be extended to two atoms in a cavity 14,15 or several sources could be quantum mechanically coupled 16 , to generate higher-dimensional cluster states 17 . Overcoming the limitations encountered by probabilistic schemes for photonic entanglement generation, our results may offer a way towards scalable measurement-based quantum computation 18,19 and communication 20,21 .
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.
Multiqubit entangled photonic graph states are an important ingredient for all-photonic quantum computing, repeaters, and networking. Preparing them using probabilistic stitching of single photons using linear optics presents a formidable resource challenge due to multiplexing needs. Quantum emitters provide a viable solution to prepare photonic graph states, as they enable deterministic production of photons entangled with emitter qubits and deterministic two-qubit interactions among emitters. A handful of emitters often suffice to generate useful-size graph states that would otherwise require millions of emitters used as single photon sources, using the linear-optics method. Photon loss, however, impedes the emitter method due to a large circuit depth and hence loss accrual on the photons of the graph state produced, given the typically large number of slow two-qubit controlled-not (cnot) gates between emitters. We propose an algorithm that can trade the number of emitters with the graph-state depth, while minimizing the number of emitter cnot gates. We apply our algorithm to generate a repeater graph state (RGS) for an alternative all-photonic repeater protocol, which achieves a far superior rate-distance trade-off compared to using the least number of emitters needed to generate the RGS. Yet it needs five orders of magnitude fewer emitters than the multiplexed linear-optics method---with each emitter used as a photon source---to achieve a desired rate-distance performance.
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.
Entanglement between particles is a basic concept of quantum sciences. The ability to produce entangled particles in a controllable manner is essential for any quantum technology. Entanglement between light particles (photons) is particularly crucial for quantum communication due to light's non-interactive nature and long-lasting coherence. Resources producing entangled multiphoton cluster states will enable communication between remote quantum nodes, as the inbuilt redundancy of cluster photons allows for repeated local measurements-compensating for losses and probabilistic Bell measurements. For feasible applications, the cluster generation should be fast, deterministic and, most importantly, its photons indistinguishable, which will allow measurements and fusion of clusters by interfering photons. Here, using periodic excitation of a semiconductor quantum-dot-confined spin, we demonstrate a multi-indistinguishable photon cluster, featuring a continuously generated string of photons at deterministic gigahertz generation rates, and an optimized entanglement length of about ten photons. The indistinguishability of the photons opens up new possibilities for scaling up the cluster's dimensionality by fusion, thus building graph states suited for measurement-based photonic quantum computers and all-photonic quantum repeaters.