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

Journal of Modern Optics

Separability of entangled q-bit pairs

NASSER METWALLY

Published Oct 15, 2000• 7 citations
Publisher

Abstract

The state of an entangled q-bit pair is specified by 15 numerical parameters that are naturally regarded as the components of two 3-vectors and a 3 × 3-dyadic.There are easy-to-use criteria to check whether a given pair of 3-vectors plus a dyadic specify a 2-q-bit state; and if they do, whether the state is entangled; and if it is, whether it is a separable state.Some progress has been made in the search for analytical expressions for the degree of separability.We report, in particular, the answer in the case of vanishing 3-vectors.

DOI
10.1080/095003400420076

Related papers

Separability of entangled q-bit pairs

Berthold‐Georg Englert, NASSER METWALLY

The state of an entangled q-bit pair is specified by 15 numerical parameters that are naturally regarded as the components of two 3-vectors and a 3 × 3 dyadic. There are easy-to-use criteria to check whether a given pair of 3-vectors plus a dyadic specify a 2-q-bit state; and if they do, whether the state is entangled; and if it is, whether it is a separable state. Some progress has been made in the search for analytical expressions for the degree of separability. We report, in particular, the answer in the case of vanishing 3-vectors.

arXiv:quant-ph/9912089•Journal of Modern Optics•Oct 1, 2000•42 citations

Kinematics of qubit pairs

Berthold‐Georg Englert, NASSER METWALLY

Abstract We review some of the important properties of the states of qubit pairs. They are specified by 15 numerical parameters that are naturally regarded as the components of two 3-vectors and a 3 × 3dyadic. There are six classes of families of locally equivalent states in a straightforward scheme for classifying all 2-qubit states; four of the classes consist of two subclasses each. Easy-to-use criteria enable one to check whether a given pair of 3-vectors plus a 3× 3-dyadic specify a 2-qubit state; and if they do, whether the state is entangled; and if it is, whether it is a separable state. We remark on the Hill-Wootters concurrence, discuss the properties of the fundamental Lewenstein-Sanpera decompositions of 2-qubit states, and report a number of examples for which the optimal decomposition is known explicitly.

Chapman & Hall/CRC eBooks•Feb 14, 2002•0 citations

A discussion on separability criteria

Shengjun Wu

The separability problem in quantum information theory was discussed and new separability criteria was searched for in order to tell whether a given quantum state is separable or entangled.Some properties of separable states as well as some separability criteria for special cases were obtained,and our discussion was focused on quantum states in a Hilbert space of 2×N or N×2.

•Jan 1, 2010•0 citations

Remarks on 2-q-bit states

Berthold‐Georg Englert, Nasser Metwally, Sektion Physik

We distinguish six classes of families of locally equivalent states in a straightforward scheme for classifying all 2-q-bit states; four of the classes consist of two subclasses each. The simple criteria that we stated recently for checking a given state's positivity and separability are justified, and we discuss some important properties of Lewenstein-Sanpera decompositions. An upper bound is conjectured for the sum of the degree of separability of a 2-q-bit state and its concurrence.

•Jan 1, 2000•16 citations

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

Explore Simpler Eigenmarking: Quantum Entailment Model Checking

Tatpong Katanyukul

Targeting entailment model checking, a recent study has pioneered an idea of Eigenmarking search, an improvement over Grover search using extra qubits. The extra qubits condition the quantum state evolution such that the answer states (if exist) are always in the minority. The minority criteria is essential to Grover probability-amplitude amplification and consequently the effectiveness of Grover search. In addition to enforce the minority criteria, Eigenmarking also employs complementary states (through well-orchestrated phase rotation) for easy identification of a no-answer case (related to a no-violation case in the context of model checking). Eigenmarking search has been shown effective in two-qubit simulations. The three Eigenmarking schemes have been previously proposed. Two schemes require two extra qubits. One scheme (called ``subtle marking'') requires one extra qubit with a multiple-qubit-controlled phase rotation. Our study refines the mechanism using only one extra qubit with only two-qubit-controlled phase rotation, commonly known as \texttt{ccz}, regardless of how many qubits the input has. Using a multiple-qubit-controlled phase rotation (as in subtle marking) associates with highly entangled states. Highly entangled states in a real quantum hardware are difficult (or in some cases may even be unachievable) particularly in a scaled up scenario involving many qubits. Our proposed new Eigenmarking scheme has lightened the burden for the hardware requirement. The new Eigenmarking search has been experimented in two-qubit-system simulations and shown viable, achieving the minimal relative local winning margin of W=3.17 and the worst-case distinguishability of D=0.769 (cf. W=0.67; D=0.19 from conventional marking and W=0.28; D=0.55 from subtle marking).

quant-pharXiv:2604.23531•Apr 28, 2026•0 citations
The state of an entangled q-bit pair is specified by 15 numerical parameters that are naturally regarded as the components of two 3-vectors and a 3 × 3-dyadic.There are easy-to-use criteria to check whether a given pair of 3-vectors plus a dyadic specify a 2-q-bit state; and if they do, whether the state is entangled; and if it is, whether it is a separable state.Some progress has been made in the search for analytical expressions for the degree of separability.We report, in particular, the answer in the case of vanishing 3-vectors.
The state of an entangled q-bit pair is specified by 15 numerical parameters that are naturally regarded as the components of two 3-vectors and a 3 × 3 dyadic. There are easy-to-use criteria to check whether a given pair of 3-vectors plus a dyadic specify a 2-q-bit state; and if they do, whether the state is entangled; and if it is, whether it is a separable state. Some progress has been made in the search for analytical expressions for the degree of separability. We report, in particular, the answer in the case of vanishing 3-vectors.
Abstract We review some of the important properties of the states of qubit pairs. They are specified by 15 numerical parameters that are naturally regarded as the components of two 3-vectors and a 3 × 3dyadic. There are six classes of families of locally equivalent states in a straightforward scheme for classifying all 2-qubit states; four of the classes consist of two subclasses each. Easy-to-use criteria enable one to check whether a given pair of 3-vectors plus a 3× 3-dyadic specify a 2-qubit state; and if they do, whether the state is entangled; and if it is, whether it is a separable state. We remark on the Hill-Wootters concurrence, discuss the properties of the fundamental Lewenstein-Sanpera decompositions of 2-qubit states, and report a number of examples for which the optimal decomposition is known explicitly.
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.
Targeting entailment model checking, a recent study has pioneered an idea of Eigenmarking search, an improvement over Grover search using extra qubits. The extra qubits condition the quantum state evolution such that the answer states (if exist) are always in the minority. The minority criteria is essential to Grover probability-amplitude amplification and consequently the effectiveness of Grover search. In addition to enforce the minority criteria, Eigenmarking also employs complementary states (through well-orchestrated phase rotation) for easy identification of a no-answer case (related to a no-violation case in the context of model checking). Eigenmarking search has been shown effective in two-qubit simulations. The three Eigenmarking schemes have been previously proposed. Two schemes require two extra qubits. One scheme (called ``subtle marking'') requires one extra qubit with a multiple-qubit-controlled phase rotation. Our study refines the mechanism using only one extra qubit with only two-qubit-controlled phase rotation, commonly known as \texttt{ccz}, regardless of how many qubits the input has. Using a multiple-qubit-controlled phase rotation (as in subtle marking) associates with highly entangled states. Highly entangled states in a real quantum hardware are difficult (or in some cases may even be unachievable) particularly in a scaled up scenario involving many qubits. Our proposed new Eigenmarking scheme has lightened the burden for the hardware requirement. The new Eigenmarking search has been experimented in two-qubit-system simulations and shown viable, achieving the minimal relative local winning margin of W=3.17 and the worst-case distinguishability of D=0.769 (cf. W=0.67; D=0.19 from conventional marking and W=0.28; D=0.55 from subtle marking).