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

Conference on Lasers and Electro-Optics

Tree-Type Photonic Cluster State Generation with a Single Quantum Emitter

Yuan Zhan, Shuo Sun

Published Jan 1, 2021• 0 citations
Publisher

Abstract

We propose to deterministically generate photonic tree states and repeater graph states of arbitrary size with a single quantum emitter. Photonic entanglement is established through emission and rescattering from the same emitter.
DOI
10.1364/cleo_qels.2021.fm1n.6

Related papers

Deterministic Generation of Loss-Tolerant Photonic Cluster States with a Single Quantum Emitter

Yuan Zhan, Shuo Sun

A photonic cluster state with a tree-type entanglement structure constitutes an efficient resource for quantum error correction of photon loss. But the generation of a tree cluster state with an arbitrary size is notoriously difficult. Here, we propose a protocol to deterministically generate photonic tree states of arbitrary size by using only a single quantum emitter. Photonic entanglement is established through both emission and rescattering from the same emitter, enabling fast and resource-efficient entanglement generation. The same protocol can also be extended to generate more general tree-type entangled states.

arXiv:2007.06608•Physical Review Letters•Nov 24, 2020•47 citations

Deterministic generation of building-block photonic cluster states from a single quantum emitter

Shuo Sun

I will discuss our recent proposal on deterministic generation of photonic repeater graph states using only a single quantum emitter, our plans for its experimental implementation, and its applications in quantum repeaters and networks.

Quantum Nanophotonic Materials, Devices, and Systems•Oct 4, 2022•0 citations

Deterministic generation of photonic tree and repeater graph states with a single quantum emitter

Yuan Zhan, Shuo Sun

Bulletin of the American Physical Society•Mar 15, 2021•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

Generation of arbitrary all-photonic graph states from quantum emitters

Antonio Russo, Edwin Barnes, Sophia E Economou

Abstract We present protocols to generate arbitrary photonic graph states from quantum emitters that are in principle deterministic. We focus primarily on two-dimensional cluster states of arbitrary size due to their importance for measurement-based quantum computing. Our protocols for these and many other types of two-dimensional graph states require a linear array of emitters in which each emitter can be controllably pumped, rotated about certain axes, and entangled with its nearest neighbors. We show that an error on one emitter produces a localized region of errors in the resulting graph state, where the size of the region is determined by the coordination number of the graph. We describe how these protocols can be implemented for different types of emitters, including trapped ions, quantum dots, and nitrogen-vacancy centers in diamond.

arXiv:1811.06305•New Journal of Physics•Apr 15, 2019•48 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
A photonic cluster state with a tree-type entanglement structure constitutes an efficient resource for quantum error correction of photon loss. But the generation of a tree cluster state with an arbitrary size is notoriously difficult. Here, we propose a protocol to deterministically generate photonic tree states of arbitrary size by using only a single quantum emitter. Photonic entanglement is established through both emission and rescattering from the same emitter, enabling fast and resource-efficient entanglement generation. The same protocol can also be extended to generate more general tree-type entangled states.
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.
Abstract We present protocols to generate arbitrary photonic graph states from quantum emitters that are in principle deterministic. We focus primarily on two-dimensional cluster states of arbitrary size due to their importance for measurement-based quantum computing. Our protocols for these and many other types of two-dimensional graph states require a linear array of emitters in which each emitter can be controllably pumped, rotated about certain axes, and entangled with its nearest neighbors. We show that an error on one emitter produces a localized region of errors in the resulting graph state, where the size of the region is determined by the coordination number of the graph. We describe how these protocols can be implemented for different types of emitters, including trapped ions, quantum dots, and nitrogen-vacancy centers in diamond.
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.