Entanglement certification from moments of positive maps

• URL: http://arxiv.org/abs/2508.09766v1
• Date: Wed, 13 Aug 2025 12:51:58 GMT
• Title: Entanglement certification from moments of positive maps
• Authors: Qing-Hua Zhang, Xiaoyu Ma, Shao-Ming Fei,
• Abstract summary: Entanglement certification is crucial in physical experiments, particularly when only partial knowledge of the quantum state is available.<n>We present an entanglement criterion based on positive but not completely positive maps, which eliminates the need to identify eigenvalues of the output state.
• Score: 9.764802289008196
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Entanglement certification is crucial in physical experiments, particularly when only partial knowledge of the quantum state is available. In this context, we present an entanglement criterion based on positive but not completely positive maps, which eliminates the need to identify eigenvalues of the output state. Notably, the Faddeev-LeVerrier algorithm establishes a relationship between the coefficients of characteristic polynomials and the moments of a matrix. This enables the existence of negative eigenvalues through the moments of the output state. The effectiveness of our criterion relies on the selection of positive maps, similar to the original positive maps criterion.

Related papers

• Operationalizing Quantized Disentanglement [26.410344820790694]
  We develop a criterion for unsupervised disentanglement by encouraging axis-aligned discontinuities.<n>Discontinuities manifest as sharp changes in the estimated density of factors and form what we call cliffs.<n>We show that our method, Cliff, outperforms the baselines on all disentanglement benchmarks.
  arXiv  Detail & Related papers  (2025-11-25T23:41:26Z)
• Value bounds and Convergence Analysis for Averages of LRP attributions [44.992386137813014]
  We analyze numerical properties of Layer-wise relevance propagation (LRP)-type attribution methods by representing them as a product of modified gradient matrices.<n>In particular, our analysis reveals that the constants for LRP-beta remain independent of weight norms, a significant distinction from both gradient-based methods and LRP-epsilon.
  arXiv  Detail & Related papers  (2025-09-10T19:50:00Z)
• Certifying entanglement dimensionality by reduction moments [6.408674550016314]
  We combine the k-reduction map, the moment method, and the classical shadow method into a practical protocol for certifying the entanglement dimensionality.<n>Our approach is based on the observation that a state with entanglement dimensionality at most k must stay positive under the action of the k-reduction map.<n>We show that the k-reduction negativity, the absolute sum of the negative eigenvalues of the k-reduced operator, is monotonic under local operations and classical communication for pure states.
  arXiv  Detail & Related papers  (2025-01-26T01:53:24Z)
• General detectability measure [45.85698554568285]
  Distinguishing resource states from resource-free states is a fundamental task in quantum information.<n>We derived the optimal exponential decay rate of the failure probability for detecting a given $n$-tensor product state.
  arXiv  Detail & Related papers  (2025-01-16T05:39:22Z)
• A mathematical certification for positivity conditions in Neural Networks with applications to partial monotonicity and Trustworthy AI [44.14503189596442]
  LipVor is an algorithm that certifies if a black-box model, such as an ANN, is positive based on a finite number of evaluations.<n>Our approach certifies partial monotonicity without constrained architectures or piece-wise linear activations.
  arXiv  Detail & Related papers  (2024-06-12T07:33:38Z)
• Improving Expressive Power of Spectral Graph Neural Networks with Eigenvalue Correction [55.57072563835959]
  We propose an eigenvalue correction strategy that can free filters from the constraints of repeated eigenvalue inputs.<n>Concretely, the proposed eigenvalue correction strategy enhances the uniform distribution of eigenvalues, and improves the fitting capacity and expressive power of filters.
  arXiv  Detail & Related papers  (2024-01-28T08:12:00Z)
• Positive Semidefinite Matrix Supermartingales [30.14855064043107]
  We explore the convergence and nonasymptotic maximal inequalities of supermartingales and backward submartingales in the space of positive semidefinite matrices.<n>Our results lead to new concentration inequalities for either martingale dependent or exchangeable random symmetric matrices under a variety of tail conditions.<n>These inequalities are usually expressed in the boundsner order, are sometimes valid simultaneously for all sample sizes or at an arbitrary data-dependent stopping time, and can often be tightened via an external randomization factor.
  arXiv  Detail & Related papers  (2024-01-28T04:22:43Z)
• On the Identifiability of Quantized Factors [33.12356885773274]
  We show that it is possible to recover quantized latent factors under a generic nonlinear diffeomorphism. We introduce this novel form of identifiability, termed quantized factor identifiability, and provide a comprehensive proof of the recovery of the quantized factors.
  arXiv  Detail & Related papers  (2023-06-28T16:10:01Z)
• Work statistics, quantum signatures and enhanced work extraction in quadratic fermionic models [62.997667081978825]
  In quadratic fermionic models we determine a quantum correction to the work statistics after a sudden and a time-dependent driving. Such a correction lies in the non-commutativity of the initial quantum state and the time-dependent Hamiltonian. Thanks to the latter, one can assess the onset of non-classical signatures in the KDQ distribution of work.
  arXiv  Detail & Related papers  (2023-02-27T13:42:40Z)
• Physical realization of realignment criteria using structural physical approximation [0.0]
  Entanglement detection is an important problem in quantum information theory. Realignment criteria is a powerful tool for detection of entangled states in bipartite and multipartite quantum system.
  arXiv  Detail & Related papers  (2023-01-24T09:41:33Z)
• Separability criteria based on the Weyl operators [0.0]
  Entanglement as a vital resource for information processing can be described by special properties of the quantum state. We propose a new Bloch decomposition of the quantum state and study its separability problem.
  arXiv  Detail & Related papers  (2022-08-09T14:04:19Z)
• Mean hitting time formula for positive maps [0.0]
  We present an analogous construction for the setting of irreducible, positive, trace preserving maps. The problem at hand is motivated by questions on quantum information theory.
  arXiv  Detail & Related papers  (2022-03-21T01:25:25Z)
• Characterization of $k$-positive maps [0.6827423171182154]
  We construct a family of positive maps between matrix algebras of different dimensions depending on a parameter. The estimate bounds on the parameter to obtain the $k$-positivity are better than those derived from the spectral conditions considered by Chru'sci'nski and Kossakowski.
  arXiv  Detail & Related papers  (2021-04-29T00:46:58Z)

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.