Entanglement Detection: Complexity and Shannon Entropic Criteria

@article{Huang2013EntanglementDC,
  title={Entanglement Detection: Complexity and Shannon Entropic Criteria},
  author={Y. Huang},
  journal={IEEE Transactions on Information Theory},
  year={2013},
  volume={59},
  pages={6774-6778}
}
  • Y. 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… Expand
11 Citations
On Generalized Stam Inequalities and Fisher-Rényi Complexity Measures
  • 4
  • PDF
Open-system dynamics of entanglement: a key issues review.
  • 183
  • PDF
Computing quantum discord is NP-complete
  • 29
Computing quantum discord is NP-complete
  • 123
  • PDF
Continuous-variable entropic uncertainty relations
  • 14
  • PDF
Classical simulation of quantum many-body systems
  • 13
Quantum-memory-assisted entropic uncertainty relations
  • 21
  • PDF
Rényi and Tsallis formulations of separability conditions in finite dimensions
  • PDF
A family of generalized quantum entropies: definition and properties
  • 36
  • PDF
...
1
2
...

References

SHOWING 1-10 OF 45 REFERENCES
Computational complexity of the quantum separability problem
  • L. Ioannou
  • Computer Science, Mathematics
  • Quantum Inf. Comput.
  • 2007
  • 69
  • PDF
Classical complexity and quantum entanglement
  • L. Gurvits
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 2004
  • 186
  • PDF
Quantum entanglement beyond Gaussian criteria
  • 29
  • PDF
Strong NP-hardness of the quantum separability problem
  • 125
  • PDF
Classical deterministic complexity of Edmonds' Problem and quantum entanglement
  • 306
  • PDF
Extremality of Gaussian quantum states.
  • 190
  • PDF
...
1
2
3
4
5
...