Metraipolis › archive › dc_fbd55979efba

Algorithmic Design of Heralded Linear Optical Circuits for Multipartite Entanglement — arXiv:2609.18002

Source: arXiv (en)
Original: https://arxiv.org/abs/2609.18002
License (as archived): CC0-1.0
Archived: 2026-10-15T17:14:10.097Z
SHA-256 of the archived text: 6155abef34ecec00d872551f5df43b6fd13166bfe5b36fe51fc5e17f835ecf49
Stable URL of this page: https://metraipolis.com/documento/dc_fbd55979efba

How to cite

Algorithmic Design of Heralded Linear Optical Circuits for Multipartite Entanglement — arXiv:2609.18002 — arXiv (en), https://arxiv.org/abs/2609.18002 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fbd55979efba (Metraipolis archive dc_fbd55979efba, sha256 6155abef34ecec00d872551f5df43b6fd13166bfe5b36fe51fc5e17f835ecf49)

BibTeX

@misc{dcfbd55979efba,
  title = {Algorithmic Design of Heralded Linear Optical Circuits for Multipartite Entanglement — arXiv:2609.18002},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.18002},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fbd55979efba; sha256 6155abef34ecec00d872551f5df43b6fd13166bfe5b36fe51fc5e17f835ecf49},
  year = {2026}
}

Archived text

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

Heralded multipartite entanglement is a key resource for various quantum information tasks. However, designing linear optical circuits that generate specific target states is generally challenging due to the complexity of the required optical structures. Here we formulate the design of heralded photonic circuits as an algorithmic graph-search problem. Our framework enables the automated construction and optimization of heralded photonic circuits by substantially reducing the search space using the linear quantum graph (LQG) picture. Our strategy reconstructs circuit structures as graphs in the picture and identifies suitable graphs automatically. As a result, we design efficient schemes for a broad range of useful multipartite resource states, including hypergraph magic states, quantum error correcting codes, general three-qubit states and length-1 caterpillar graph states. Our work establishes an algorithmic framework for the systematic discovery of heralded resource states, laying the foundation for the automated design of increasingly complex multipartite entangled resources.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-17 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.18002 — 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-15T16:20:45.838Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).