Speaker: Seungbeom Chin (ICTQT / Sungkyunkwan University)
Abstract
We propose a graph method to systematically search for schemes that obtains genuine entanglement in arbitrary N-partite linear quantum networks (LQNs). While the indistinguishability of quantum particles is widely used as a resource for the generation of entanglement, it is challenging to devise a suitable LQN that carries a specific entangled state. Our research presents a mapping process of arbitrary LQNs to graphs, which provides an organized strategy for designing LQNs to generate multipartite entanglement with and without postselection. This talk is based on Quantum 5 (2021), 611 and arXiv:2211.04042.