Moment-based PPT criteria for random bipartite states

• URL: http://arxiv.org/abs/2607.11369v1
• Date: Mon, 13 Jul 2026 10:32:42 GMT
• Title: Moment-based PPT criteria for random bipartite states
• Abstract summary: This work is to study the typical detection performance on high-dimensional bipartite systems.<n>We investigate whether random bipartite mixed states on $mathbb Cdotimesmathbb Cd$, obtained as the marginal over an environment $mathbb Cs$ of a uniformly distributed pure state, generically satisfy or violate them.
• Score: 0.21485350418225238
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Moment-based relaxations of the positive partial transpose (PPT) criterion have been recently introduced, as a hierarchy of entanglement criteria involving only experimentally accessible quantities of a given bipartite state. The goal of this work is to study their typical detection performance on high-dimensional bipartite systems. Concretely, we investigate whether random bipartite mixed states on $\mathbb C^d\otimes\mathbb C^d$, obtained as the marginal over an environment $\mathbb C^s$ of a uniformly distributed pure state, generically satisfy or violate them. For each fixed level $m\in\mathbb N$ in this hierarchy of moment-based PPT criteria, we are able to identify a threshold environment dimension $s=λ_md^2$ at which the behavior of the associated random state switches from violating to satisfying it, with probability going to $1$ as $d$ grows. The proof combines combinatorics of permutations techniques to estimate the average value of moments of partially transposed random states and concentration of measure arguments to bound the probability of deviating from such average, when the underlying local dimension $d$ is large. We additionally need tools from the theory of Hankel determinant evaluation via orthogonal polynomials.

Related papers

• Uniform Statistical Convergence of Empirical Sinkhorn Potentials with Exponential and Polynomial Dependence on the Regularization Parameter [3.6552781109515853]
  We study the empirical Sinkhorn estimator of the entropic optimal transport potentials under the uniform loss.<n>For a fixed regularization parameter $varepsilon>0$, we establish a non-asymptotic statistical rate of $n-1/2$.<n>Key requirement is a residual-stability estimate for the population Sinkhorn map.
  arXiv  Detail & Related papers  (2026-08-29T08:59:00Z)
• Probing quantumness of superpositions of Gaussian states via Tsirelson probability [8.385099055570224]
  We compute the Tsirelson probability for superpositions of Gaussian states.<n>For circular states, we analytically calculate their Tsirelson probability and find violations of the classical bounds.<n>Our results provide a comprehensive map of the dynamical nonclassicality of superpositions of Gaussian states.
  arXiv  Detail & Related papers  (2026-08-21T15:27:17Z)
• Robust Average-Reward Markov Decision Processes: Minimax-Optimal Learning via Plug-in Reductions [51.50375419691955]
  Distributionally robust Markov decision processes provide a principled framework for sequential decision making under model uncertainty.<n>We study how many samples are necessary and sufficient to learn an $varepsilon$-optimal robust policy under the average-reward criterion.
  arXiv  Detail & Related papers  (2026-08-06T19:49:48Z)
• Detecting entanglement of non-Gaussian continuous-variable states from single-copy homodyne measurements [0.047056701241378535]
  Non-Gaussian entanglement detection remains an experimental challenge.<n>$p_3$-PPT criterion detects entanglement using moments of the partial transpose of the density matrix.<n>We introduce a single-copy homodyne protocol that detects bipartite CV entanglement via the same criterion.
  arXiv  Detail & Related papers  (2026-06-27T02:55:23Z)
• Is Spurious Correlation Removal Always Learnable? [56.28155520961125]
  Invariant learning can fail even when the structure is statistically identifiable.<n>We show a conditional computational barrier: under a black-box samplable supervised sparse recovery primitive, there exist emphamplable multi-dimensional environments.<n>Synthetic and real datasets illustrate the predicted gaps and transitions and motivate simple diversity diagnostics.
  arXiv  Detail & Related papers  (2026-06-11T05:49:43Z)
• Tight Convergence Rates for Online Distributed Linear Estimation with Adversarial Measurements [66.94250413799232]
  We study mean estimation of a random vector $X$ in a distributed parameter-server-worker setup.<n>Key challenges are adversarial measurements and asynchrony.<n>Results provide a unified finite-time characterization of robustness, identifiability, and statistical efficiency in distributed linear estimation with adversarial workers.
  arXiv  Detail & Related papers  (2026-04-07T11:45:55Z)
• Phase Transition for Stochastic Block Model with more than $\sqrt{n}$ Communities [51.320599504997745]
  Predictions from statistical physics postulate that recovery of the communities in Block Model (SBM) is possible in time above, and only above, the KestenStigum (KS) threshold.<n>Chin et al.(2025) recently prove that, in a sparse regime, community recovery in time is possible below the KS threshold by counting nonbacktracking paths.
  arXiv  Detail & Related papers  (2025-09-19T09:53:56Z)
• Learning with Norm Constrained, Over-parameterized, Two-layer Neural Networks [54.177130905659155]
  Recent studies show that a reproducing kernel Hilbert space (RKHS) is not a suitable space to model functions by neural networks. In this paper, we study a suitable function space for over- parameterized two-layer neural networks with bounded norms.
  arXiv  Detail & Related papers  (2024-04-29T15:04:07Z)
• Estimating coherence with respect to general quantum measurements [4.707579791895607]
  Generalized quantum coherence with respect to general positive operator-valued measurements (POVMs) has been presented. Several well-defined coherence measures, such as the relative entropy of coherence $C_r$, the $l_1$ norm of coherence $C_l_1$ and the coherence $C_T,alpha $ have been obtained.
  arXiv  Detail & Related papers  (2021-09-29T10:19:23Z)
• Joint quasiprobability distribution on the measurement outcomes of MUB-driven operators [2.9005223064604078]
  Method is based on a complete set of orthonormal commuting operators related to Mutually Unbiased Bases. We geometrically characterise the set of states for which the quasiprobability distribution is non-negative. The set is an $(n2-1)$-dimensional convex polytope with $n+1$ as the only pure states, $nn+1$ number of higher dimensional faces, and $n3(n+1)/2$ edges.
  arXiv  Detail & Related papers  (2021-01-20T13:10:26Z)
• Nonparametric approximation of conditional expectation operators [0.3655021726150368]
  We investigate the approximation of the $L2$-operator defined by $[Pf](x) := mathbbE[ f(Y) mid X = x ]$ under minimal assumptions. We prove that $P$ can be arbitrarily well approximated in operator norm by Hilbert-Schmidt operators acting on a reproducing kernel space.
  arXiv  Detail & Related papers  (2020-12-23T19:06:12Z)
• Random quantum circuits anti-concentrate in log depth [118.18170052022323]
  We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated. Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform. In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
  arXiv  Detail & Related papers  (2020-11-24T18:44:57Z)
• 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)

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.