Purification of photonic graph states

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.

Generation of Photonic Graph States with minimal number of quantum emitters
Konstantinos-Rafail Revis, Nils Tomke Ottink, Pierre-Emmanuel Emeriau +1
arXiv24 Sep 2026PreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
Deterministic and Programmable Fusion for Scalable Generation of Photonic Graph States
Yan Li, Yunfan Yang, Zenghui Bao +6
arXiv14 Oct 2026PreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
Entanglement of purification for Werner states: canonical purification and nonadditivity
Zahra Baghali Khanian, Amir-Reza Negari
arXiv2 Oct 2026PreprintarXiv licenceFull textGeneral mathematics Quantum physics & quantum informationarXiv
Learning photonic quantum states
Hugo Thomas, Ulysse Chabaud, Pierre-Emmanuel Emeriau
PRX Quantum16 Oct 2026Peer-reviewedPublisher termsQuantum physics & quantum informationCrossref
Triple-band nonreciprocal optical Tamm states in a Weyl-semimetal/Fibonacci-type photonic heterostructure
Jipeng Wu, Lingfeng Liao, Yulei Liao +3
Optics Express12 Oct 2026Peer-reviewedPublisher termsAtomic, molecular & optical physicsCrossref

Cite

BibTeX RIS

BibTeX

@misc{lobl2026purification,
  title = {{Purification of photonic graph states}},
  author = {Matthias C. Löbl and Aliki A. Capatos and Ming Lai Chan and Peter Lodahl and Anders Søndberg Sørensen and Stefano Paesani},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.01710},
  eprint = {2609.01710},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.01710},
}

RIS

TY  - UNPB
TI  - Purification of photonic graph states
AU  - Matthias C. Löbl
AU  - Aliki A. Capatos
AU  - Ming Lai Chan
AU  - Peter Lodahl
AU  - Anders Søndberg Sørensen
AU  - Stefano Paesani
PY  - 2026
DA  - 2026/09/08
PB  - arXiv
DO  - 10.48550/arxiv.2609.01710
UR  - https://arxiv.org/abs/2609.01710
AB  - 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.
ER  -

Abstract

Related

Cite