Optimizing confidence in negative-partial-transpose-based entanglement criteria

• URL: http://arxiv.org/abs/2502.19624v1
• Date: Wed, 26 Feb 2025 23:26:41 GMT
• Title: Optimizing confidence in negative-partial-transpose-based entanglement criteria
• Authors: Lydia A. Kanari-Naish, Jack Clarke, Sofia Qvarfort, Michael R. Vanner,
• Abstract summary: A key requirement of any separable quantum state is that its density matrix has a positive partial transpose.<n>For continuous bipartite quantum states, violation of this condition may be tested via the hierarchy of negative-partial-transpose (NPT) based entanglement criteria.<n>Here, we develop a framework for selecting the optimal NPT-based criterion.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A key requirement of any separable quantum state is that its density matrix has a positive partial transpose. For continuous bipartite quantum states, violation of this condition may be tested via the hierarchy of negative-partial-transpose (NPT) based entanglement criteria introduced by Shchukin and Vogel [Phys. Rev. Lett. 95, 230502 (2005)]. However, a procedure for selecting the optimal NPT-based criterion is currently lacking. Here, we develop a framework to select the optimal criterion by determining the level of confidence of criteria within the Shchukin and Vogel hierarchy for finite measurement number, environmental noise, and the optimal allocation of measurement resources. To demonstrate the utility of our approach, we apply our statistical framework to prominent example Gaussian and non-Gaussian states, including the two-mode squeezed vacuum state, the quanta-subtracted two-mode squeezed vacuum state, and the two-mode Schr\"odinger-cat state. Beyond bipartite inseparability tests, our framework can be applied to any Hermitian matrix constructed of observable moments and thus can be utilized for a wide variety of other nonclassicality criteria and multi-mode entanglement tests.

Related papers

• Rectifying Conformity Scores for Better Conditional Coverage [75.73184036344908]
  We present a new method for generating confidence sets within the split conformal prediction framework.<n>Our method performs a trainable transformation of any given conformity score to improve conditional coverage while ensuring exact marginal coverage.
  arXiv  Detail & Related papers  (2025-02-22T19:54:14Z)
• SQ Lower Bounds for Non-Gaussian Component Analysis with Weaker Assumptions [50.20087216230159]
  We study the complexity of Non-Gaussian Component Analysis (NGCA) in the Statistical Query model. We prove near-optimal SQ lower bounds for NGCA under the moment-matching condition only.
  arXiv  Detail & Related papers  (2024-03-07T18:49:32Z)
• On the Privacy of Selection Mechanisms with Gaussian Noise [44.577599546904736]
  We revisit the analysis of Report Noisy Max and Above Threshold with Gaussian noise. We find that it is possible to provide pure ex-ante DP bounds for Report Noisy Max and pure ex-post DP bounds for Above Threshold.
  arXiv  Detail & Related papers  (2024-02-09T02:11:25Z)
• Detecting continuous variable entanglement in phase space with the $Q$-distribution [0.0]
  We prove a class of continuous variable entanglement criteria based on the Husimi $Q$-distribution. We discuss their generality, which roots in the possibility to optimize over the set of concave functions.
  arXiv  Detail & Related papers  (2022-11-30T17:01:24Z)
• A family of separability criteria and lower bounds of concurrence [0.76146285961466]
  We consider a family of separable criteria for bipartite states, and present when the density matrix corresponds to a state is real, the criteria is equivalent to the enhanced realignment criterion. We also present analytical lower bounds of concurrence and the convex-roof extended negativity for arbitrary dimensional systems.
  arXiv  Detail & Related papers  (2022-11-09T13:19:13Z)
• Targeted Separation and Convergence with Kernel Discrepancies [61.973643031360254]
  kernel-based discrepancy measures are required to (i) separate a target P from other probability measures or (ii) control weak convergence to P. In this article we derive new sufficient and necessary conditions to ensure (i) and (ii) For MMDs on separable metric spaces, we characterize those kernels that separate Bochner embeddable measures and introduce simple conditions for separating all measures with unbounded kernels.
  arXiv  Detail & Related papers  (2022-09-26T16:41:16Z)
• A Quantum Optimal Control Problem with State Constrained Preserving Coherence [68.8204255655161]
  We consider a three-level $Lambda$-type atom subjected to Markovian decoherence characterized by non-unital decoherence channels. We formulate the quantum optimal control problem with state constraints where the decoherence level remains within a pre-defined bound.
  arXiv  Detail & Related papers  (2022-03-24T21:31:34Z)
• High Probability Complexity Bounds for Non-Smooth Stochastic Optimization with Heavy-Tailed Noise [51.31435087414348]
  It is essential to theoretically guarantee that algorithms provide small objective residual with high probability. Existing methods for non-smooth convex optimization have complexity bounds with dependence on confidence level. We propose novel stepsize rules for two methods with gradient clipping.
  arXiv  Detail & Related papers  (2021-06-10T17:54:21Z)
• Optimal Entanglement Certification from Moments of the Partial Transpose [2.9475513512647455]
  We propose two general entanglement detection methods based on the moments of the partially transposed density matrix. The first method is based on the Hankel matrices and provides a family of entanglement criteria. The second method is optimal and gives necessary and sufficient conditions for entanglement based on some moments of the partially transposed density matrix.
  arXiv  Detail & Related papers  (2021-03-11T19:00:03Z)
• Discrimination of quantum states under locality constraints in the many-copy setting [18.79968161594709]
  We prove that the optimal average error probability always decays exponentially in the number of copies. We show an infinite separation between the separable (SEP) and PPT operations by providing a pair of states constructed from an unextendible product basis (UPB) On the technical side, we prove this result by providing a quantitative version of the well-known statement that the tensor product of UPBs is a UPB.
  arXiv  Detail & Related papers  (2020-11-25T23:26:33Z)
• Multipartite entanglement detection via projective tensor norms [1.2891210250935143]
  We study a class of entanglement criteria based on the idea of applying local contractions to an input multipartite state. We analyze the performance of this type of criteria on bipartite and multipartite systems. We show that previously studied entanglement criteria, such as the realignment and the SIC POVM criteria, can be viewed inside this framework.
  arXiv  Detail & Related papers  (2020-10-13T13:19:23Z)
• On Lower Bounds for Standard and Robust Gaussian Process Bandit Optimization [55.937424268654645]
  We consider algorithm-independent lower bounds for the problem of black-box optimization of functions having a bounded norm. We provide a novel proof technique for deriving lower bounds on the regret, with benefits including simplicity, versatility, and an improved dependence on the error probability.
  arXiv  Detail & Related papers  (2020-08-20T03:48:14Z)

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.