Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Scientific-Technical Conference on Actual Problems of Electronic Instrument Engineering (APEIE)

On the Separability Problem of Quantum Systems

Яхъяева Гульнара Эркиновна, Vladimir Kharchenko

Published Nov 14, 2025• 0 citations
Publisher

Abstract

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.

DOI
10.1109/apeie66761.2025.11289275

Related papers

Separability criteria and method of measurement for entanglement

Siti Munirah Mohd, Bahari Idrus, Muriati Bt. Mukhtar

Quantum computers have the potentials to solve certain problems faster than classical computers. In quantum computer, entanglement is one of the elements beside superposition. Recently, with the advent of quantum information theory, entanglement has become an important resource for Quantum Information and Computation. The purpose of this paper is to discuss the separability criteria and method of measurement for entanglement. This paper is aimed at viewing the method that has been proposed in previous works in bipartite and multipartite entanglement. The outcome of this paper is to classify the different method that used to measure entanglement for bipartite and multipartite cases including the advantage and disadvantage of each method.

AIP conference proceedings•Jan 1, 2014•1 citation

Quantum entanglement: an overview of the separability problem in two quantum bits

Honorine Gnonfin, Laure Gouba

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 $1964$ to the recent criteria of separability in 2018.

arXiv:2208.04747•Aug 1, 2022•0 citations

On the distinction between entangled and separable states of quantum registers

Philippe Jorrand, Mehdi Mhalla

Quantum computing operates in three stages: (i) preparation of the initial states of the n qubits of a register, (ii) step by step transformation of the state of this register by unitary operators which compose the quantum program, and (iii), measurement of all or some of the qubits of the register. The existence of quantum algorithms which are exponentially less complex than their classical counterparts for some classes of problems, stems from entangled states established by multi-qubit unitary operators within the quantum program. A register of n qubits is a quantum system composed of n quantum subsystems. The state |/spl psi/> of a quantum system composed of two quantum subsystems A and B is said to be entangled when |/spl psi/> is not reducible to a pair composed of a state |/spl psi/> of A and a state |/spl psi//sub B/> of B: such situations have no counterpart in the classical world. In quantum theory, such a pair of states is denoted by a tensor product: |/spl psi/> is entangled if it cannot be factorized into the tensor product |/spl psi//sub A/>/spl ominus/|/spl psi//sub B/>. This paper establishes conditions according to which it is possible to tell whether or not the state of a register of n qubits is entangled. The state of a single qubit is a vector /spl alpha/|0>+/spl beta/|1> of unit norm in a 2-dimensional vector space, where |0> and |1> are the two basis states and where a and are complex amplitudes. Then, if both A and B are qubits, the most general form of the state of a register composed of the 2 qubits A and B is also a vector of unit norm, but now in a 4-dimensional space: |/spl psi/>=/spl alpha/|00>+/spl beta/|01+/spl gamma/|10>+/spl sigma/|11>. It is straightforward to prove that |/spl psi/> can be factorized into |/spl psi//sub A/>/spl ominus/|/spl psi//sub B/> if and only if /spl alpha//spl delta/=/spl beta//spl gamma/. In such a case, |/spl psi/> is said to be separable, i.e. not entangled. This paper generalizes this form of condition to registers of n qubits. If |/spl psi/> is the state of a register of n qubits, two different questions about the separability of |/spl psi/> are answered: (i) is |/spl psi/> separable into a product |/spl psi//sub 1/>/spl ominus/|/spl psi//sub 2/>/spl ominus/L/spl ominus/|/spl psi//sub n/> of n single qubit states? and (ii), is |/spl psi/> separable into a product |/spl psi//sub A/>/spl ominus/|/spl psi//sub B/> of the states of two subregisters A and B, respectively containing p and q adjacent qubits with p+q=n? For both questions, necessary and sufficient conditions are given.

IEEE Conference on Nanotechnology (IEEE NANO)•Jun 25, 2003•0 citations

Improved algorithm for quantum separability and entanglement detection

Lawrence M. Ioannou, B. C. Travaglione, Donny Cheung +1 more

Determining whether a quantum state is separable or entangled is a problem of fundamental importance in quantum information science. It has recently been shown that this problem is NP-hard, suggesting that an efficient, general solution does not exist. There is a highly inefficient ``basic algorithm'' for solving the quantum separability problem which follows from the definition of a separable state. By exploiting specific properties of the set of separable states, we introduce a classical algorithm that solves the problem significantly faster than the ``basic algorithm,'' allowing a feasible separability test where none previously existed, e.g., in $3\ifmmode\times\else\texttimes\fi{}3$-dimensional systems. Our algorithm also provides a unique tool in the experimental detection of entanglement.

arXiv:quant-ph/0403041•Physical Review A•Dec 15, 2004•32 citations

Quantum entanglement in finite-dimensional Hilbert spaces

Szilárd Szalay

In the past decades, quantum entanglement has been recognized to be the basic resource in quantum information theory. A fundamental need is then the understanding its qualification and its quantification: Is the quantum state entangled, and if it is, then how much entanglement is carried by that? These questions introduce the topics of separability criteria and entanglement measures, both of which are based on the issue of classification of multipartite entanglement. In this dissertation, after reviewing these three fundamental topics for finite dimensional Hilbert spaces, I present my contribution to knowledge. My main result is the elaboration of the partial separability classification of mixed states of quantum systems composed of arbitrary number of subsystems of Hilbert spaces of arbitrary dimensions. This problem is simple for pure states, however, for mixed states it has not been considered in full detail yet. I give not only the classification but also necessary and sufficient criteria for the classes, which make it possible to determine to which class a mixed state belongs. Moreover, these criteria are given by the vanishing of quantities measuring entanglement. Apart from these, I present some side results related to the entanglement of mixed states. These results are obtained in the learning phase of my studies and give some illustrations and examples.

arXiv:1302.4654•Feb 19, 2013•6 citations

Quantum Entanglement: Criteria and Collective Tests

Asher Peres

The state of a quantum system, consisting of two distinct subsystems, is called separable if it can be prepared by two distant experimenters who receive instructions from a common source, via classical communication channels. A necessary condition is derived and is shown to be more sensitive than Bell's inequality for detecting quantum inseparability. Moreover, collective tests of Bell's inequality (namely, tests that involve several composite systems simultaneously) may sometimes lead to a violation of Bell's inequality, even if the latter is satisfied when each composite system is tested separately.

arXiv:quant-ph/9707026•Physica Scripta•Jan 1, 1998•8 citations
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.
Quantum computers have the potentials to solve certain problems faster than classical computers. In quantum computer, entanglement is one of the elements beside superposition. Recently, with the advent of quantum information theory, entanglement has become an important resource for Quantum Information and Computation. The purpose of this paper is to discuss the separability criteria and method of measurement for entanglement. This paper is aimed at viewing the method that has been proposed in previous works in bipartite and multipartite entanglement. The outcome of this paper is to classify the different method that used to measure entanglement for bipartite and multipartite cases including the advantage and disadvantage of each method.
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 196419641964 to the recent criteria of separability in 2018.
Quantum computing operates in three stages: (i) preparation of the initial states of the n qubits of a register, (ii) step by step transformation of the state of this register by unitary operators which compose the quantum program, and (iii), measurement of all or some of the qubits of the register. The existence of quantum algorithms which are exponentially less complex than their classical counterparts for some classes of problems, stems from entangled states established by multi-qubit unitary operators within the quantum program. A register of n qubits is a quantum system composed of n quantum subsystems. The state |/spl psi/> of a quantum system composed of two quantum subsystems A and B is said to be entangled when |/spl psi/> is not reducible to a pair composed of a state |/spl psi/> of A and a state |/spl psi//sub B/> of B: such situations have no counterpart in the classical world. In quantum theory, such a pair of states is denoted by a tensor product: |/spl psi/> is entangled if it cannot be factorized into the tensor product |/spl psi//sub A/>/spl ominus/|/spl psi//sub B/>. This paper establishes conditions according to which it is possible to tell whether or not the state of a register of n qubits is entangled. The state of a single qubit is a vector /spl alpha/|0>+/spl beta/|1> of unit norm in a 2-dimensional vector space, where |0> and |1> are the two basis states and where a and are complex amplitudes. Then, if both A and B are qubits, the most general form of the state of a register composed of the 2 qubits A and B is also a vector of unit norm, but now in a 4-dimensional space: |/spl psi/>=/spl alpha/|00>+/spl beta/|01+/spl gamma/|10>+/spl sigma/|11>. It is straightforward to prove that |/spl psi/> can be factorized into |/spl psi//sub A/>/spl ominus/|/spl psi//sub B/> if and only if /spl alpha//spl delta/=/spl beta//spl gamma/. In such a case, |/spl psi/> is said to be separable, i.e. not entangled. This paper generalizes this form of condition to registers of n qubits. If |/spl psi/> is the state of a register of n qubits, two different questions about the separability of |/spl psi/> are answered: (i) is |/spl psi/> separable into a product |/spl psi//sub 1/>/spl ominus/|/spl psi//sub 2/>/spl ominus/L/spl ominus/|/spl psi//sub n/> of n single qubit states? and (ii), is |/spl psi/> separable into a product |/spl psi//sub A/>/spl ominus/|/spl psi//sub B/> of the states of two subregisters A and B, respectively containing p and q adjacent qubits with p+q=n? For both questions, necessary and sufficient conditions are given.
Determining whether a quantum state is separable or entangled is a problem of fundamental importance in quantum information science. It has recently been shown that this problem is NP-hard, suggesting that an efficient, general solution does not exist. There is a highly inefficient ``basic algorithm'' for solving the quantum separability problem which follows from the definition of a separable state. By exploiting specific properties of the set of separable states, we introduce a classical algorithm that solves the problem significantly faster than the ``basic algorithm,'' allowing a feasible separability test where none previously existed, e.g., in $3\ifmmode\times\else\texttimes\fi{}3$-dimensional systems. Our algorithm also provides a unique tool in the experimental detection of entanglement.
In the past decades, quantum entanglement has been recognized to be the basic resource in quantum information theory. A fundamental need is then the understanding its qualification and its quantification: Is the quantum state entangled, and if it is, then how much entanglement is carried by that? These questions introduce the topics of separability criteria and entanglement measures, both of which are based on the issue of classification of multipartite entanglement. In this dissertation, after reviewing these three fundamental topics for finite dimensional Hilbert spaces, I present my contribution to knowledge. My main result is the elaboration of the partial separability classification of mixed states of quantum systems composed of arbitrary number of subsystems of Hilbert spaces of arbitrary dimensions. This problem is simple for pure states, however, for mixed states it has not been considered in full detail yet. I give not only the classification but also necessary and sufficient criteria for the classes, which make it possible to determine to which class a mixed state belongs. Moreover, these criteria are given by the vanishing of quantities measuring entanglement. Apart from these, I present some side results related to the entanglement of mixed states. These results are obtained in the learning phase of my studies and give some illustrations and examples.
The state of a quantum system, consisting of two distinct subsystems, is called separable if it can be prepared by two distant experimenters who receive instructions from a common source, via classical communication channels. A necessary condition is derived and is shown to be more sensitive than Bell's inequality for detecting quantum inseparability. Moreover, collective tests of Bell's inequality (namely, tests that involve several composite systems simultaneously) may sometimes lead to a violation of Bell's inequality, even if the latter is satisfied when each composite system is tested separately.