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

Progress of Theoretical and Experimental Physics

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

Marziyeh Yahyavi, M. A. Jafarizadeh, Naser Karimi, Ahmad Heshmati

Published Jul 26, 2022• 7 citations
Publisher

Abstract

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.

DOI
10.1093/ptep/ptac099

Related papers

Measuring the Tangle of Three-Qubit States

Adrián Pérez-Salinas, Diego García-Martín, Carlos Bravo-Prieto +1 more

We present a quantum circuit that transforms an unknown three-qubit state into its canonical form, up to relative phases, given many copies of the original state. The circuit is made of three single-qubit parametrized quantum gates, and the optimal values for the parameters are learned in a variational fashion. Once this transformation is achieved, direct measurement of outcome probabilities in the computational basis provides an estimate of the tangle, which quantifies genuine tripartite entanglement. We perform simulations on a set of random states under different noise conditions to asses the validity of the method.

arXiv:2003.06895•Entropy•Apr 11, 2020•19 citations

Implementation of the entanglement measure in quantum gates language

Naser Karimi, Marziyeh Yahyavi

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.

Modern Physics Letters A•Sep 14, 2022•1 citation

Noiseless circuits for the concurrence and residual 3-tangle

Hilary A. Carteret

In this paper we describe a set of circuits that can measure the concurrence of a two qubit density matrix without requiring the addition of noise. We then show how this method can be extended to measure the 3-tangle for pure states of three qubits.

•Sep 29, 2003•0 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•2 citations

Exact interferometers for the concurrence and residual 3-tangle

Hilary A. Carteret

In this paper we describe a set of circuits that can measure the concurrence of a two qubit density matrix without requiring the deliberate addition of noise. We then extend these methods to obtain a circuit to measure one type of three qubit entanglement for pure states, namely the 3-tangle.

arXiv:quant-ph/0309212•Sep 29, 2003•18 citations

Optimal design of two-qubit quantum circuits

Farrokh Vatan, Colin P. Williams

In order to demonstrate non-trivial quantum computations experimentally, such as the synthesis of arbitrary entangled states, it will be useful to nderstand how to decompose a desired quantum computation into the shortest possible sequence of one-qubit and two-qubit gates. We contribute to this effort by providing a method to construct an optimal quantum circuit for a general two-qubit gate that requires at most 3 CNOT gates and 15 elementary one qubit gates. We then prove that these constructions are optimal with respect to the family of CNOT, y-rotation, z-rotation, and phase gates.

•Jan 5, 2004•0 citations
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 present a quantum circuit that transforms an unknown three-qubit state into its canonical form, up to relative phases, given many copies of the original state. The circuit is made of three single-qubit parametrized quantum gates, and the optimal values for the parameters are learned in a variational fashion. Once this transformation is achieved, direct measurement of outcome probabilities in the computational basis provides an estimate of the tangle, which quantifies genuine tripartite entanglement. We perform simulations on a set of random states under different noise conditions to asses the validity of the method.
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.
In order to demonstrate non-trivial quantum computations experimentally, such as the synthesis of arbitrary entangled states, it will be useful to nderstand how to decompose a desired quantum computation into the shortest possible sequence of one-qubit and two-qubit gates. We contribute to this effort by providing a method to construct an optimal quantum circuit for a general two-qubit gate that requires at most 3 CNOT gates and 15 elementary one qubit gates. We then prove that these constructions are optimal with respect to the family of CNOT, y-rotation, z-rotation, and phase gates.