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

Quantum Information and Computation

Numerical analysis of entanglement properties of density matrices in C2ÄC2 systems

Rubens Viana Ramos, Anders Karlsson

Published Apr 1, 2002• 2 citations
Publisher

Abstract

Quantum entanglement is an enigmatic and powerful property that has attracted much attention due to its usefulness in new ways of communications, like quantum teleportation and quantum key distribution. Much effort has been done to quantify entanglement. Indeed, there exist some well-established separability criterion and analytical formulas for the entanglement of bipartite systems. In both, the crucial element is the partial transpose of the density matrix. In this paper, we show numerically that one can also have information about the entanglement of bipartite state, in C2ÄC2, without looking at the partial transpose. We furthermore study properties of disentanglement operation, as well as properties of the relative entropy.

DOI
10.26421/qic2.3-5

Related papers

The minimal principals of Hermitian matrices and the negativity of bipartite of qubit states

João Luzeilton de Oliveira, Rubens Viana Ramos

Quantum entanglement is an enigmatic and powerful property that has attracted much attention due to its usefulness in new ways of communications, like quantum teleportation and quantum key distribution. Much effort has been done to quantify entanglement. Indeed, there exist some well-established separability criterion and analytical formulas for the entanglement of bipartite systems. In some of these, the crucial elements are the eigenvalues of the partial transpose of the density matrix. In this paper, we show that one can also have information about the entanglement of bipartite state, in C2xC2, looking at the minimal principals of the partial transpose.

arXiv:0706.4278•Jun 28, 2007•0 citations

Entanglement and Quantumness - New Numerical Approaches -

Fabian Bohnet-Waldraff

The main topic of this compilation thesis is the investigation of multipartite entanglement of finite dimensional systems. We developed a numerical algorithm that detects if a multipartite state is entangled or separable in a finite number of steps of a semi-definite optimization task. This method is an extension of previously known semi-definite methods, which are inconclusive when the state is separable. In our case, if the state is separable, an explicit decomposition into a mixture of separable states can be extracted. This was achieved by mapping the entanglement problem onto the mathematically well studied truncated moment problem. Additionally, a new way of writing the partially transposed state for symmetric multi-qubit states was developed which simplifies many results previously known in entanglement theory. This new way of writing the partial transpose criterion unifies different interpretations and alternative formulations of the partial transpose criterion and it is also a part in the aforementioned semi-definite algorithm. The geometric properties of entangled symmetric states of two qubits were studied in detail: We could answer the question of how far a given pure state is from the convex hull of symmetric separable states, as measured by the Hilbert-Schmidt distance, by giving an explicit formula for the closest separable symmetric state. For mixed states we could provide a numerical upper and analytical lower bound for this distance. For a larger number of qubits we investigated the ball of absolutely classical states, i.e. symmetric multi-qubit states that stay separable under any unitary transformation. We found an analytical lower bound for the radius of this ball around the maximally mixed symmetric state and gave a numerical upper bound on this radius, by searching for an entangled state as close as possible to the maximally mixed symmetric state. The tensor representation of a symmetric multi-qubit state, or spin-j state, allowed us to study entanglement properties based on the spectrum of the tensor via tensor eigenvalues. The definiteness of this tensor relates to the entanglement of the state it represents and, hence, the smallest tensor eigenvalue can be used to detect entanglement. However, the tensor eigenvalues are more difficult to determine than the familiar matrix eigenvalues which made the investigation computationally more challenging. The relationship between the value of the smallest tensor eigenvalue and the amount of entanglement in the state was also investigated. It turned out that they are strongly correlated for small system sizes, i.e. for up to six qubits. However, to investigate this correlation we needed an independent way to gauge the amount of entanglement of a state and in order to do so we improved existing numerical methods to determine the distance of a state to the set of separable symmetric states, using a combination of linear and quadratic programming. The tensor representation of symmetric multi-qubit states was also used to formally define a new tensor class of regularly decomposable tensors that corresponds to the set of separable symmetric multi-qubit states.

•Sep 29, 2017•0 citations

Optimal Entanglement Certification from Moments of the Partial Transpose

Xiao‐Dong Yu, Satoya Imai, Otfried Gühne

For the certification and benchmarking of medium-size quantum devices, efficient methods to characterize entanglement are needed. In this context, it has been shown that locally randomized measurements on a multiparticle quantum system can be used to obtain valuable information on the so-called moments of the partially transposed quantum state. This allows one to infer some separability properties of a state, but how to use the given information in an optimal and systematic manner has yet to be determined. We propose two general entanglement detection methods based on the moments of the partially transposed density matrix. The first method is based on the Hankel matrices and provides a family of entanglement criteria, of which the lowest order reduces to the known p_{3}-positive-partial-transpose criterion proposed in A. Elben et al. [Phys. Rev. Lett. 125, 200501 (2020)PRLTAO0031-900710.1103/PhysRevLett.125.200501]. The second method is optimal and gives necessary and sufficient conditions for entanglement based on some moments of the partially transposed density matrix.

arXiv:2103.06897•Physical Review Letters•Aug 4, 2021•79 citations

Entanglement and entropy in multipartite systems: a useful approach

Alexander Bernal, J.A. Casas, Jesús M. Moreno

Abstract Quantum entanglement and quantum entropy are crucial concepts in the study of multipartite quantum systems. In this work, we show how the notion of concurrence vector, re-expressed in a particularly useful form, provides new insights and computational tools for the analysis of both. In particular, using this approach for a general multipartite pure state, one can easily prove known relations in an easy way and to build up new relations between the concurrences associated with the different bipartitions. The approach is also useful to derive sufficient conditions for genuine entanglement in generic multipartite systems that are computable in polynomial time. From an entropy-of-entanglement perspective, the approach is powerful to prove properties of the Tsallis-2 entropy, such as the subadditivity, and to derive new ones, e.g., a modified version of the strong subadditivity which is always fulfilled; thanks to the purification theorem these results hold for any multipartite state, whether pure or mixed.

arXiv:2307.05205•Quantum Information Processing•Feb 9, 2024•7 citations

Moments based entanglement criteria and measures

Yiding Wang, Tinggui Zhang, Xiaofen Huang +1 more

Abstract Quantum entanglement plays a key role in quantum computation and quantum information processing. It is of great significance to find efficient and experimentally friend separability criteria to detect entanglement. In this paper, we firstly propose two easily used entanglement criteria based on matrix moments. The first entanglement criterion only uses the first two realignment moments of a density matrix. The second entanglement criterion is based on the moments related to the partially transposed matrix. By detailed examples we illustrate the effectiveness of these criteria in detecting entanglement. Moreover, we provide an experimentally measurable lower bound of concurrence based on these moments. Finally, we present both bipartite and genuine tripartite entanglement measures based on the moments of the reduced states. By detailed examples, we show that our entanglement measures characterize the quantum entanglement in a more fine ways than the existing measures.

arXiv:2405.04754•Journal of Physics A Mathematical and Theoretical•Apr 19, 2024•5 citations

Quantum Entanglement

S. Rajasekar, R. Velusamy

Entanglement finds wide application in the development of quantum information theory. After reviewing states in classical mechanics, this chapter discusses the fundamental aspects of characterization of quantum entanglement like the definition, the detection, the classification and quantification of entanglement. The density operator is used to describe the state of a quantum system in a more general way than provided by the state vector of the Hilbert space. Multipartite entanglement theory is much complex compared to the bipartite case. One cannot generalize the results of bipartite entanglement to multipartite entanglement. The Peres criterion known as positive partial transpose criterion is an important criterion to find the separability of mixed states at least for low-dimensional systems. B.W. Terhal introduced the term entanglement witnesses for operators detecting quantum entanglement states. It is found that any entangled state can be detected by some entanglement witnesses.

CRC Press eBooks•Oct 5, 2022•0 citations
Quantum entanglement is an enigmatic and powerful property that has attracted much attention due to its usefulness in new ways of communications, like quantum teleportation and quantum key distribution. Much effort has been done to quantify entanglement. Indeed, there exist some well-established separability criterion and analytical formulas for the entanglement of bipartite systems. In both, the crucial element is the partial transpose of the density matrix. In this paper, we show numerically that one can also have information about the entanglement of bipartite state, in C2ÄC2, without looking at the partial transpose. We furthermore study properties of disentanglement operation, as well as properties of the relative entropy.
Quantum entanglement is an enigmatic and powerful property that has attracted much attention due to its usefulness in new ways of communications, like quantum teleportation and quantum key distribution. Much effort has been done to quantify entanglement. Indeed, there exist some well-established separability criterion and analytical formulas for the entanglement of bipartite systems. In some of these, the crucial elements are the eigenvalues of the partial transpose of the density matrix. In this paper, we show that one can also have information about the entanglement of bipartite state, in C2xC2, looking at the minimal principals of the partial transpose.
The main topic of this compilation thesis is the investigation of multipartite entanglement of finite dimensional systems. We developed a numerical algorithm that detects if a multipartite state is entangled or separable in a finite number of steps of a semi-definite optimization task. This method is an extension of previously known semi-definite methods, which are inconclusive when the state is separable. In our case, if the state is separable, an explicit decomposition into a mixture of separable states can be extracted. This was achieved by mapping the entanglement problem onto the mathematically well studied truncated moment problem. Additionally, a new way of writing the partially transposed state for symmetric multi-qubit states was developed which simplifies many results previously known in entanglement theory. This new way of writing the partial transpose criterion unifies different interpretations and alternative formulations of the partial transpose criterion and it is also a part in the aforementioned semi-definite algorithm. The geometric properties of entangled symmetric states of two qubits were studied in detail: We could answer the question of how far a given pure state is from the convex hull of symmetric separable states, as measured by the Hilbert-Schmidt distance, by giving an explicit formula for the closest separable symmetric state. For mixed states we could provide a numerical upper and analytical lower bound for this distance. For a larger number of qubits we investigated the ball of absolutely classical states, i.e. symmetric multi-qubit states that stay separable under any unitary transformation. We found an analytical lower bound for the radius of this ball around the maximally mixed symmetric state and gave a numerical upper bound on this radius, by searching for an entangled state as close as possible to the maximally mixed symmetric state. The tensor representation of a symmetric multi-qubit state, or spin-j state, allowed us to study entanglement properties based on the spectrum of the tensor via tensor eigenvalues. The definiteness of this tensor relates to the entanglement of the state it represents and, hence, the smallest tensor eigenvalue can be used to detect entanglement. However, the tensor eigenvalues are more difficult to determine than the familiar matrix eigenvalues which made the investigation computationally more challenging. The relationship between the value of the smallest tensor eigenvalue and the amount of entanglement in the state was also investigated. It turned out that they are strongly correlated for small system sizes, i.e. for up to six qubits. However, to investigate this correlation we needed an independent way to gauge the amount of entanglement of a state and in order to do so we improved existing numerical methods to determine the distance of a state to the set of separable symmetric states, using a combination of linear and quadratic programming. The tensor representation of symmetric multi-qubit states was also used to formally define a new tensor class of regularly decomposable tensors that corresponds to the set of separable symmetric multi-qubit states.
For the certification and benchmarking of medium-size quantum devices, efficient methods to characterize entanglement are needed. In this context, it has been shown that locally randomized measurements on a multiparticle quantum system can be used to obtain valuable information on the so-called moments of the partially transposed quantum state. This allows one to infer some separability properties of a state, but how to use the given information in an optimal and systematic manner has yet to be determined. We propose two general entanglement detection methods based on the moments of the partially transposed density matrix. The first method is based on the Hankel matrices and provides a family of entanglement criteria, of which the lowest order reduces to the known p_{3}-positive-partial-transpose criterion proposed in A. Elben et al. [Phys. Rev. Lett. 125, 200501 (2020)PRLTAO0031-900710.1103/PhysRevLett.125.200501]. The second method is optimal and gives necessary and sufficient conditions for entanglement based on some moments of the partially transposed density matrix.
Abstract Quantum entanglement and quantum entropy are crucial concepts in the study of multipartite quantum systems. In this work, we show how the notion of concurrence vector, re-expressed in a particularly useful form, provides new insights and computational tools for the analysis of both. In particular, using this approach for a general multipartite pure state, one can easily prove known relations in an easy way and to build up new relations between the concurrences associated with the different bipartitions. The approach is also useful to derive sufficient conditions for genuine entanglement in generic multipartite systems that are computable in polynomial time. From an entropy-of-entanglement perspective, the approach is powerful to prove properties of the Tsallis-2 entropy, such as the subadditivity, and to derive new ones, e.g., a modified version of the strong subadditivity which is always fulfilled; thanks to the purification theorem these results hold for any multipartite state, whether pure or mixed.
Abstract Quantum entanglement plays a key role in quantum computation and quantum information processing. It is of great significance to find efficient and experimentally friend separability criteria to detect entanglement. In this paper, we firstly propose two easily used entanglement criteria based on matrix moments. The first entanglement criterion only uses the first two realignment moments of a density matrix. The second entanglement criterion is based on the moments related to the partially transposed matrix. By detailed examples we illustrate the effectiveness of these criteria in detecting entanglement. Moreover, we provide an experimentally measurable lower bound of concurrence based on these moments. Finally, we present both bipartite and genuine tripartite entanglement measures based on the moments of the reduced states. By detailed examples, we show that our entanglement measures characterize the quantum entanglement in a more fine ways than the existing measures.
Entanglement finds wide application in the development of quantum information theory. After reviewing states in classical mechanics, this chapter discusses the fundamental aspects of characterization of quantum entanglement like the definition, the detection, the classification and quantification of entanglement. The density operator is used to describe the state of a quantum system in a more general way than provided by the state vector of the Hilbert space. Multipartite entanglement theory is much complex compared to the bipartite case. One cannot generalize the results of bipartite entanglement to multipartite entanglement. The Peres criterion known as positive partial transpose criterion is an important criterion to find the separability of mixed states at least for low-dimensional systems. B.W. Terhal introduced the term entanglement witnesses for operators detecting quantum entanglement states. It is found that any entangled state can be detected by some entanglement witnesses.