Algorithmic Design of Heralded Linear Optical Circuits for Multipartite Entanglement

@misc{kim2026algorithmic,
  title = {{Algorithmic Design of Heralded Linear Optical Circuits for Multipartite Entanglement}},
  author = {Jaehee Kim and Hon Wai Lau and William J. Munro and Joonsuk Huh and Seungbeom Chin},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.18002},
  eprint = {2609.18002},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.18002},
  note = {CC BY-NC-ND 4.0},
}

TY  - UNPB
TI  - Algorithmic Design of Heralded Linear Optical Circuits for Multipartite Entanglement
AU  - Jaehee Kim
AU  - Hon Wai Lau
AU  - William J. Munro
AU  - Joonsuk Huh
AU  - Seungbeom Chin
PY  - 2026
DA  - 2026/09/16
PB  - arXiv
DO  - 10.48550/arxiv.2609.18002
UR  - https://arxiv.org/abs/2609.18002
AB  - 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.
ER  -