2000 character limit reached
Entanglement detection via general SIC-POVMs
Published 2 Nov 2015 in quant-ph, math-ph, and math.MP | (1511.00368v2)
Abstract: We study separability problem using general symmetric informationally complete measurements and propose separability criteria in $\mathbb{C}{d_{1}}\otimes\mathbb{C}{d_{2}}$ and $\mathbb{C}{d_{1}}\otimes\mathbb{C}{d_{2}}\cdots\otimes\mathbb{C}{d_{n}}$. Our criteria just require less local measurements and provide experimental implementation in detecting entanglement of unknown quantum states.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.