The distribution of density matrices at fixed purity for arbitrary dimensions

• URL: http://arxiv.org/abs/2205.01723v2
• Date: Tue, 17 May 2022 02:44:38 GMT
• Title: The distribution of density matrices at fixed purity for arbitrary dimensions
• Authors: Paul M. Alsing, Christopher C. Tison, James Schneeloch, Richard J. Birrittella and Michael L. Fanto
• Abstract summary: We give closed form analytic formulas for the cases $N=2$ (trivial), $N=3$ and $N=4$, and present a prescription for CDFs of higher arbitrary dimensions. As an illustration of these formulas, we compare the logarithmic negativity and quantum discord to the (Wootter's) concurrence spanning a range of fixed purity values in $mu_4(rho)in[tfrac14, 1]$. We numerically investigate a recently proposed complementary-quantum correlation conjecture which lower bounds the quantum mutual information of a bipartite system
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: We present marginal cumulative distribution functions (CDF) for density matrices $\rho$ of fixed purity $\tfrac{1}{N}\le\mu_N(\rho)=\textrm{Tr}[\rho^2]\le 1$ for arbitrary dimension $N$. We give closed form analytic formulas for the cases $N=2$ (trivial), $N=3$ and $N=4$, and present a prescription for CDFs of higher arbitrary dimensions. These formulas allows one to uniformly sample density matrices at a user selected, fixed constant purity, and also detail how these density matrices are distributed nonlinearly in the range $\mu_N(\rho)\in[\tfrac{1}{N}, 1]$. As an illustration of these formulas, we compare the logarithmic negativity and quantum discord to the (Wootter's) concurrence spanning a range of fixed purity values in $\mu_4(\rho)\in[\tfrac{1}{4}, 1]$ for the case of $N=4$ (two qubits). We also investigate the distribution of eigenvalues of a reduced $N$-dimensional obtained by tracing out the reservoir of its higher-dimensional purification. Lastly, we numerically investigate a recently proposed complementary-quantum correlation conjecture which lower bounds the quantum mutual information of a bipartite system by the sum of classical mutual informations obtained from two pairs of mutually unbiased measurements. Finally, numerical implementation issues for the computation of the CDFs and inverse CDFs necessary for uniform sampling $\rho$ for fixed purity at very high dimension are briefly discussed.

Related papers

• Nearly Optimal Robust Covariance and Scatter Matrix Estimation Beyond Gaussians [2.311583680973075]
  We study the problem of computationally efficient robust estimation of the covariance/scatter matrix of elliptical distributions. We obtain the first efficiently computable, nearly optimal robust covariance estimators that extend beyond the Gaussian case.
  arXiv  Detail & Related papers  (2025-02-10T15:31:57Z)
• Dimension-free Private Mean Estimation for Anisotropic Distributions [55.86374912608193]
  Previous private estimators on distributions over $mathRd suffer from a curse of dimensionality. We present an algorithm whose sample complexity has improved dependence on dimension.
  arXiv  Detail & Related papers  (2024-11-01T17:59:53Z)
• Kernel Density Estimators in Large Dimensions [9.299356601085586]
  We study the kernel-based estimate of the density $hatrho_hmathcal D(x)=frac1n hdsum_i=1n Kleft(fracx-y_ihright)$, depending on the bandwidth $h$. We show that the optimal bandwidth threshold based on Kullback-Leibler divergence lies in the new statistical regime identified in this paper.
  arXiv  Detail & Related papers  (2024-08-11T15:56:44Z)
• Convergence Analysis of Probability Flow ODE for Score-based Generative Models [5.939858158928473]
  We study the convergence properties of deterministic samplers based on probability flow ODEs from both theoretical and numerical perspectives. We prove the total variation between the target and the generated data distributions can be bounded above by $mathcalO(d3/4delta1/2)$ in the continuous time level.
  arXiv  Detail & Related papers  (2024-04-15T12:29:28Z)
• Semidefinite programming relaxations and debiasing for MAXCUT-based clustering [1.9761774213809036]
  We consider the problem of partitioning a small data sample of size $n$ drawn from a mixture of 2 sub-gaussian distributions in $mathbbRp$. We use semidefinite programming relaxations of an integer quadratic program that is formulated as finding the maximum cut on a graph.
  arXiv  Detail & Related papers  (2024-01-16T03:14:24Z)
• A Unified Framework for Uniform Signal Recovery in Nonlinear Generative Compressed Sensing [68.80803866919123]
  Under nonlinear measurements, most prior results are non-uniform, i.e., they hold with high probability for a fixed $mathbfx*$ rather than for all $mathbfx*$ simultaneously. Our framework accommodates GCS with 1-bit/uniformly quantized observations and single index models as canonical examples. We also develop a concentration inequality that produces tighter bounds for product processes whose index sets have low metric entropy.
  arXiv  Detail & Related papers  (2023-09-25T17:54:19Z)
• Condition-number-independent Convergence Rate of Riemannian Hamiltonian Monte Carlo with Numerical Integrators [22.49731518828916]
  We show that for distributions in the form of $e-alphatopx$ on a polytope with $m constraints, the convergence rate of a family of commonly-used$$ is independent of $leftVert alpharightVert$ and the geometry of the polytope. These guarantees are based on a general bound on the convergence rate for densities of the form $e-f(x)$ in terms of parameters of the manifold and the integrator.
  arXiv  Detail & Related papers  (2022-10-13T17:46:51Z)
• 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)
• Classical shadows of fermions with particle number symmetry [0.0]
  We provide an estimator for any $k$-RDM with $mathcalO(k2eta)$ classical complexity. Our method, in the worst-case of half-filling, still provides a factor of $4k$ advantage in sample complexity.
  arXiv  Detail & Related papers  (2022-08-18T17:11:12Z)
• A Law of Robustness beyond Isoperimetry [84.33752026418045]
  We prove a Lipschitzness lower bound $Omega(sqrtn/p)$ of robustness of interpolating neural network parameters on arbitrary distributions. We then show the potential benefit of overparametrization for smooth data when $n=mathrmpoly(d)$. We disprove the potential existence of an $O(1)$-Lipschitz robust interpolating function when $n=exp(omega(d))$.
  arXiv  Detail & Related papers  (2022-02-23T16:10:23Z)
• Linear Time Sinkhorn Divergences using Positive Features [51.50788603386766]
  Solving optimal transport with an entropic regularization requires computing a $ntimes n$ kernel matrix that is repeatedly applied to a vector. We propose to use instead ground costs of the form $c(x,y)=-logdotpvarphi(x)varphi(y)$ where $varphi$ is a map from the ground space onto the positive orthant $RRr_+$, with $rll n$.
  arXiv  Detail & Related papers  (2020-06-12T10:21:40Z)
• Robustly Learning any Clusterable Mixture of Gaussians [55.41573600814391]
  We study the efficient learnability of high-dimensional Gaussian mixtures in the adversarial-robust setting. We provide an algorithm that learns the components of an $epsilon$-corrupted $k$-mixture within information theoretically near-optimal error proofs of $tildeO(epsilon)$. Our main technical contribution is a new robust identifiability proof clusters from a Gaussian mixture, which can be captured by the constant-degree Sum of Squares proof system.
  arXiv  Detail & Related papers  (2020-05-13T16:44:12Z)
• Uniform Probability Distribution Over All Density Matrices [0.0]
  We identify a probability measure $u$ on $mathscrD$ that can be regarded as the uniform distribution over $mathscrD$. We compute the joint distribution of the eigenvalues of a random density matrix distributed according to this measure.
  arXiv  Detail & Related papers  (2020-03-29T17:45:52Z)

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.