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:2108.12466 · npj Quantum Information

Photonic resource state generation from a minimal number of quantum emitters

Bikun Li, Sophia E. Economou, Edwin Barnes

Published Feb 3, 2022• 50 citations
arXivHTMLPDF

Abstract

Abstract Multi-photon entangled graph states are a fundamental resource in quantum communication networks, distributed quantum computing, and sensing. These states can in principle be created deterministically from quantum emitters such as optically active quantum dots or defects, atomic systems, or superconducting qubits. However, finding efficient schemes to produce such states has been a long-standing challenge. Here, we present an algorithm that, given a desired multi-photon graph state, determines the minimum number of quantum emitters and precise operation sequences that can produce it. The algorithm itself and the resulting operation sequence both scale polynomially in the size of the photonic graph state, allowing one to obtain efficient schemes to generate graph states containing hundreds or thousands of photons.

DOI
10.1038/s41534-022-00522-6

Related papers

Generation of Photonic Graph States with minimal number of quantum emitters

Konstantinos-Rafail Revis, Nils Tomke Ottink, Pierre-Emmanuel Emeriau +1 more

Graph states are a fundamental resource for measurement and fusion-based quantum computing, quantum networks, and sensing. Preparing them in a photonic system deterministically is, in principle, possible, but finding efficient schemes to prepare them was a long-standing problem addressed recently. Additionally, heuristic optimization schemes for reducing the required number of two-qubit gates were developed. However, the problem of reducing the number of emitters by optimizing the emission ordering was not addressed, due to its computational complexity, as it is connected to a well-known NP-hard problem from graph theory, the linear rank width computation. In this work, we focus on developing heuristic polynomial algorithms to reduce the number of emitters required. In total, we propose four distinct algorithms, which demonstrate up to $30\%$ emitter reduction on random graphs. Furthermore, we provide numerical and statistical evidence that the combination of our optimization schemes with the preexisting algorithms for optimizing the two-qubit gates of the preparation protocol can further reduce them by around $20\%$. Finally, we examine the developed algorithms for various useful graph state families, such as graphs useful for measurement-based quantum algorithms, and cluster states and graph codes used for quantum error correction, to determine the performance of each algorithm.

quant-pharXiv:2609.30400•Sep 28, 2026•0 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

Entangled photon factory: How to generate quantum resource states from a minimal number of quantum emitters

Bikun Li, Sophia E. Economou, Edwin Barnes

Photonic graph states are a crucial resource for quantum networks and measurement-based quantum computing. We present a general, efficient algorithm for determining how to generate any graph state from a minimal number of quantum emitters.

Quantum 2.0 Conference and Exhibition•Jan 1, 2022•2 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•18 citations

Cost-aware Photonic Graph State Generation: A Graphical Framework

Sobhan Ghanbari, Hoi‐Kwong Lo

Photonic graph states are essential resources for quantum computation and communication. Deterministic emitter-based generation of graph states overcomes the scalability issues of probabilistic approaches; nonetheless, their experimental realization is constrained by technological demands, often expressed by the number of two-qubit gates and the depth and/or width of the quantum circuits used to model the generation process. Here, we introduce a cost-aware framework for the generation of photonic graph states of arbitrary size and shape, built on a complete set of necessary and sufficient conditions and a universal set of elementary graph operations that govern the evolution of the state toward the target. Within this framework, we develop Graph Builder, a deterministic generation algorithm that achieves substantial reductions (up to an order of magnitude) in two-qubit gate usage for both random and structured graphs, compared with alternative approaches. Furthermore, we show that this framework enables the identification of elementary building blocks in specific cases, such as encoded 6-ring states. The algorithm uses the minimum number of emitters possible for a fixed emission sequence, while also supporting the use of extra emitters for controlled trade-offs between emitter count and other cost metrics. Moreover, by systematically identifying the degrees of freedom at each stage of the generation process, this framework fully characterizes the optimization landscape, enabling analytic, heuristic, or exhaustive strategies for further cost reductions. Our approach provides a general and versatile tool for designing and optimizing emitter-based photonic graph state generation protocols, essential for scalable and resource-efficient photonic quantum information processing.

arXiv:2509.22777•Sep 26, 2025•1 citation

Heralded photonic graph states with inefficient quantum emitters

Maxwell Gold, Jianlong Lin, Eric Chitambar +1 more

Abstract Quantum emitter-based schemes for the generation of photonic graph states offer a promising, resource-efficient methodology for realizing distributed quantum computation and communication protocols on near-term hardware. We present a heralded scheme for making photonic graph states that is compatible with the typically poor photon collection from state-of-the-art coherent quantum emitters. We demonstrate that the construction time for large graph states can be polynomial in the photon collection efficiency, as compared to the exponential scaling of current emitter-based schemes, which assume deterministic photon collection. The additional overhead here consists of an extra spin qubit plus one additional spin-spin entangling gate per photon added to the graph. While the proposed scheme requires both non-demolition measurement and efficient storage of photons in order to generate graph states for arbitrary applications, we show that many useful tasks, including measurement-based quantum computation, can be implemented without these requirements. As a use case of our scheme, we construct a protocol for secure two-party computation that can be implemented efficiently on current hardware. Estimates of the fidelity to produce graph states used in the computation are given assuming current and near-term fidelities for highly coherent quantum emitters.

arXiv:2405.13263•npj Quantum Information•Jan 15, 2026•3 citations
Abstract Multi-photon entangled graph states are a fundamental resource in quantum communication networks, distributed quantum computing, and sensing. These states can in principle be created deterministically from quantum emitters such as optically active quantum dots or defects, atomic systems, or superconducting qubits. However, finding efficient schemes to produce such states has been a long-standing challenge. Here, we present an algorithm that, given a desired multi-photon graph state, determines the minimum number of quantum emitters and precise operation sequences that can produce it. The algorithm itself and the resulting operation sequence both scale polynomially in the size of the photonic graph state, allowing one to obtain efficient schemes to generate graph states containing hundreds or thousands of photons.
Graph states are a fundamental resource for measurement and fusion-based quantum computing, quantum networks, and sensing. Preparing them in a photonic system deterministically is, in principle, possible, but finding efficient schemes to prepare them was a long-standing problem addressed recently. Additionally, heuristic optimization schemes for reducing the required number of two-qubit gates were developed. However, the problem of reducing the number of emitters by optimizing the emission ordering was not addressed, due to its computational complexity, as it is connected to a well-known NP-hard problem from graph theory, the linear rank width computation. In this work, we focus on developing heuristic polynomial algorithms to reduce the number of emitters required. In total, we propose four distinct algorithms, which demonstrate up to 30%30\%30% emitter reduction on random graphs. Furthermore, we provide numerical and statistical evidence that the combination of our optimization schemes with the preexisting algorithms for optimizing the two-qubit gates of the preparation protocol can further reduce them by around 20%20\%20%. Finally, we examine the developed algorithms for various useful graph state families, such as graphs useful for measurement-based quantum algorithms, and cluster states and graph codes used for quantum error correction, to determine the performance of each algorithm.
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.
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.
Photonic graph states are essential resources for quantum computation and communication. Deterministic emitter-based generation of graph states overcomes the scalability issues of probabilistic approaches; nonetheless, their experimental realization is constrained by technological demands, often expressed by the number of two-qubit gates and the depth and/or width of the quantum circuits used to model the generation process. Here, we introduce a cost-aware framework for the generation of photonic graph states of arbitrary size and shape, built on a complete set of necessary and sufficient conditions and a universal set of elementary graph operations that govern the evolution of the state toward the target. Within this framework, we develop Graph Builder, a deterministic generation algorithm that achieves substantial reductions (up to an order of magnitude) in two-qubit gate usage for both random and structured graphs, compared with alternative approaches. Furthermore, we show that this framework enables the identification of elementary building blocks in specific cases, such as encoded 6-ring states. The algorithm uses the minimum number of emitters possible for a fixed emission sequence, while also supporting the use of extra emitters for controlled trade-offs between emitter count and other cost metrics. Moreover, by systematically identifying the degrees of freedom at each stage of the generation process, this framework fully characterizes the optimization landscape, enabling analytic, heuristic, or exhaustive strategies for further cost reductions. Our approach provides a general and versatile tool for designing and optimizing emitter-based photonic graph state generation protocols, essential for scalable and resource-efficient photonic quantum information processing.
Abstract Quantum emitter-based schemes for the generation of photonic graph states offer a promising, resource-efficient methodology for realizing distributed quantum computation and communication protocols on near-term hardware. We present a heralded scheme for making photonic graph states that is compatible with the typically poor photon collection from state-of-the-art coherent quantum emitters. We demonstrate that the construction time for large graph states can be polynomial in the photon collection efficiency, as compared to the exponential scaling of current emitter-based schemes, which assume deterministic photon collection. The additional overhead here consists of an extra spin qubit plus one additional spin-spin entangling gate per photon added to the graph. While the proposed scheme requires both non-demolition measurement and efficient storage of photons in order to generate graph states for arbitrary applications, we show that many useful tasks, including measurement-based quantum computation, can be implemented without these requirements. As a use case of our scheme, we construct a protocol for secure two-party computation that can be implemented efficiently on current hardware. Estimates of the fidelity to produce graph states used in the computation are given assuming current and near-term fidelities for highly coherent quantum emitters.