2022/03/14 by Xu-Fei Yin, Yuxuan Du, Yue-Yang Fei +10
Computer Science · Physics and Astronomy · #Bipartite graph #Multipartite #Multipartite entanglement #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum algorithm #Quantum capacity #Quantum entanglement #Quantum network #Quantum teleportation #Squashed entanglement #W state #quant-ph
paper · pdf · doi:10.1103/physrevlett.128.110501
published as Phys. Rev. Lett. 128, 110501 (2022) · 7 pages, 3 figures
openalex publication_date 2022/03/14 · arxiv created 2022/03/15 · arxiv updated 2022/03/16 · openalex created_date 2022/04/03 · openalex updated_date 2026/08/05
The recognition of entanglement states is a notoriously difficult problem when no prior information is available. Here, we propose an efficient quantum adversarial bipartite entanglement detection scheme to address this issue. Our proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits, where a two-outcome measurement can be used to query a classical binary result about whether the input state is bipartite entangled or not. In principle, for an N-qubit quantum state, the runtime complexity of our proposal is O(poly(N)T) with T being the number of iterations. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states. Our work paves the way for using near-term quantum machines to tackle entanglement detection on multipartite entangled quantum systems.