General class of continuous variable entanglement criteria

• URL: http://arxiv.org/abs/2211.17160v2
• Date: Mon, 15 Jan 2024 14:41:32 GMT
• Title: General class of continuous variable entanglement criteria
• Authors: Martin G\"arttner and Tobias Haas and Johannes Noll
• Abstract summary: We present a general class of entanglement criteria for continuous variable systems. Our criteria reveal entanglement of families of states undetected by any commonly used criteria.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a general class of entanglement criteria for continuous variable systems. Our criteria are based on the Husimi $Q$-distribution and allow for optimization over the set of all concave functions rendering them extremely general and versatile. We show that several entropic criteria and second moment criteria are obtained as special cases. Our criteria reveal entanglement of families of states undetected by any commonly used criteria and provide clear advantages under typical experimental constraints such as finite detector resolution and measurement statistics.

Related papers

• Several families of entanglement criteria for multipartite quantum systems based on generalized Wigner-Yanase skew information and variance [7.889770216618095]
  We propose several families of entanglement criteria for detecting entanglement in multipartite or high-dimensional quantum states. We show that the combination of the entanglement criteria has a stronger detection capability.
  arXiv  Detail & Related papers  (2024-09-17T15:24:48Z)
• 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)
• Minimal criteria for continuous-variable genuine multipartite entanglement [0.0]
  We derive a set of genuine multi-mode entanglement criteria for second moments of the quadrature operators. A unique feature of the criteria is that the sums contain the least possible number of variances of at most two-mode combinations.
  arXiv  Detail & Related papers  (2024-01-09T06:40:05Z)
• Likelihood Ratio Confidence Sets for Sequential Decision Making [51.66638486226482]
  We revisit the likelihood-based inference principle and propose to use likelihood ratios to construct valid confidence sequences. Our method is especially suitable for problems with well-specified likelihoods. We show how to provably choose the best sequence of estimators and shed light on connections to online convex optimization.
  arXiv  Detail & Related papers  (2023-11-08T00:10:21Z)
• Optimizing detection of continuous variable entanglement for limited data [0.0]
  We consider the scenario of coarse grained measurements, or finite detector resolution, where the values of the Husimi $Q$-distribution are only known on a grid of points in phase space. We customize our entanglement criteria to maximize the statistical significance of the detection for a given finite number of samples.
  arXiv  Detail & Related papers  (2022-11-30T17:05:08Z)
• 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)
• Statistical Comparisons of Classifiers by Generalized Stochastic Dominance [0.0]
  There is still no consensus on how to compare classifiers over multiple data sets with respect to several criteria. In this paper, we add a fresh view to the vivid debate by adopting recent developments in decision theory. We show that our framework ranks classifiers by a generalized concept of dominance, which powerfully circumvents the cumbersome, and often even self-contradictory, reliance on aggregates.
  arXiv  Detail & Related papers  (2022-09-05T09:28:15Z)
• Preference learning along multiple criteria: A game-theoretic perspective [97.94912276610002]
  We generalize the notion of a von Neumann winner to the multi-criteria setting by taking inspiration from Blackwell's approachability. Our framework allows for non-linear aggregation of preferences across criteria, and generalizes the linearization-based approach from multi-objective optimization. We show that the Blackwell winner of a multi-criteria problem instance can be computed as the solution to a convex optimization problem.
  arXiv  Detail & Related papers  (2021-05-05T03:23:11Z)
• Dimension Free Generalization Bounds for Non Linear Metric Learning [61.193693608166114]
  We provide uniform generalization bounds for two regimes -- the sparse regime, and a non-sparse regime. We show that by relying on a different, new property of the solutions, it is still possible to provide dimension free generalization guarantees.
  arXiv  Detail & Related papers  (2021-02-07T14:47:00Z)
• Convolution-Weight-Distribution Assumption: Rethinking the Criteria of Channel Pruning [90.2947802490534]
  We find two blind spots in the study of pruning criteria. The ranks of filters'Importance Score are almost identical, resulting in similar pruned structures. The filters'Importance Score measured by some pruning criteria are too close to distinguish the network redundancy well.
  arXiv  Detail & Related papers  (2020-04-24T09:54:21Z)
• Generalized Sliced Distances for Probability Distributions [47.543990188697734]
  We introduce a broad family of probability metrics, coined as Generalized Sliced Probability Metrics (GSPMs) GSPMs are rooted in the generalized Radon transform and come with a unique geometric interpretation. We consider GSPM-based gradient flows for generative modeling applications and show that under mild assumptions, the gradient flow converges to the global optimum.
  arXiv  Detail & Related papers  (2020-02-28T04:18:00Z)

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.