Rational-Valued, Small-Prime-Based Qubit-Qutrit and Rebit-Retrit Rank-4/Rank-6 Conjectured Hilbert-Schmidt Separability Probability Ratios

• URL: http://arxiv.org/abs/2104.11071v1
• Date: Thu, 22 Apr 2021 13:51:08 GMT
• Title: Rational-Valued, Small-Prime-Based Qubit-Qutrit and Rebit-Retrit Rank-4/Rank-6 Conjectured Hilbert-Schmidt Separability Probability Ratios
• Authors: Paul B. Slater
• Abstract summary: We implement a procedure based on the Wishart-Laguerre distribution. For 800 million Ginibre-matrix realizations, 6,192,047 were found separable.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We implement a procedure-based on the Wishart-Laguerre distribution-recently outlined by {\.Z}yczkowski and Khvedelidze, Rogojin and Abgaryan, for the generation of random (complex or real) $N \times N$ density matrices of rank $k \leq N$ with respect to Hilbert-Schmidt (HS) measure. In the complex case, one commences with a Ginibre matrix $A$ of dimensions $k \times k+ 2 (N-k)$, while for a real scenario, one employs a Ginibre matrix $B$ of dimensions $k \times k+1+ 2 (N-k)$. Then, the $k \times k$ product $A A^{\dagger}$ or $B B^T$ is diagonalized-padded with zeros to size $N \times N$-and rotated, obtaining a random density matrix. Implementing the procedure for rank-4 rebit-retrit states, for 800 million Ginibre-matrix realizations, 6,192,047 were found separable, for a sample probability of .00774006-suggestive of an exact value $\frac{387}{5000} =\frac{3^2 \cdot 43}{2^3 \cdot 5^4}=.0774$. A conjecture for the HS separability probability of rebit-retrit systems of full rank is $\frac{860}{6561} =\frac{2^2 \cdot 5 \cdot 43}{3^8} \approx 0.1310775$ (the two-rebit counterpart has been proven to be $\frac{29}{64}=\frac{29}{2^6}$). Subject to these conjectures, the ratio of the rank-4 to rank-6 probabilities would be $\frac{59049}{1000000}=\frac{3^{10}}{2^6 \cdot 5^6} \approx 0.059049$, with the common factor 43 cancelling. As to the intermediate rank-5 probability, a 2006 theorem of Szarek, Bengtsson and {\.Z}ycskowski informs us that it must be one-half the rank-6 probability-itself conjectured to be $\frac{27}{1000} =\frac{3^3}{2^3 \cdot 5^3}$, while for rank 3 or less, the associated probabilities must be 0 by a 2009 result of Ruskai and Werner. We are led to re-examine a 2005 qubit-qutrit analysis of ours, in these regards, and now find evidence for a $\frac{70}{2673}=\frac{2 \cdot 5 \cdot 7}{ 3^5 \cdot 11} \approx 0.0261878$ rank-4 to rank-6 probability ratio.

Related papers

• Relative volume of comparable pairs under semigroup majorization [0.0]
  We review recent results and conjectures in the case of emphmajorization relation. We prove new exact finite-$n$ results in the case of emphUT-majorization relation.
  arXiv  Detail & Related papers  (2024-10-30T16:48:59Z)
• 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)
• Low-rank Matrix Bandits with Heavy-tailed Rewards [55.03293214439741]
  We study the problem of underlinelow-rank matrix bandit with underlineheavy-underlinetailed underlinerewards (LowHTR) By utilizing the truncation on observed payoffs and the dynamic exploration, we propose a novel algorithm called LOTUS.
  arXiv  Detail & Related papers  (2024-04-26T21:54:31Z)
• Sharp Noisy Binary Search with Monotonic Probabilities [5.563988395126509]
  We revisit the noisy binary search model of Karp and Kleinberg. We produce an algorithm that succeeds with probability $1-delta$ from [ frac1C_tau, varepsilon cdot left(lg n + O(log2/3 n log 1/3 frac1delta + log frac1delta) right.
  arXiv  Detail & Related papers  (2023-11-01T20:45:13Z)
• Fitting an ellipsoid to a quadratic number of random points [10.208117253395342]
  We consider the problem $(mathrmP)$ of fitting $n$ standard Gaussian random vectors in $mathbbRd$ to the boundary of a centered ellipsoid, as $n, d to infty$. This problem is conjectured to have a sharp feasibility transition: for any $varepsilon > 0$, if $n leq (1 - varepsilon) d2 / 4$ then $(mathrmP)$ has a solution with high probability.
  arXiv  Detail & Related papers  (2023-07-03T17:46:23Z)
• Additive estimates of the permanent using Gaussian fields [0.0]
  We present a randomized algorithm for estimating the permanent of an $M times M$ real matrix $A$ up to an additive error. We can estimate $mathrmperm(A)$ to an additive error of $epsilonbigg(sqrt32Mprod2M_i=1 C_iibigg)$ in time.
  arXiv  Detail & Related papers  (2022-12-20T22:13:42Z)
• 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)
• On the continuous Zauner conjecture [0.0]
  In this paper we prove that for any $t in [-frac1d2-1, frac1d+1] setminus0$ the equality $textebr(Phi_t)=d2$ is equivalent to the existence of a pair of informationally complete unit norm tight frames.
  arXiv  Detail & Related papers  (2021-12-11T00:14:35Z)
• 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)
• Density Matrix Diagonal-Block Lovas-Andai-type singular-value ratios for qubit-qudit separability/PPT probability analyses [0.0]
  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$.
  arXiv  Detail & Related papers  (2021-06-30T14:48:46Z)
• Optimal Mean Estimation without a Variance [103.26777953032537]
  We study the problem of heavy-tailed mean estimation in settings where the variance of the data-generating distribution does not exist. We design an estimator which attains the smallest possible confidence interval as a function of $n,d,delta$.
  arXiv  Detail & Related papers  (2020-11-24T22:39:21Z)
• Sparse sketches with small inversion bias [79.77110958547695]
  Inversion bias arises when averaging estimates of quantities that depend on the inverse covariance. We develop a framework for analyzing inversion bias, based on our proposed concept of an $(epsilon,delta)$-unbiased estimator for random matrices. We show that when the sketching matrix $S$ is dense and has i.i.d. sub-gaussian entries, the estimator $(epsilon,delta)$-unbiased for $(Atop A)-1$ with a sketch of size $m=O(d+sqrt d/
  arXiv  Detail & Related papers  (2020-11-21T01:33:15Z)
• Near-Optimal SQ Lower Bounds for Agnostically Learning Halfspaces and ReLUs under Gaussian Marginals [49.60752558064027]
  We study the fundamental problems of agnostically learning halfspaces and ReLUs under Gaussian marginals. Our lower bounds provide strong evidence that current upper bounds for these tasks are essentially best possible.
  arXiv  Detail & Related papers  (2020-06-29T17:10:10Z)
• 8 Boolean Atoms Spanning the 256-Dimensional Entanglement-Probability Three-Set Algebra of the Two-Qutrit Hiesmayr-Loffler Magic Simplex of Bell States [0.0]
  entanglement-probability algebra for the two-qutrit Hiesmayr-Loffler states. $s$ is the square of the sum of the eight singular values of the $8 times 8$ correlation matrix in the Bloch representation.
  arXiv  Detail & Related papers  (2020-04-14T18:11:13Z)
• Curse of Dimensionality on Randomized Smoothing for Certifiable Robustness [151.67113334248464]
  We show that extending the smoothing technique to defend against other attack models can be challenging. We present experimental results on CIFAR to validate our theory.
  arXiv  Detail & Related papers  (2020-02-08T22:02:14Z)

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.