Quantum entanglement: an overview of the separability problem in two quantum bits
Honorine Gnonfin, Laure Gouba

TL;DR
This paper reviews the development of criteria for determining whether two quantum bits are entangled or separable, highlighting progress from Bell inequalities to recent separability criteria.
Contribution
It provides a comprehensive overview of the evolution of separability criteria in bipartite two-qubit systems from 1964 to 2018.
Findings
Progression from Bell inequalities to advanced separability criteria
Identification of key milestones in entanglement detection
Summary of recent advances in bipartite quantum systems
Abstract
The separability problem is one of the basic and emergent problems in the present and future quantum information processing. The latter focuses on information and computing based on quantum mechanics and uses quantum bits as its basic information units. In this paper, we present an overview of the progress in the separability problem in bipartite systems, more specifically in two quantum bits systems from the criterion based on the inequalities of Bell in to the recent criteria of separability in 2018.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography
