In this paper, we present an overview of the progress in the separability problem in bipartite systems, more specifically in a two quantum bits (qubits) system, from the separability criterion based on Bell’s inequalities in 1964 to the recent separability criteria.
When developing and operating quantum computers, it is necessary to be able to check quantum registers for the presence of quantum entanglement between its subsystems, due to which quantum computers gain computational advantage in solving many problems over classical computers. The state in which a quantum system consists of two or more subsystems that are not entangled with each other is called separable.In this article, we provide an overview of various existing approaches to solving the problem of determining separability in a quantum system. To do this, we provide an overview of works on this topic, describing both established and new approaches, highlighting directions in which new possibilities for solving the problem can be explored. We provide a definition of the problem of checking a system for separability, based on which we describe several applicable separability criteria. We provide a model-theoretic approach to solving the separability problem, describing a quantum system as a blurry model.
Generally,to decide a given quantum state to be entangled or not,or to be useful for quantum information processing purposes is a difficult question.In this note,the separability of quantum states in bipartite quantum systems is investigated.According to the analysis of the expanded form of density matrix in the separable quantum state and the relationship of expansion coefficient,a new separability criterion of bipartite quantum states is obtained: if a quantum state in a bipartite quantum system of arbitrary dimension is separable,the expansion coefficient satisfies certain inequality.This method requires only the dimensions of systems and the expansion coefficient of density matrix which can be easily got,and the computation is easy,so it has its application value.