• DOI:10.1109/TIT.2013.2257936
Corpus ID: 7149863

Entanglement Detection: Complexity and Shannon Entropic Criteria

@article{Huang2013EntanglementDC,
  title={Entanglement Detection: Complexity and Shannon Entropic Criteria},
  author={Yichen Huang},
  journal={IEEE Transactions on Information Theory},
  year={2013},
  volume={59},
  pages={6774-6778}
}

Yichen Huang

Published 2013

Mathematics, Computer Science

IEEE Transactions on Information Theory

Entanglement plays a key role in quantum information. The separability problem arises: how to prove that a given quantum state is entangled? Covariance-matrix-based entanglement criteria are the most important and widely used approach to this problem in continuous variable systems. Here, the separability problem is systematically studied in the more experimentally realistic setting that the questioned state is only partly known. A simple general formalism is proposed for this variant of the… CONTINUE READING

View on IEEE

doi.org

Save to Library

Create Alert

Cite

Launch Research Feed