Purification of photonic graph states
This work significantly advances fault-tolerant photonic quantum computing by enabling high-fidelity graph states with practical, scalable purification, reducing reliance on error-prone probabilistic generation methods.

Understand this faster with AI
Quantum Physics arXiv:2609.01710 (quant-ph) [Submitted on 1 Sep 2026] Title:Purification of photonic graph states Authors:Matthias C. Löbl, Aliki A. Capatos, Ming Lai Chan, Peter Lodahl, Anders Søndberg Sørensen, Stefano Paesani View a PDF of the paper titled Purification of photonic graph states, by Matthias C. L\"obl and 5 other authors View PDF HTML (experimental) Abstract: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. Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2609.01710 [quant-ph] (or arXiv:2609.01710v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2609.01710 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Matthias Christian Löbl [view email] [v1] Tue, 1 Sep 2026 18:00:01 UTC (965 KB) Full-text links: Access Paper: View a PDF of the paper titled Purification of photonic graph states, by Matthias C. L\"obl and 5 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?)
Tags
Source Information
Discussion
0 professional contributions
Sign in to join this professional discussion.
Be the first to add a constructive contribution.
