Back to News
quantum-computing

Generation of Photonic Graph States with minimal number of quantum emitters

Konstantinos-Rafail Revis, Nils Tomke Ottink, Pierre-Emmanuel Emeriau, Paul Hilaire
Loading...
4 min read
0 likes
⚡ Quantum Brief
In total, we propose four distinct algorithms, which demonstrate up to $30\%$ emitter reduction on random graphs. 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. AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
AI Audio Summary
0:00 / 0:00
Click to play
figure-06.webp
Quantum News · Media Library

Quantum Physics arXiv:2609.30400 (quant-ph) [Submitted on 24 Sep 2026] Title:Generation of Photonic Graph States with minimal number of quantum emitters Authors:Konstantinos-Rafail Revis, Nils Tomke Ottink, Pierre-Emmanuel Emeriau, Paul Hilaire View a PDF of the paper titled Generation of Photonic Graph States with minimal number of quantum emitters, by Konstantinos-Rafail Revis and 3 other authors View PDF HTML (experimental) 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. Comments: Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2609.30400 [quant-ph] (or arXiv:2609.30400v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2609.30400 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Konstantinos-Rafail Revis [view email] [v1] Thu, 24 Sep 2026 18:04:39 UTC (6,825 KB) Full-text links: Access Paper: View a PDF of the paper titled Generation of Photonic Graph States with minimal number of quantum emitters, by Konstantinos-Rafail Revis and 3 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-09 References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Read Original

Tags

photonic-quantum
quantum-computing
quantum-algorithms
quantum-hardware
quantum-communication
quantum-error-correction

Source Information

Source: arXiv Quantum Physics

Discussion

0 professional contributions

Sign in to join this professional discussion.

Be the first to add a constructive contribution.