2009/03/04 by Pavel Lougovski, S. J. van Enk, Kyung Soo Choi +4 · 38 citations
Computer Science · Physics and Astronomy · #Algorithm #Construct (python library) #Ideal (ethics) #Law #Mode (computer interface) #Multipartite #Multipartite entanglement #Photon #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum entanglement #Quantum mechanics #Squashed entanglement #State (computer science) #Statistical physics #W state #quant-ph
paper · pdf · doi:10.1088/1367-2630/11/6/063029
published in New Journal of Physics 11(6), 063029 (IOP Publishing) · 11 pages, 12 figures
arxiv created 2009/03/04 · openalex publication_date 2009/06/16 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/06
We construct a method for verifying mode entanglement of N -mode W states. The ideal W state contains exactly one excitation symmetrically shared between N modes, but our method takes the existence of higher numbers of excitations into account, as well as the vacuum state and other deviations from the ideal state. Moreover, our method distinguishes between full N -party entanglement and states with M -party entanglement with M < N , including mixtures of the latter. We specialize to the case N =4 for illustrative purposes. In the optical case, where excitations are photons, our method can be implemented using linear optics.