On a matrix equality involving partial transposition and its relation to the separability problem

• URL: http://arxiv.org/abs/2104.06117v1
• Date: Tue, 13 Apr 2021 11:46:43 GMT
• Title: On a matrix equality involving partial transposition and its relation to the separability problem
• Authors: Vaibhav Soni, Rishone Deshwal, Aayush Garg, Rohit Kumar and Satyabrata Adhikari
• Abstract summary: In matrix theory, a well established relation $(AB)T=BTAT$ holds for any two matrices $A$ and $B$ for which the product $AB$ is defined. We explore the possibility of deriving the matrix equality $(AB)Gamma=AGammaBGamma$ for any $4 times 4$ matrices $A$ and $B$, where $Gamma$ denote the partial transposition.
• Score: 1.0867097571641349
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In matrix theory, a well established relation $(AB)^{T}=B^{T}A^{T}$ holds for any two matrices $A$ and $B$ for which the product $AB$ is defined. Here $T$ denote the usual transposition. In this work, we explore the possibility of deriving the matrix equality $(AB)^{\Gamma}=A^{\Gamma}B^{\Gamma}$ for any $4 \times 4$ matrices $A$ and $B$, where $\Gamma$ denote the partial transposition. We found that, in general, $(AB)^{\Gamma}\neq A^{\Gamma}B^{\Gamma}$ holds for $4 \times 4$ matrices $A$ and $B$ but there exist particular set of $4 \times 4$ matrices for which $(AB)^{\Gamma}= A^{\Gamma}B^{\Gamma}$ holds. We have exploited this matrix equality to investigate the separability problem. Since it is possible to decompose the density matrices $\rho$ into two positive semi-definite matrices $A$ and $B$ so we are able to derive the separability condition for $\rho$ when $\rho^{\Gamma}=(AB)^{\Gamma}=A^{\Gamma}B^{\Gamma}$ holds. Due to the non-uniqueness property of the decomposition of the density matrix into two positive semi-definte matrices $A$ and $B$, there is a possibility to generalise the matrix equality for density matrices lives in higher dimension. These results may help in studying the separability problem for higher dimensional and multipartite system.

Related papers

• The Communication Complexity of Approximating Matrix Rank [50.6867896228563]
  We show that this problem has randomized communication complexity $Omega(frac1kcdot n2log|mathbbF|)$. As an application, we obtain an $Omega(frac1kcdot n2log|mathbbF|)$ space lower bound for any streaming algorithm with $k$ passes.
  arXiv  Detail & Related papers  (2024-10-26T06:21:42Z)
• On MDS Property of g-Circulant Matrices [3.069335774032178]
  We first discuss $g$-circulant matrices with involutory and MDS properties. We then delve into $g$-circulant semi-involutory and semi-orthogonal matrices with entries from finite fields.
  arXiv  Detail & Related papers  (2024-06-22T15:18:31Z)
• Block perturbation of symplectic matrices in Williamson's theorem [0.0]
  We show that any symplectic matrix $tildeS$ diagonalizing $A+H$ in Williamson's theorem is of the form $tildeS=S Q+mathcalO(|H|)$. Our results hold even if $A$ has repeated symplectic eigenvalues.
  arXiv  Detail & Related papers  (2023-07-03T14:56:19Z)
• One-sided Matrix Completion from Two Observations Per Row [95.87811229292056]
  We propose a natural algorithm that involves imputing the missing values of the matrix $XTX$. We evaluate our algorithm on one-sided recovery of synthetic data and low-coverage genome sequencing.
  arXiv  Detail & Related papers  (2023-06-06T22:35:16Z)
• Multi-Unitary Complex Hadamard Matrices [0.0]
  We analyze the set of real and complex Hadamard matrices with additional symmetry constrains. Such matrices find several applications in quantum many-body theory, tensor networks and classification of multipartite quantum entanglement.
  arXiv  Detail & Related papers  (2023-05-30T20:11:18Z)
• Low-Rank Approximation with $1/\epsilon^{1/3}$ Matrix-Vector Products [58.05771390012827]
  We study iterative methods based on Krylov subspaces for low-rank approximation under any Schatten-$p$ norm. Our main result is an algorithm that uses only $tildeO(k/sqrtepsilon)$ matrix-vector products.
  arXiv  Detail & Related papers  (2022-02-10T16:10:41Z)
• Spectral properties of sample covariance matrices arising from random matrices with independent non identically distributed columns [50.053491972003656]
  It was previously shown that the functionals $texttr(AR(z))$, for $R(z) = (frac1nXXT- zI_p)-1$ and $Ain mathcal M_p$ deterministic, have a standard deviation of order $O(|A|_* / sqrt n)$. Here, we show that $|mathbb E[R(z)] - tilde R(z)|_F
  arXiv  Detail & Related papers  (2021-09-06T14:21:43Z)
• Algebraic and geometric structures inside the Birkhoff polytope [0.0]
  Birkhoff polytope $mathcalB_d$ consists of all bistochastic matrices of order $d$. We prove that $mathcalL_d$ and $mathcalF_d$ are star-shaped with respect to the flat matrix.
  arXiv  Detail & Related papers  (2021-01-27T09:51:24Z)
• The decomposition of an arbitrary $2^w\times 2^w$ unitary matrix into signed permutation matrices [0.0]
  Birkhoff's theorem tells that any doubly matrix can be decomposed as a weighted sum of permutation matrices. A similar theorem reveals that any unitary matrix can be decomposed as a weighted sum of complex permutation matrices.
  arXiv  Detail & Related papers  (2020-05-26T18:26:05Z)
• The Average-Case Time Complexity of Certifying the Restricted Isometry Property [66.65353643599899]
  In compressed sensing, the restricted isometry property (RIP) on $M times N$ sensing matrices guarantees efficient reconstruction of sparse vectors. We investigate the exact average-case time complexity of certifying the RIP property for $Mtimes N$ matrices with i.i.d. $mathcalN(0,1/M)$ entries.
  arXiv  Detail & Related papers  (2020-05-22T16:55:01Z)
• Average Case Column Subset Selection for Entrywise $\ell_1$-Norm Loss [76.02734481158458]
  It is known that in the worst case, to obtain a good rank-$k$ approximation to a matrix, one needs an arbitrarily large $nOmega(1)$ number of columns. We show that under certain minimal and realistic distributional settings, it is possible to obtain a $(k/epsilon)$-approximation with a nearly linear running time and poly$(k/epsilon)+O(klog n)$ columns. This is the first algorithm of any kind for achieving a $(k/epsilon)$-approximation for entrywise
  arXiv  Detail & Related papers  (2020-04-16T22:57:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.