Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.34338

A Reduction Bound for Entanglement Detection by Positive Free Maps

Chin-Yen Lee

quant-phmath.OASubmitted Oct 25, 2026• Announced Oct 27, 2026• 0 citations
arXivHTMLPDF

Abstract

Collins, Hayden, and Nechita used free probability to construct families of $k$-positive but not $(k+1)$-positive maps and applied them to entanglement detection. We prove that positive free maps associated with compactly supported freely infinitely divisible distributions are no stronger than the reduction criterion in every ancillary dimension. In particular, these maps cannot detect positive partial transpose entanglement. The proof combines a joint Fock realization with an operator positivity certificate derived from free Lévy data.

AI Summary

Positive maps constructed from free products provide entanglement tests, but their strength relative to standard criteria is not fully characterized. This paper compares the Collins–Hayden–Nechita free maps $\Phi_\mu$ with the reduction and positive partial transpose (PPT) criteria when $\mu$ is compactly supported and freely infinitely divisible. The main theorem states that, for every input dimension $n\ge2$ and ancillary dimension $m\ge1$, positivity of $\Phi_\mu$ implies $K_{\mathrm{RED}}^{(n,m)}\subseteq K_\mu^{(n,m)}$, where each set consists of states passing the corresponding test. Thus these maps detect no state that passes the reduction criterion and, since PPT implies reduction, cannot detect PPT entanglement. The bound is exact and dimension-independent rather than asymptotic. The proof constructs a joint full-Fock-space realization of the map’s corner variables, matching their mixed free cumulants. Positivity of the map yields a certificate in its free Lévy data: there exists $q\ge0$ such that $\begin{pmatrix}\gamma-q&v^*/\sqrt n\\v/\sqrt n&X/n+qI\end{pmatrix}\succeq0$. This step uses vacuum faithfulness, tensor-power test vectors, and an S-lemma argument. Normalizing a reduction-positive input gives a positive contraction; the certificate then lifts to an operator-valued block inequality ensuring positivity of the Fock realization. Moment matching and faithfulness transfer positivity back to the original map. The result is restricted to compactly supported freely infinitely divisible distributions. It does not resolve the broader comparison with PPT, or characterize states passing all positive free maps associated with unrestricted distributions.

No sign of AI-generated text

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

Random and Free Positive Maps with Applications to Entanglement Detection

Benoı̂t Collins, Patrick M. Hayden, Ion Nechita

We apply random matrix and free probability techniques to the study of linear maps of interest in quantum information theory. Random quantum channels have already been widely investigated with spectacular success. Here, we are interested in more general maps, asking only for k-positivity instead of the complete positivity required of quantum channels. Unlike the theory of completely positive maps, the theory of k-positive maps is far from being completely understood, and our techniques give many new parametrized families of such maps. We also establish a conceptual link with free probability theory and show that our constructions can be obtained to some extent without random techniques in the setup of free products of von Neumann algebras. Finally, we study the properties of our examples and show that for some parameters, they are indecomposable. In particular, they can be used to detect the presence of entanglement missed by the partial transposition test, that is, positive partial transposition entanglement. As an application, we considerably refine our understanding of positive partial transposition states in the case where one of the spaces is large, whereas the other one remains small.

arXiv:1505.08042•International Mathematics Research Notices•May 10, 2016•10 citations

Constructions of indecomposable positive maps based on a new criterion for indecomposability

Hall, William

We give a criterion for a positive mapping on the space of operators on a Hilbert space to be indecomposable. We show that this criterion can be applied to two families of positive maps. These families of maps can then be used to form separability criteria for bipartite quantum states that can detect the entanglement of bound entangled quantum states.

arXiv:quant-ph/0607035•Jul 5, 2006•3 citations

A new criterion for indecomposability of positive maps

William Hall

We give a criterion for a positive mapping on the space of operators on a Hilbert space to be indecomposable. We show that this criterion can be applied to two families of positive maps. These families of maps can then be used to form separability criteria for bipartite quantum states that can detect the entanglement of bound entangled quantum states.

Journal of Physics A Mathematical and General•Oct 24, 2006•67 citations

On the reduction criterion for random quantum states

Maria Anastasia Jivulescu, Nicolae Lupa, Ion Nechita

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 theory to study the asymptotic positivity of the reduction operators. Finally, we compare the reduction criterion with other entanglement criteria, via thresholds.

arXiv:1402.4292•Journal of Mathematical Physics•Nov 1, 2014•9 citations

Beyond the standard entropic inequalities: Stronger scalar separability criteria and their applications

Remigiusz Augusiak, Julia Stasińska, Paweł Horodecki

Recently it was shown that if a given state fulfils the reduction criterion, it must also satisfy the known entropic inequalities. The natural question arises as to whether it is possible to derive some scalar inequalities stronger than the entropic ones, assuming that stronger criteria based on positive but not completely positive maps are satisfied. In the present paper we show that if certain conditions hold, the extended reduction criterion [H.-P. Breuer, Phys. Rev. Lett 97, 080501 (2006); W. Hall, J. Phys. A 40, 6183 (2007)] leads to some entropiclike inequalities, much stronger than their entropic counterparts. The comparison of the derived inequalities with other separability criteria shows that such an approach might lead to strong scalar criteria detecting both distillable and bound entanglement. In particular, in the case of SO(3)-invariant states it is shown that the present inequalities detect entanglement in regions, in which linear entanglement witnesses based on the extended reduction map fail. It should also be emphasized that in the case of $2\ensuremath{\bigotimes}d$ states the derived inequalities detect entanglement efficiently, while the extended reduction maps are useless, when acting on the qubit subsystem. Moreover, there is a natural way to construct a many-copy entanglement witnesses based on the derived inequalities so, in principle, there is a possibility of experimental realization. Some open problems and possibilities for further research are outlined.

arXiv:0707.4315•Physical Review A•Jan 28, 2008•11 citations

Entanglement and distillation from symmetric positive maps

Albert Rico

Recently, a toolkit of highly symmetric techniques employing matrix inequalities has been developed to detect entanglement in various ways. Here we unifiedly explain in detail these methods, and expand them to a new family of positive maps with further detection capabilities. In the simplest case, we generalize the reduction map to detect more generic states using both multiple copies and local filters. Through the Choi-Jamiołkowski isomorphism, this family of maps leads to a construction of multipartite entanglement witnesses. Discussions and examples are provided regarding the detection of states with local positive partial transposition and the use of multiple copies.

arXiv:2502.18446•Physical Review A•Jan 5, 2026•2 citations
Collins, Hayden, and Nechita used free probability to construct families of kkk-positive but not (k+1)(k+1)(k+1)-positive maps and applied them to entanglement detection. We prove that positive free maps associated with compactly supported freely infinitely divisible distributions are no stronger than the reduction criterion in every ancillary dimension. In particular, these maps cannot detect positive partial transpose entanglement. The proof combines a joint Fock realization with an operator positivity certificate derived from free Lévy data.
Positive maps constructed from free products provide entanglement tests, but their strength relative to standard criteria is not fully characterized. This paper compares the Collins–Hayden–Nechita free maps Φμ\Phi_\muΦμ​ with the reduction and positive partial transpose (PPT) criteria when μ\muμ is compactly supported and freely infinitely divisible.
The main theorem states that, for every input dimension n≥2n\ge2n≥2 and ancillary dimension m≥1m\ge1m≥1, positivity of Φμ\Phi_\muΦμ​ implies KRED(n,m)⊆Kμ(n,m)K_{\mathrm{RED}}^{(n,m)}\subseteq K_\mu^{(n,m)}KRED(n,m)​⊆Kμ(n,m)​, where each set consists of states passing the corresponding test. Thus these maps detect no state that passes the reduction criterion and, since PPT implies reduction, cannot detect PPT entanglement. The bound is exact and dimension-independent rather than asymptotic.
The proof constructs a joint full-Fock-space realization of the map’s corner variables, matching their mixed free cumulants. Positivity of the map yields a certificate in its free Lévy data: there exists q≥0q\ge0q≥0 such that (γ−qv∗/nv/nX/n+qI)⪰0\begin{pmatrix}\gamma-q&v^*/\sqrt n\\v/\sqrt n&X/n+qI\end{pmatrix}\succeq0(γ−qv/n​​v∗/n​X/n+qI​)⪰0. This step uses vacuum faithfulness, tensor-power test vectors, and an S-lemma argument. Normalizing a reduction-positive input gives a positive contraction; the certificate then lifts to an operator-valued block inequality ensuring positivity of the Fock realization. Moment matching and faithfulness transfer positivity back to the original map.
The result is restricted to compactly supported freely infinitely divisible distributions. It does not resolve the broader comparison with PPT, or characterize states passing all positive free maps associated with unrestricted distributions.
We apply random matrix and free probability techniques to the study of linear maps of interest in quantum information theory. Random quantum channels have already been widely investigated with spectacular success. Here, we are interested in more general maps, asking only for k-positivity instead of the complete positivity required of quantum channels. Unlike the theory of completely positive maps, the theory of k-positive maps is far from being completely understood, and our techniques give many new parametrized families of such maps. We also establish a conceptual link with free probability theory and show that our constructions can be obtained to some extent without random techniques in the setup of free products of von Neumann algebras. Finally, we study the properties of our examples and show that for some parameters, they are indecomposable. In particular, they can be used to detect the presence of entanglement missed by the partial transposition test, that is, positive partial transposition entanglement. As an application, we considerably refine our understanding of positive partial transposition states in the case where one of the spaces is large, whereas the other one remains small.
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 theory to study the asymptotic positivity of the reduction operators. Finally, we compare the reduction criterion with other entanglement criteria, via thresholds.
Recently it was shown that if a given state fulfils the reduction criterion, it must also satisfy the known entropic inequalities. The natural question arises as to whether it is possible to derive some scalar inequalities stronger than the entropic ones, assuming that stronger criteria based on positive but not completely positive maps are satisfied. In the present paper we show that if certain conditions hold, the extended reduction criterion [H.-P. Breuer, Phys. Rev. Lett 97, 080501 (2006); W. Hall, J. Phys. A 40, 6183 (2007)] leads to some entropiclike inequalities, much stronger than their entropic counterparts. The comparison of the derived inequalities with other separability criteria shows that such an approach might lead to strong scalar criteria detecting both distillable and bound entanglement. In particular, in the case of SO(3)-invariant states it is shown that the present inequalities detect entanglement in regions, in which linear entanglement witnesses based on the extended reduction map fail. It should also be emphasized that in the case of $2\ensuremath{\bigotimes}d$ states the derived inequalities detect entanglement efficiently, while the extended reduction maps are useless, when acting on the qubit subsystem. Moreover, there is a natural way to construct a many-copy entanglement witnesses based on the derived inequalities so, in principle, there is a possibility of experimental realization. Some open problems and possibilities for further research are outlined.
Recently, a toolkit of highly symmetric techniques employing matrix inequalities has been developed to detect entanglement in various ways. Here we unifiedly explain in detail these methods, and expand them to a new family of positive maps with further detection capabilities. In the simplest case, we generalize the reduction map to detect more generic states using both multiple copies and local filters. Through the Choi-Jamiołkowski isomorphism, this family of maps leads to a construction of multipartite entanglement witnesses. Discussions and examples are provided regarding the detection of states with local positive partial transposition and the use of multiple copies.