Metraipolis › archive › dc_548afa73d33e

Generation of Photonic Graph States with minimal number of quantum emitters — arXiv:2609.30400

Source: arXiv (en)
Original: https://arxiv.org/abs/2609.30400
License (as archived): CC0-1.0
Archived: 2026-10-08T03:44:24.088Z
SHA-256 of the archived text: 0088343775a692ddb2f30c957d0fc69cedc1bcfa37d5510c15979a1df56d836c
Stable URL of this page: https://metraipolis.com/documento/dc_548afa73d33e

How to cite

Generation of Photonic Graph States with minimal number of quantum emitters — arXiv:2609.30400 — arXiv (en), https://arxiv.org/abs/2609.30400 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_548afa73d33e (Metraipolis archive dc_548afa73d33e, sha256 0088343775a692ddb2f30c957d0fc69cedc1bcfa37d5510c15979a1df56d836c)

BibTeX

@misc{dc548afa73d33e,
  title = {Generation of Photonic Graph States with minimal number of quantum emitters — arXiv:2609.30400},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.30400},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_548afa73d33e; sha256 0088343775a692ddb2f30c957d0fc69cedc1bcfa37d5510c15979a1df56d836c},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.30400. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-28 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.30400 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T03:14:19.097Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-28?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).