发表机构
SKKU Advanced Institute of Nanotechnology (SAINT), Sungkyunkwan University; Okinawa Institute of Science and Technology Graduate University; Department of Chemistry, Yonsei University; Department of Quantum Information, Yonsei University; Department of Computational Science and Engineering, Yonsei University（成均馆大学 SKKU 纳米技术高级研究所 (SAINT); 冲绳科学技术大学院大学; 延世大学化学系; 延世大学量子信息系; 延世大学计算科学与工程系）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
该研究将预示光子电路设计转化为图搜索问题，利用线性量子图缩减搜索空间，自动构建并优化电路，为多种多体纠缠资源态提供高效设计方案。
AI 中文摘要
预示多体纠缠是各种量子信息任务的关键资源。然而，由于所需光学结构的复杂性，设计生成特定目标态的线性光学电路通常具有挑战性。在此，我们将预示光子电路的设计表述为一个算法图搜索问题。我们的框架通过使用线性量子图（LQG）图像大幅缩减搜索空间，实现了预示光子电路的自动构建和优化。我们的策略在该图像中将电路结构重构为图，并自动识别合适的图。因此，我们为广泛有用的多体资源态设计了高效方案，包括超图魔法态、量子纠错码、一般三量子比特态和长度-1毛毛虫图态。我们的工作建立了一个用于系统发现预示资源态的算法框架，为日益复杂的多体纠缠资源的自动设计奠定了基础。
英文摘要
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.
CommentsREVTex 4.2, 19 pages including Appendix, comments welcome
