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:1011.4663 · Physical Review A

Weaving independently generated photons into an arbitrary graph state

Qing Lin, Bing He

Published Dec 16, 2011• 20 citations
arXivHTMLPDF

Abstract

The controlled-$Z$ (cz) operations acting separately on pairs of qubits are commonly adopted in the schemes of generating graph states, the multipartite entangled states for the one-way quantum computing. For this purpose, we propose a setup of cascade cz operation on a whole group of qubits in sequence. The operation of the setup starts with entangling an ancilla photon with the first photon as qubit, and this ancilla automatically moves from one entanglement link to another in assisting the formation of a string in graph states. The generation of some special types of graph states, such as the three-dimensional ones, can be greatly simplified in this approach. The setup presented uses weak nonlinearities, but an implementation using probabilistic linear optics is also possible.

DOI
10.1103/physreva.84.062312

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•59 citations

Distributing graph states with a photon-weaving quantum server

Daniel Bhatti, Kenneth Goodenough

Abstract One of the key aims of quantum networks is the efficient distribution of multipartite entangled states among end users. While various architectures have been proposed, each comes with distinct advantages and limitations. Many designs depend on long-lived quantum memories and deterministic gates, which, while powerful, introduce considerable cost and technical challenges. Experimentally cheaper alternatives that circumvent these constraints are often limited to specific types of entanglement and a specific number of users. Here, we present an experiment-friendly quantum server that relies only on linear optical elements, offering a flexible approach to multipartite entanglement distribution. Our so-called photon-weaving quantum server can generate and distribute one of several locally nonequivalent graph states, including Greenberger–Horne–Zeilinger (GHZ) states, as well as path, cycle, and caterpillar graph states. This is achieved through two distinct fusion protocols, i.e. multiphoton graph-state fusion ( graph-state weaving ) and multiphoton GHZ-state fusion ( GHZ-state weaving ), and can readily be implemented.

arXiv:2504.07410•New Journal of Physics•Jun 29, 2026•6 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•7 citations

Purification of photonic graph states

Matthias C. Löbl, Aliki A. Capatos, Ming Lai Chan +3 more

Graph states constitute the main building block for quantum computing with photons. Quantum emitters with a hosted spin can deterministically generate photonic graph states, strongly lowering the overhead of multiplexing highly probabilistic linear-optics graph state generation. However, they generally suffer from various noise sources, resulting in reduced fidelities of the produced states. To mitigate this issue, we develop purification schemes for entangled photonic states. We first develop purification schemes to purify arbitrary photonic GHZ and other CSS states, which we generalize to all photonic graph states and stabilizer states. The proposed purification schemes have a high success probability of up to $1/2$ and require only linear optics and photon detectors. We optimize cascaded purification schemes for various graph states, taking into account phenomenological Pauli errors or physical noise in time-bin-encoded graph state generation with quantum emitters.

quant-pharXiv:2609.01710•Sep 3, 2026•1 citation

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•242 citations

Generation of Genuine Multipartite Entangled States via Indistinguishability of Identical Particles

Kobra Mahdavipour, Farzam Nosrati, Stefania Sciara +2 more

Indistinguishability of identical particles is a resource for quantum information processing and has been utilized to generate entanglement from independent particles that spatially overlap only at the detection stage. Here, we introduce a controllable scheme capable of generating via three steps, i.e., initialization, deformation, and postselection, different classes of multipartite entangled states starting from a product state of N spatially distinguishable identical qubits. While our scheme is generalizable to any class of entangled bosonic and fermionic systems, we provide an explicit recipe for the generation of W , Dicke, GHZ, and cluster states, which are resource states for quantum information processing. Using graph-based representations within the framework of spatially localized operations and classical communication (sLOCC), we mathematically demonstrate a direct translation of the generation schemes of specific entangled states into colored, complex, and weighted digraphs, each corresponding to a given experimental setup. We also show that this graph-theoretical approach allows for the optimization of the generation efficiency of specific multipartite entangled states by exploring a variety of generation schemes. The presented theoretical approach, while already implementable with current linear optics architectures, has the potential to bring clear advantages over existing technologies, such as in quantum computing search algorithms and in the design of new experiments in quantum optics or other platforms. Published by the American Physical Society 2024

arXiv:2403.17171•PRX Quantum•Dec 27, 2024•8 citations
The controlled-ZZZ (cz) operations acting separately on pairs of qubits are commonly adopted in the schemes of generating graph states, the multipartite entangled states for the one-way quantum computing. For this purpose, we propose a setup of cascade cz operation on a whole group of qubits in sequence. The operation of the setup starts with entangling an ancilla photon with the first photon as qubit, and this ancilla automatically moves from one entanglement link to another in assisting the formation of a string in graph states. The generation of some special types of graph states, such as the three-dimensional ones, can be greatly simplified in this approach. The setup presented uses weak nonlinearities, but an implementation using probabilistic linear optics is also possible.
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.
Abstract One of the key aims of quantum networks is the efficient distribution of multipartite entangled states among end users. While various architectures have been proposed, each comes with distinct advantages and limitations. Many designs depend on long-lived quantum memories and deterministic gates, which, while powerful, introduce considerable cost and technical challenges. Experimentally cheaper alternatives that circumvent these constraints are often limited to specific types of entanglement and a specific number of users. Here, we present an experiment-friendly quantum server that relies only on linear optical elements, offering a flexible approach to multipartite entanglement distribution. Our so-called photon-weaving quantum server can generate and distribute one of several locally nonequivalent graph states, including Greenberger–Horne–Zeilinger (GHZ) states, as well as path, cycle, and caterpillar graph states. This is achieved through two distinct fusion protocols, i.e. multiphoton graph-state fusion ( graph-state weaving ) and multiphoton GHZ-state fusion ( GHZ-state weaving ), and can readily be implemented.
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 constitute the main building block for quantum computing with photons. Quantum emitters with a hosted spin can deterministically generate photonic graph states, strongly lowering the overhead of multiplexing highly probabilistic linear-optics graph state generation. However, they generally suffer from various noise sources, resulting in reduced fidelities of the produced states. To mitigate this issue, we develop purification schemes for entangled photonic states. We first develop purification schemes to purify arbitrary photonic GHZ and other CSS states, which we generalize to all photonic graph states and stabilizer states. The proposed purification schemes have a high success probability of up to 1/21/21/2 and require only linear optics and photon detectors. We optimize cascaded purification schemes for various graph states, taking into account phenomenological Pauli errors or physical noise in time-bin-encoded graph state generation with quantum emitters.
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 .
Indistinguishability of identical particles is a resource for quantum information processing and has been utilized to generate entanglement from independent particles that spatially overlap only at the detection stage. Here, we introduce a controllable scheme capable of generating via three steps, i.e., initialization, deformation, and postselection, different classes of multipartite entangled states starting from a product state of N spatially distinguishable identical qubits. While our scheme is generalizable to any class of entangled bosonic and fermionic systems, we provide an explicit recipe for the generation of W , Dicke, GHZ, and cluster states, which are resource states for quantum information processing. Using graph-based representations within the framework of spatially localized operations and classical communication (sLOCC), we mathematically demonstrate a direct translation of the generation schemes of specific entangled states into colored, complex, and weighted digraphs, each corresponding to a given experimental setup. We also show that this graph-theoretical approach allows for the optimization of the generation efficiency of specific multipartite entangled states by exploring a variety of generation schemes. The presented theoretical approach, while already implementable with current linear optics architectures, has the potential to bring clear advantages over existing technologies, such as in quantum computing search algorithms and in the design of new experiments in quantum optics or other platforms. Published by the American Physical Society 2024