Density Matrix Diagonal-Block Lovas-Andai-type singular-value ratios for qubit-qudit separability/PPT probability analyses

• URL: http://arxiv.org/abs/2106.16104v1
• Date: Wed, 30 Jun 2021 14:48:46 GMT
• Title: Density Matrix Diagonal-Block Lovas-Andai-type singular-value ratios for qubit-qudit separability/PPT probability analyses
• Authors: Paul B. Slater
• Abstract summary: An important variable in the 2017 analysis of Lovas and Andai, formally establishing the Hilbert-Schmidt separability probability conjectured by Slater of $frac2964$ for the 9-dimensional convex set of two-rebit density matrices, was the ratio ($varepsilon =fracsigmasigma1$) of the two singular values. Here, we investigate the behavior of the three singular value ratios of $V=Dfrac12 D-frac12$.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: An important variable in the 2017 analysis of Lovas and Andai, formally establishing the Hilbert-Schmidt separability probability conjectured by Slater of $\frac{29}{64}$ for the 9-dimensional convex set of two-rebit density matrices, was the ratio ($\varepsilon =\frac{\sigma_2}{\sigma_1}$) of the two singular values ($\sigma_1 \geq \sigma_2 \geq 0$) of $D_2^{\frac{1}{2}} D_1^{-\frac{1}{2}}$. There, $D_1$ and $D_2$ were the diagonal $2 \times 2$ blocks of a $4 \times 4$ two-rebit density matrix $\rho$. Working within the Lovas-Andai "separability function" ($\tilde{\chi}_d(\varepsilon)$) framework, Slater was able to verify further conjectures of Hilbert-Schmidt separability probabilities of $\frac{8}{33}$ and $\frac{26}{323}$ for the 15-dimensional and 26-dimensional convex sets of two-qubit and two-quater[nionic]-bit density matrices. Here, we investigate the behavior of the three singular value ratios of $V=D_2^{\frac{1}{2}} D_1^{-\frac{1}{2}}$, where now $D_1$ and $D_2$ are the $3 \times 3$ diagonal blocks of $6 \times 6$ rebit-retrit and qubit-qutrit density matrices randomly generated with respect to Hilbert-Schmidt measure. Further, we initiate a parallel study employing $8 \times 8$ density matrices. The motivation for this analysis is the conjectured relevance of these singular values in suitably extending $\tilde{\chi}_d(\varepsilon)$ to higher dimensional systems--an issue we also approach using certain novel numeric means. Section 3.3 of the 2017 A. Lovas doctoral dissertation (written in Hungarian) appears germane to such an investigation.

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)
• Optimal Sketching for Residual Error Estimation for Matrix and Vector Norms [50.15964512954274]
  We study the problem of residual error estimation for matrix and vector norms using a linear sketch. We demonstrate that this gives a substantial advantage empirically, for roughly the same sketch size and accuracy as in previous work. We also show an $Omega(k2/pn1-2/p)$ lower bound for the sparse recovery problem, which is tight up to a $mathrmpoly(log n)$ factor.
  arXiv  Detail & Related papers  (2024-08-16T02:33:07Z)
• 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)
• A Nearly-Optimal Bound for Fast Regression with $\ell_\infty$ Guarantee [16.409210914237086]
  Given a matrix $Ain mathbbRntimes d$ and a tensor $bin mathbbRn$, we consider the regression problem with $ell_infty$ guarantees. We show that in order to obtain such $ell_infty$ guarantee for $ell$ regression, one has to use sketching matrices that are dense. We also develop a novel analytical framework for $ell_infty$ guarantee regression that utilizes the Oblivious Coordinate-wise Embedding (OCE) property
  arXiv  Detail & Related papers  (2023-02-01T05:22:40Z)
• A random matrix model for random approximate $t$-designs [1.534667887016089]
  A random matrix model is proposed to describe the probability distribution of $delta(nu_mathcalS,t)$ for any $t$. We show that our model satisfies the so-called spectral gap conjecture, i.e. we prove that with the probability $1$ there is $tinmathbbZ_+$ such that $sup satisfieskinmathbbZ_+delta(k)=delta(t)$.
  arXiv  Detail & Related papers  (2022-10-14T14:50:06Z)
• Near-optimal fitting of ellipsoids to random points [68.12685213894112]
  A basic problem of fitting an ellipsoid to random points has connections to low-rank matrix decompositions, independent component analysis, and principal component analysis. We resolve this conjecture up to logarithmic factors by constructing a fitting ellipsoid for some $n = Omega(, d2/mathrmpolylog(d),)$. Our proof demonstrates feasibility of the least squares construction of Saunderson et al. using a convenient decomposition of a certain non-standard random matrix.
  arXiv  Detail & Related papers  (2022-08-19T18:00:34Z)
• Sketching Algorithms and Lower Bounds for Ridge Regression [65.0720777731368]
  We give a sketching-based iterative algorithm that computes $1+varepsilon$ approximate solutions for the ridge regression problem. We also show that this algorithm can be used to give faster algorithms for kernel ridge regression.
  arXiv  Detail & Related papers  (2022-04-13T22:18:47Z)
• Matrix concentration inequalities and efficiency of random universal sets of quantum gates [0.0]
  For a random set $mathcalS subset U(d)$ of quantum gates we provide bounds on the probability that $mathcalS$ forms a $delta$-approximate $t$-design. We show that for $mathcalS$ drawn from an exact $t$-design the probability that it forms a $delta$-approximate $t$-design satisfies the inequality $mathbbPleft(delta geq x right)leq 2D_t
  arXiv  Detail & Related papers  (2022-02-10T23:44:09Z)
• 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)
• Random matrices in service of ML footprint: ternary random features with no performance loss [55.30329197651178]
  We show that the eigenspectrum of $bf K$ is independent of the distribution of the i.i.d. entries of $bf w$. We propose a novel random technique, called Ternary Random Feature (TRF) The computation of the proposed random features requires no multiplication and a factor of $b$ less bits for storage compared to classical random features.
  arXiv  Detail & Related papers  (2021-10-05T09:33:49Z)
• 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)
• Rational-Valued, Small-Prime-Based Qubit-Qutrit and Rebit-Retrit Rank-4/Rank-6 Conjectured Hilbert-Schmidt Separability Probability Ratios [0.0]
  We implement a procedure based on the Wishart-Laguerre distribution. For 800 million Ginibre-matrix realizations, 6,192,047 were found separable.
  arXiv  Detail & Related papers  (2021-04-22T13:51:08Z)
• How isotropic kernels perform on simple invariants [0.5729426778193397]
  We investigate how the training curve of isotropic kernel methods depends on the symmetry of the task to be learned. We show that for large bandwidth, $beta = fracd-1+xi3d-3+xi$, where $xiin (0,2)$ is the exponent characterizing the stripe of the kernel at the origin.
  arXiv  Detail & Related papers  (2020-06-17T09:59:18Z)

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.