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

AIP conference proceedings

Maximum rank of reduced density matrix of m x n-dimensional bipartite states

Bayu Dwi Hatmoko, Agus Purwanto

Published Jan 1, 2019• 0 citations
Publisher

Abstract

The entanglement is the main requirement of a quantum channel to carry out the quantum task successfully. Quantum information task is transmitting the quantum information from the sender to the recipient. Many methods are used to characterize entanglement, one of which is by using the rank of the reduced density matrix. In this paper, we have shown that for a m x n bipartite state and m < n that the maximum rank of the reduced density matrix is always equal to m. In other words, the maximum rank of the reduced density matrix always satisfied the smallest dimensional order of the bipartite state.

DOI
10.1063/1.5141635

Related papers

Bipartite states of low rank are almost surely entangled

Mary Beth Ruskai, Elisabeth M. Werner

We show that a bipartite state on a tensor product of two matrix algebras is almost surely entangled if its rank is not greater than that of one of its reduced density matrices.

arXiv:0812.0405•Journal of Physics A Mathematical and Theoretical•Feb 5, 2009•14 citations

The distillability of entanglement of bipartite reduced density matrices of a tripartite state

Yize Sun, Lin Chen

Abstract The relation between the distillability of entanglement of three bipartite reduced density matrices from a tripartite pure state has been studied in Hayashi and Chen [2011 Phys. Rev. A 84 012325]. We extend this result to the tripartite mixed state of rank at most three. In particular we show that if the state has two bipartite reduced density operators with rank two, then the third bipartite reduced density operator additionally having non positive partial transpose (non-PPT) is distillable. In contrast, we show that the tripartite PPT state with two reduced density operators of rank two is a three-qubit fully separable state. We obtain these facts by proving a conjectured matrix inequality for the bipartite matrix M with Schmidt rank at most three. This is one of the main results of this paper. We also prove it for some M with arbitrary Schmidt rank.

Journal of Physics A Mathematical and Theoretical•Jun 1, 2020•4 citations

Distillability and PPT entanglement of low-rank quantum states

Lin Chen, Dragomir Ž. Djoković

The bipartite quantum states ρ, with rank strictly smaller than the maximum of the ranks of the reduced states ρ A and ρ B , are distillable by local operations and classical communication (Horodecki P, Smolin J A, Terhal B M and Thapliyal A V 2003 Theor. Comput. Sci. 292 589–96; 1999 arXiv:quant-ph/9910122). Our first main result is that this is also true for NPT states with rank equal to this maximum. (A state is PPT if the partial transpose of its density matrix is positive semidefinite, and otherwise it is NPT.) This was conjectured first in 1999 in the special case when the ranks of ρ A and ρ B are equal (see (Horodecki P, Smolin J A, Terhal B M and Thapliyal A V 2003 Theor. Comput. Sci. 292 589–96; 1999 arXiv:quant-ph/9910122). Our second main result provides a complete solution of the separability problem for bipartite states of rank 4. Namely, we show that such a state is separable if and only if it is PPT and its range contains at least one product state. We also prove that the so-called checkerboard states are distillable if and only if they are NPT.

arXiv:1101.5134•Journal of Physics A Mathematical and Theoretical•Jun 14, 2011•46 citations

Entanglement distillation in terms of a conjectured matrix inequality

Yize Sun, Lin Chen

Entanglement distillation is a basic task in quantum information, and the distillable entanglement of three bipartite reduced density matrices from a tripartite pure state has been studied in [Phys. Rev. A 84, 012325 (2011)]. We extend this result to tripartite mixed states by studying a conjectured matrix inequality, namely $\mathop{\rm rank}(\sum_i R_i \otimes S_i)\leq K \mathop{\rm rank}(\sum_i R_i^T \otimes S_i)$ holds for any bipartite matrix $M=\sum_i R_i \otimes S_i$ and Schmidt rank $K$. We prove that the conjecture holds for $M$ with $K=3$ and some special $M$ with arbitrary $K$.

arXiv:1909.02748•Sep 6, 2019•0 citations

Bell’s inequality and entanglement in qubits

Po-Yao Chang, Su-Kuan Chu, Chen‐Te Ma

We propose an alternative evaluation of quantum entanglement by measuring the maximum violation of the Bell’s inequality without information of the reduced density matrix of a system. This proposal is demonstrated by bridging the maximum violation of the Bell’s inequality and a concurrence of a pure state in an n-qubit system, in which one subsystem only contains one qubit and the state is a linear combination of two product states. We apply this relation to the ground states of four qubits in the Wen-Plaquette model and show that they are maximally entangled. A topological entanglement entropy of the Wen-Plaquette model could be obtained by relating the upper bound of the maximum violation of the Bell’s inequality to the generalized concurrence of a pure state with respect to different bipartitions.

arXiv:1705.06444•Journal of High Energy Physics•Sep 1, 2017•10 citations

Proof of a Conjectured 0-Rényi Entropy Inequality With Applications to Multipartite Entanglement

Zhiwei Song, Lin Chen, Yize Sun +1 more

Characterizing the relations among the three bipartite reduced density operators$ \rho _{AB}$,$ \rho _{AC}$and$ \rho _{BC}$of a tripartite mixed state$ \rho _{ABC}$has been an open problem in quantum information. One of such relations has been reduced by [Cadney et al, LAA. 452, 153, 2014] to a conjectured inequality in terms of matrix rank, namely$r(\rho _{AB}) \cdot r( \rho _{AC})\ge r( \rho _{BC})$for any$ \rho _{ABC}$. It is denoted as open problem 41 in the website “Open quantum problems-IQOQI Vienna”. We prove the inequality, and thus establish a complete picture of the four-party linear inequalities in terms of the 0-entropy. Our proof is based on the construction of a novel canonical form of bipartite matrices under local equivalence. We extend our result to inequalities in multipartite systems, as well as the condition when the inequality is saturated.

arXiv:2105.07679•IEEE Transactions on Information Theory•Dec 9, 2022•7 citations
The entanglement is the main requirement of a quantum channel to carry out the quantum task successfully. Quantum information task is transmitting the quantum information from the sender to the recipient. Many methods are used to characterize entanglement, one of which is by using the rank of the reduced density matrix. In this paper, we have shown that for a m x n bipartite state and m < n that the maximum rank of the reduced density matrix is always equal to m. In other words, the maximum rank of the reduced density matrix always satisfied the smallest dimensional order of the bipartite state.
Abstract The relation between the distillability of entanglement of three bipartite reduced density matrices from a tripartite pure state has been studied in Hayashi and Chen [2011 Phys. Rev. A 84 012325]. We extend this result to the tripartite mixed state of rank at most three. In particular we show that if the state has two bipartite reduced density operators with rank two, then the third bipartite reduced density operator additionally having non positive partial transpose (non-PPT) is distillable. In contrast, we show that the tripartite PPT state with two reduced density operators of rank two is a three-qubit fully separable state. We obtain these facts by proving a conjectured matrix inequality for the bipartite matrix M with Schmidt rank at most three. This is one of the main results of this paper. We also prove it for some M with arbitrary Schmidt rank.
The bipartite quantum states ρ, with rank strictly smaller than the maximum of the ranks of the reduced states ρ A and ρ B , are distillable by local operations and classical communication (Horodecki P, Smolin J A, Terhal B M and Thapliyal A V 2003 Theor. Comput. Sci. 292 589–96; 1999 arXiv:quant-ph/9910122). Our first main result is that this is also true for NPT states with rank equal to this maximum. (A state is PPT if the partial transpose of its density matrix is positive semidefinite, and otherwise it is NPT.) This was conjectured first in 1999 in the special case when the ranks of ρ A and ρ B are equal (see (Horodecki P, Smolin J A, Terhal B M and Thapliyal A V 2003 Theor. Comput. Sci. 292 589–96; 1999 arXiv:quant-ph/9910122). Our second main result provides a complete solution of the separability problem for bipartite states of rank 4. Namely, we show that such a state is separable if and only if it is PPT and its range contains at least one product state. We also prove that the so-called checkerboard states are distillable if and only if they are NPT.
Entanglement distillation is a basic task in quantum information, and the distillable entanglement of three bipartite reduced density matrices from a tripartite pure state has been studied in [Phys. Rev. A 84, 012325 (2011)]. We extend this result to tripartite mixed states by studying a conjectured matrix inequality, namely rank(∑iRi⊗Si)≤Krank(∑iRiT⊗Si)\mathop{\rm rank}(\sum_i R_i \otimes S_i)\leq K \mathop{\rm rank}(\sum_i R_i^T \otimes S_i)rank(∑i​Ri​⊗Si​)≤Krank(∑i​RiT​⊗Si​) holds for any bipartite matrix M=∑iRi⊗SiM=\sum_i R_i \otimes S_iM=∑i​Ri​⊗Si​ and Schmidt rank KKK. We prove that the conjecture holds for MMM with K=3K=3K=3 and some special MMM with arbitrary KKK.
We propose an alternative evaluation of quantum entanglement by measuring the maximum violation of the Bell’s inequality without information of the reduced density matrix of a system. This proposal is demonstrated by bridging the maximum violation of the Bell’s inequality and a concurrence of a pure state in an n-qubit system, in which one subsystem only contains one qubit and the state is a linear combination of two product states. We apply this relation to the ground states of four qubits in the Wen-Plaquette model and show that they are maximally entangled. A topological entanglement entropy of the Wen-Plaquette model could be obtained by relating the upper bound of the maximum violation of the Bell’s inequality to the generalized concurrence of a pure state with respect to different bipartitions.
Characterizing the relations among the three bipartite reduced density operators$ \rho _{AB},,, \rho _{AC}andandand \rho _{BC}ofatripartitemixedstateof a tripartite mixed stateofatripartitemixedstate \rho _{ABC}hasbeenanopenprobleminquantuminformation.Oneofsuchrelationshasbeenreducedby[Cadneyetal,LAA.452,153,2014]toaconjecturedinequalityintermsofmatrixrank,namelyhas been an open problem in quantum information. One of such relations has been reduced by [Cadney et al, LAA. 452, 153, 2014] to a conjectured inequality in terms of matrix rank, namelyhasbeenanopenprobleminquantuminformation.Oneofsuchrelationshasbeenreducedby[Cadneyetal,LAA.452,153,2014]toaconjecturedinequalityintermsofmatrixrank,namelyr(\rho _{AB}) \cdot r( \rho _{AC})\ge r( \rho _{BC})foranyfor anyforany \rho _{ABC}$. It is denoted as open problem 41 in the website “Open quantum problems-IQOQI Vienna”. We prove the inequality, and thus establish a complete picture of the four-party linear inequalities in terms of the 0-entropy. Our proof is based on the construction of a novel canonical form of bipartite matrices under local equivalence. We extend our result to inequalities in multipartite systems, as well as the condition when the inequality is saturated.