Generation of Photonic Graph States with minimal number of quantum emitters
Abstract
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.
Related
- Deterministic generation of large-scale photonic GHZ states utilizing spin echo in a solid-state quantum light source
- A programmable quantum photonic platform integrating coherent emitters
- Deterministic and Programmable Fusion for Scalable Generation of Photonic Graph States
- Enhanced Third-Harmonic Generation in Diamond Photonic Crystal Slabs via Doubly Resonant Quasi-Bound States in the Continuum
- Learning photonic quantum states
BibTeX
@misc{revis2026generation,
title = {{Generation of Photonic Graph States with minimal number of quantum emitters}},
author = {Konstantinos-Rafail Revis and Nils Tomke Ottink and Pierre-Emmanuel Emeriau and Paul Hilaire},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.30400},
eprint = {2609.30400},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.30400},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Generation of Photonic Graph States with minimal number of quantum emitters
AU - Konstantinos-Rafail Revis
AU - Nils Tomke Ottink
AU - Pierre-Emmanuel Emeriau
AU - Paul Hilaire
PY - 2026
DA - 2026/09/24
PB - arXiv
DO - 10.48550/arxiv.2609.30400
UR - https://arxiv.org/abs/2609.30400
AB - 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.
ER -