arXiv 1402.42922014-02math-phmath.MPmath.PRquant-ph

On the reduction criterion for random quantum states

Maria Anastasia Jivulescu, Nicolae Lupa, Ion Nechita

发表信息：: Journal of Mathematical Physics 55, 112203 (2014)
DOI：: 10.1063/1.4901548

英文摘要：

In this paper we study the reduction criterion for detecting entanglement of large dimensional bipartite quantum systems. We first obtain an explicit formula for the moments of a random quantum state to which the reduction criterion has been applied. We show that the empirical eigenvalue distribution of this random matrix converges strongly to a limit that we compute, in three different asymptotic regimes. We then employ tools from free probability to study the asymptotic positivity of the reduction operators. Finally, we compare the reduction criterion with other entanglement criteria, via thresholds.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Realigning random states

We study how the realignment criterion (also called computable cross-norm criterion) succeeds asymptotically in detecting whether random states are separable or entangled. We consider random states on $\C^d \otimes \C^d$ obtained by partial tracing a Haar-distributed random pure state on $\C^d \otimes \C^d \otimes \C^s$ over an ancilla space $\C^s$. We show that, for large $d$, the realignment criterion typically detects entanglement if and only if $s \leq (8/3π)^2 d^2$. In this sense, the realignment criterion is asymptotically weaker than the partial transposition criterion.

2012-03-18math-phmath.MPmath.PR

Thresholds for reduction-related entanglement criteria in quantum information theory

We consider random bipartite quantum states obtained by tracing out one subsystem from a random, uniformly distributed, tripartite pure quantum state. We compute thresholds for the dimension of the system being traced out, so that the resulting bipartite quantum state satisfies the reduction criterion in different asymptotic regimes. We consider as well the basis-independent version of the reduction criterion (the absolute reduction criterion), computing thresholds for the corresponding eigenvalue sets. We do the same for other sets relevant in the study of absolute separability, using techniq…

2015-06-03math-phmath.MPquant-ph

A Criterion for the Covering Condition of Generalized Random Matrix Ensembles

In this paper we present a criterion for the covering condition of the generalized random matrix ensemble, which enable us to verify the covering condition for the seven classes of generalized random matrix ensemble in an unified and simpler way.

2005-10-03math-phmath.MP

Lie-Poincare' transformations and a reduction criterion in Landau theory

In the Landau theory of phase transitions one considers an effective potential $Φ$ whose symmetry group $G$ and degree $d$ depend on the system under consideration; generally speaking, $Φ$ is the most general $G$-invariant polynomial of degree $d$. When such a $Φ$ turns out to be too complicate for a direct analysis, it is essential to be able to drop unessential terms, i.e. to apply a simplifying criterion. Criteria based on singularity theory exist and have a rigorous foundation, but are often very difficult to apply in practice. Here we consider a simplifying criterion (as stated by Gufan) …

2004-06-18math-phmath.MP

A self-adjointness criterion for the Schrödinger operator with infinitely many point interactions and its application to random operators

We prove the Schrödinger operator with infinitely many point interactions in $\mathbb{R}^d$ $(d=1,2,3)$ is self-adjoint if the support of the interactions is decomposed into uniformly discrete clusters. Using this fact, we prove the self-adjointness of the Schrödinger operator with point interactions on a random perturbation of a lattice or on the Poisson configuration. We also determine the spectrum of the Schrödinger operators with random point interactions of Poisson--Anderson type.

2019-06-01math-phmath.MP

Boosted Simon-Wolff Spectral Criterion and Resonant Delocalization

Discussed here are criteria for the existence of continuous components in the spectra of operators with random potential. First, the essential condition for the Simon-Wolff criterion is shown to be measurable at infinity. By implication, for the iid case and more generally potentials with the K-property the criterion is boosted by a zero-one law. The boosted criterion, combined with tunneling estimates, is then applied for sufficiency conditions for the presence of continuous spectrum for random Schrödinger operators. The general proof strategy which this yields is modeled on the resonant delo…

2015-12-08math-phmath.MPmath.PR

更多相关论文收起更多论文

格点三玻色子三聚体的强耦合Birman-Schwinger分析的均匀椭圆约化、阶匹配判据与精度基准

A uniform elliptic reduction, an order-matching criterion, and precision benchmarks for the strong-coupling Birman-Schwinger analysis of the lattice three-boson trimer

Samara State Technical University（萨马拉国立技术大学）

该研究针对格点三玻色子三聚体的强耦合Birman-Schwinger分析，提出均匀椭圆约化方法与阶匹配判据，推导基态渐近式并验证结果，还对比了少体模型的渐近精度阶。

2026-09-09cs.NAmath-phmath.MP

The disc random packing problem: a disorder criterion and an explicit solution

Predicting the densest random disc packing fraction is an unsolved paradigm problem relevant to a number of disciplines and technologies. One difficulty is that it is ill-defined without setting a criterion for the disorder. Another is that the density depends on the packing protocol and the multitude of possible protocol parameters has so far hindered a general solution. A new approach is proposed here. After formulating a well-posed form of the general protocol-independent problem for planar packings of discs, a systematic criterion is proposed to avoid crystalline hexagonal order as well as…

2021-07-25cond-mat.softcond-mat.stat-mechmath-ph

Fractional Gaussian noise criterion for correlations characterization: a random-matrix-theory inspired perspective

We introduce a particular construction of an autocorrelation matrix of a time series and its analysis based on the random-matrix theory ideas that is capable of unveiling the type of correlations information which is inaccessible to the straight analysis of the autocorrelation function. Exploiting the well-studied hierarchy of the fractional Gaussian noise (fGn), an \emph{in situ} criterion for the sake of a quantitative comparison with the autocorrelation data is offered. We illustrate the applicability of our method by two paradigmatic examples from the orthodox context of the stock markets …

2013-06-08cond-mat.stat-mechmath-phmath.MP

Convergence of clock processes in random environments and ageing in the p-spin SK model

We derive a general criterion for the convergence of clock processes in random dynamics in random environments that is applicable in cases when correlations are not negligible, extending recent results by Gayrard [(2010), (2011), forthcoming], based on general criterion for convergence of sums of dependent random variables due to Durrett and Resnick [Ann. Probab. 6 (1978) 829-846]. We demonstrate the power of this criterion by applying it to the case of random hopping time dynamics of the p-spin SK model. We prove that on a wide range of time scales, the clock process converges to a stable sub…

2013-03-15math-phmath.MPmath.PR

与PPT判据相关的基于矩的纠缠检验的闭式解

A Closed Form for Moment-Based Entanglement Tests Associated to the PPT Criterion

本研究拓展了Neven等人将PPT判据转化为基于矩的纠缠检验层级的工作，给出了对应检验不等式的闭式解，并推导了偏转置诱导加权图的等价图论条件，为量子纠缠验证提供了新的理论工具。

2025-03-21math-phmath.MPquant-ph

Delocalization at small energy for heavy-tailed random matrices

We prove that the eigenvectors associated to small enough eigenvalues of an heavy-tailed symmetric random matrix are delocalized with probability tending to one as the size of the matrix grows to infinity. The delocalization is measured thanks to a simple criterion related to the inverse participation ratio which computes an average ratio of L4 and L2-norms of vectors. In contrast, as a consequence of a previous result, for random matrices with sufficiently heavy tails, the eigenvectors associated to large enough eigenvalues are localized according to the same criterion. The proof is based on …

2016-03-29math-phmath.MPmath.PR