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

Modern Physics Letters A

Implementation of the entanglement measure in quantum gates language

Naser Karimi, Marziyeh Yahyavi

Published Sep 14, 2022• 1 citation
Publisher

Abstract

Entanglement is an important resource for quantum technologies that allow us to go beyond the classical world. Quantum systems can be entangled in various ways. Also, the degree of entanglement between the subsystems of a quantum system can be calculated in different ways. In our recent paper [Prog. Theor. Exp. Phys. (2022)], we directly measure the three-tangle of a pure three-qubit quantum state. In this paper, we extend this method to pure N-qubit quantum states (N is any odd number greater than 1) by considering polynomial invariant of degree 4 as a measure of entanglement. In this algorithm, we use quantum gates and output probabilities to calculate polynomial invariant of degree 4. The importance of this method lies in the possibility of experimental implementation of quantum calculations in the language of quantum gates.

DOI
10.1142/s0217732322501905

Related papers

Quantum circuit for the direct measurement of the three-tangle of three-qubit states

Marziyeh Yahyavi, M. A. Jafarizadeh, Naser Karimi +1 more

Abstract Understanding how to decompose quantum computations in the language of the shortest possible sequence of quantum gates is of interest to many researchers due to the importance of the experimental implementation of the desired quantum computations. We contribute to this research by providing a quantum circuit to directly measure the three-tangle of three-qubit quantum states. Direct measurement of outcome probabilities in the computational basis quantifies the three-tangle of the three-qubit quantum states.

Progress of Theoretical and Experimental Physics•Jul 26, 2022•6 citations

The three kinds of three-qubit entanglement

Szilárd Szalay

We construct an important missing piece in the entanglement theory of pure three-qubit states, which is a polynomial measure of W-entanglement. This works in parallel to the three-tangle, which is a polynomial measure of GHZ-entanglement, and to the bipartite concurrence, which is a polynomial measure of bipartite entanglement. We also show that these entanglement measures are ordered, the bipartite measure is larger than the W measure, which is larger than the GHZ measure. It is meaningful then to consider these three types of three-qubit entanglement, which are also ordered, bipartite is weaker than W, which is weaker than GHZ, in parallel to the order of the three kinds of equivalence classes of entangled three-qubit states.

quant-pharXiv:2511.07617•Quantum•Nov 12, 2025•0 citations

Upper bound on three-tangles of reduced states of four-qubit pure states

S. Shelly Sharma, Naresh Kumar Sharma

Closed formulas for upper bounds on three-tangles of three-qubit reduced states in terms of three-qubit--invariant polynomials of pure four-qubit states are obtained. Our results offer tighter constraints on total three-way entanglement of a given qubit with the rest of the system than those used by Regula et al. [Phys. Rev. Lett. 113, 110501 (2014) and Phys. Rev. Lett. 116, 049902(E) (2016)] to verify monogamy of four-qubit quantum entanglement.

arXiv:1610.03916•Physical Review A•Jun 6, 2017•3 citations

Local qubit invariants on quantum computer

Szilárd Szalay, Frédéric Holweck

We present two general methods to implement quantum circuits for the direct measuring of local unitary invariants on quantum computers. We work these out for important three-qubit invariants, and also demonstrate these on the IBM Quantum Platform for important entanglement measures of three qubits.

quant-pharXiv:2604.15920•Physica Scripta•Apr 20, 2026•0 citations

An entanglement measure for n qubits

Dafa Li, Xiangrong Li, Hongtao Huang +1 more

Coffman et al. [Phys. Rev. A 61, 052306 (2000)] introduced the residual entanglement for three qubits. In this paper, we present the entanglement measure τ(ψ) for even n qubits; for odd n qubits, we propose the residual entanglement τ(i)(ψ) with respect to qubit i and the odd n-tangle R(ψ) by averaging the residual entanglement with respect to each qubit. In this paper, we show that these measures are LU-invariant, entanglement monotones, invariant under permutations of the qubits, and multiplicative in some cases.

arXiv:0710.3425•Journal of Mathematical Physics•Jan 1, 2009•17 citations

INVARIANT POLYNOMIALS WITH APPLICATIONS TO QUANTUM COMPUTING

Alimzhan Amanov

In quantum information theory, understanding the complexity of entangled states within the context of SLOCC (stochastic local operations and classical communications) involving d qubits (or qudits) is essential for advancing our knowledge of quantum systems. This complexity is often analyzed by classifying the states via local symmetry groups. The resulting classes can be distinguished using invariant polynomials, which serve as a measure of entanglement. This paper introduces a novel method for obtaining invariant polynomials of the smallest degrees, which significantly enhances the efficiency of characterizing SLOCC classes of entangled quantum states. Our method not only simplifies the process of identifying these classes but also provides a robust tool for analyzing the entanglement properties of complex quantum systems. As a practical application, we demonstrate the derivation of minimal degree invariants in specific cases, illustrating the effectiveness of our approach in real-world scenarios. This advancement has the potential to streamline various processes in quantum information theory, making it easier to understand, classify, and utilize entangled states effectively.

Herald of Kazakh-British technical university•Jul 1, 2024•1 citation
Entanglement is an important resource for quantum technologies that allow us to go beyond the classical world. Quantum systems can be entangled in various ways. Also, the degree of entanglement between the subsystems of a quantum system can be calculated in different ways. In our recent paper [Prog. Theor. Exp. Phys. (2022)], we directly measure the three-tangle of a pure three-qubit quantum state. In this paper, we extend this method to pure N-qubit quantum states (N is any odd number greater than 1) by considering polynomial invariant of degree 4 as a measure of entanglement. In this algorithm, we use quantum gates and output probabilities to calculate polynomial invariant of degree 4. The importance of this method lies in the possibility of experimental implementation of quantum calculations in the language of quantum gates.
Abstract Understanding how to decompose quantum computations in the language of the shortest possible sequence of quantum gates is of interest to many researchers due to the importance of the experimental implementation of the desired quantum computations. We contribute to this research by providing a quantum circuit to directly measure the three-tangle of three-qubit quantum states. Direct measurement of outcome probabilities in the computational basis quantifies the three-tangle of the three-qubit quantum states.
We construct an important missing piece in the entanglement theory of pure three-qubit states, which is a polynomial measure of W-entanglement. This works in parallel to the three-tangle, which is a polynomial measure of GHZ-entanglement, and to the bipartite concurrence, which is a polynomial measure of bipartite entanglement. We also show that these entanglement measures are ordered, the bipartite measure is larger than the W measure, which is larger than the GHZ measure. It is meaningful then to consider these three types of three-qubit entanglement, which are also ordered, bipartite is weaker than W, which is weaker than GHZ, in parallel to the order of the three kinds of equivalence classes of entangled three-qubit states.
Coffman et al. [Phys. Rev. A 61, 052306 (2000)] introduced the residual entanglement for three qubits. In this paper, we present the entanglement measure τ(ψ) for even n qubits; for odd n qubits, we propose the residual entanglement τ(i)(ψ) with respect to qubit i and the odd n-tangle R(ψ) by averaging the residual entanglement with respect to each qubit. In this paper, we show that these measures are LU-invariant, entanglement monotones, invariant under permutations of the qubits, and multiplicative in some cases.
In quantum information theory, understanding the complexity of entangled states within the context of SLOCC (stochastic local operations and classical communications) involving d qubits (or qudits) is essential for advancing our knowledge of quantum systems. This complexity is often analyzed by classifying the states via local symmetry groups. The resulting classes can be distinguished using invariant polynomials, which serve as a measure of entanglement. This paper introduces a novel method for obtaining invariant polynomials of the smallest degrees, which significantly enhances the efficiency of characterizing SLOCC classes of entangled quantum states. Our method not only simplifies the process of identifying these classes but also provides a robust tool for analyzing the entanglement properties of complex quantum systems. As a practical application, we demonstrate the derivation of minimal degree invariants in specific cases, illustrating the effectiveness of our approach in real-world scenarios. This advancement has the potential to streamline various processes in quantum information theory, making it easier to understand, classify, and utilize entangled states effectively.