Verifying the quantumness of bipartite correlations
arXiv:1510.03240 · doi:10.1103/PhysRevLett.116.230403
Abstract
Entanglement is at the heart of most quantum information tasks, and therefore considerable effort has been made to find methods of deciding the entanglement content of a given bipartite quantum state. Here, we prove a fundamental limitation to deciding if an unknown state is entangled or not: we show that any quantum measurement which can answer this question necessarily gives enough information to identify the state completely. Therefore, only prior information regarding the state can make entanglement detection less expensive than full state tomography in terms of the demanded quantum resources. We also extend our treatment to other classes of correlated states by considering the problem of deciding if a state is NPT, discordant, or fully classically correlated. Remarkably, only the question related to quantum discord can be answered without resorting to full state tomography.
References in corpus (4)
Cited by in corpus (14)
- Self-testing through EPR-steering
- Single-copy entanglement detection
- Tomography is necessary for universal entanglement detection with single-copy observables
- Deep learning of quantum entanglement from incomplete measurements
- Universal detection of entanglement in two-qubit states using only two copies
- Quantification of Concurrence via Weak Measurement
- Generating and detecting bound entanglement in two-qutrits using a family of indecomposable positive maps
- Probing quantum state space: does one have to learn everything to learn something?
- Determining quantum coherence with minimal resources
- Overcomplete quantum tomography of a path-entangled two-photon state
- Cluster Mean-Field Signature of Entanglement Entropy in Bosonic Superfluid-Insulator Transitions
- Entanglement Verification, with or without tomography
- Obtaining conclusive information from incomplete experimental quantum tomography
- Robust entanglement detection in arbitrary two-mode Gaussian state: a Stokes-like operator-based approach