Characterizing entanglement dimensionality from randomized measurements

• URL: http://arxiv.org/abs/2211.09614v1
• Date: Thu, 17 Nov 2022 16:02:21 GMT
• Title: Characterizing entanglement dimensionality from randomized measurements
• Authors: Shuheng Liu and Qiongyi He and Marcus Huber and Otfried G\"uhne and Giuseppe Vitagliano
• Abstract summary: We consider the problem of detecting the dimensionality of entanglement with the use of correlations between measurements in randomized directions. We derive an inequality that resembles well-known entanglement criteria, but contains different bounds for the different dimensionalities of entanglement. We show that it detects strictly more states than the other entanglement-dimensionality criteria available in literature.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We consider the problem of detecting the dimensionality of entanglement with the use of correlations between measurements in randomized directions. First, exploiting the recently derived covariance matrix criterion for the entanglement dimensionality [S. Liu \textit{et al.}, arXiv:2208.04909], we derive an inequality that resembles well-known entanglement criteria, but contains different bounds for the different dimensionalities of entanglement. This criterion is invariant under local unitary operations and can be used to find regions in the space of moments of randomized correlations. After implementing such an algorithm in practical cases, we show that it detects strictly more states than the other entanglement-dimensionality criteria available in literature, thus providing a method that is both very powerful and potentially simpler in practical scenarios. We conclude by discussing the implementation of our method in the multipartite scenario and its potential applications.

Related papers

• SARAH-based Variance-reduced Algorithm for Stochastic Finite-sum Cocoercive Variational Inequalities [137.6408511310322]
  We consider the problem of finite-sum cocoercive variational inequalities. For strongly monotone problems it is possible to achieve linear convergence to a solution using this method.
  arXiv  Detail & Related papers  (2022-10-12T08:04:48Z)
• Intrinsic dimension estimation for discrete metrics [65.5438227932088]
  In this letter we introduce an algorithm to infer the intrinsic dimension (ID) of datasets embedded in discrete spaces. We demonstrate its accuracy on benchmark datasets, and we apply it to analyze a metagenomic dataset for species fingerprinting. This suggests that evolutive pressure acts on a low-dimensional manifold despite the high-dimensionality of sequences' space.
  arXiv  Detail & Related papers  (2022-07-20T06:38:36Z)
• Adaptative clustering by minimization of the mixing entropy criterion [0.0]
  We present a clustering method and provide an explanation to a phenomenon encountered in the applied statistical literature since the 1990's. This phenomenon is the natural adaptability of the order when using a clustering method derived from the famous EM algorithm. We define a new statistic, the relative entropic order, that represents the number of clumps in the target distribution.
  arXiv  Detail & Related papers  (2022-03-22T07:47:02Z)
• Manifold Hypothesis in Data Analysis: Double Geometrically-Probabilistic Approach to Manifold Dimension Estimation [92.81218653234669]
  We present new approach to manifold hypothesis checking and underlying manifold dimension estimation. Our geometrical method is a modification for sparse data of a well-known box-counting algorithm for Minkowski dimension calculation. Experiments on real datasets show that the suggested approach based on two methods combination is powerful and effective.
  arXiv  Detail & Related papers  (2021-07-08T15:35:54Z)
• Generalized quantum measurements with matrix product states: Entanglement phase transition and clusterization [58.720142291102135]
  We propose a method for studying the time evolution of many-body quantum lattice systems under continuous and site-resolved measurement. We observe a peculiar phenomenon of measurement-induced particle clusterization that takes place only for frequent moderately strong measurements, but not for strong infrequent measurements.
  arXiv  Detail & Related papers  (2021-04-21T10:36:57Z)
• 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)
• Optimal oracle inequalities for solving projected fixed-point equations [53.31620399640334]
  We study methods that use a collection of random observations to compute approximate solutions by searching over a known low-dimensional subspace of the Hilbert space. We show how our results precisely characterize the error of a class of temporal difference learning methods for the policy evaluation problem with linear function approximation.
  arXiv  Detail & Related papers  (2020-12-09T20:19:32Z)
• Bound entanglement from randomized measurements [0.0]
  We find the optimal criteria for different forms of multiparticle entanglement in three-qubit systems. For higher-dimensional two-particle systems and higher moments, we provide criteria that are able to characterize various examples of bound entangled states.
  arXiv  Detail & Related papers  (2020-10-16T13:20:53Z)
• Detecting entanglement of unknown continuous variable states with random measurements [0.0]
  We propose new linear constraints characterizing the entanglement witnesses based on second moments. We use them in a semidefinite program providing the optimal entanglement test for given random measurements.
  arXiv  Detail & Related papers  (2020-07-10T23:56:39Z)
• Optimal approximations of available states and a triple uncertainty relation [8.351713971554405]
  We investigate the optimal convex approximation of the quantum state with respect to a set of available states. We show a concise inequality criterion for decomposing qubit mixed states. Our model and method may be applied to solve similar problems in high-dimensional and multipartite scenarios.
  arXiv  Detail & Related papers  (2020-06-15T23:31:51Z)

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.