Semidefinite relaxations for high-dimensional entanglement in the steering scenario

• URL: http://arxiv.org/abs/2410.02554v2
• Date: Thu, 28 Nov 2024 10:05:23 GMT
• Title: Semidefinite relaxations for high-dimensional entanglement in the steering scenario
• Authors: Nicola D'Alessandro, Carles Roch i Carceller, Armin Tavakoli,
• Abstract summary: We introduce semidefinite programming hierarchies for benchmarking entanglement properties in the high-dimensional steering scenario.<n>We demonstrate the usefulness of these methods, which can be directly used to analyse experiments on high-dimensional systems.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce semidefinite programming hierarchies for benchmarking relevant entanglement properties in the high-dimensional steering scenario. Firstly, we provide a general method for detecting the entanglement dimensionality through certification of the Schmidt number. Its key feature is that the computational cost is independent of the Schmidt number under consideration. Secondly, we provide a method to estimate the fidelity of the source with any maximally entangled state. Using only basic computational means, we demonstrate the usefulness of these methods, which can be directly used to analyse experiments on high-dimensional systems.

Related papers

• Detecting high-dimensional entanglement by local randomized projections [1.8749305679160366]
  We introduce a criterion for estimating the Schmidt number of bipartite high-dimensional states based on local randomized projections with first-order moments. Our approach not only obtains a more accurate estimation of the Schmidt number but also reduces the number of projections compared to known methods.
  arXiv  Detail & Related papers  (2025-01-02T06:20:05Z)
• Safe and High-Performance Learning of Model Predicitve Control using Kernel-Based Interpolation [44.99833362998488]
  We present a method, which allows efficient and safe approximation of model predictive controllers using kernel. Since the computational complexity of the approximating function scales linearly with the number of data points, we propose to use a scoring function which chooses the most promising data. In order to guarantee safety and high performance of the designed approximated controller, we use reachability analysis based on Monte Carlo methods.
  arXiv  Detail & Related papers  (2024-10-09T11:04:15Z)
• Uncertainty Quantification with Bayesian Higher Order ReLU KANs [0.0]
  We introduce the first method of uncertainty quantification in the domain of Kolmogorov-Arnold Networks, specifically focusing on (Higher Order) ReLUKANs. We validate our method through a series of closure tests, including simple one-dimensional functions. We demonstrate the method's ability to correctly identify functional dependencies introduced through the inclusion of a term.
  arXiv  Detail & Related papers  (2024-10-02T15:57:18Z)
• Fast kernel half-space depth for data with non-convex supports [5.725360029813277]
  We extend the celebrated halfspace depth to tackle distribution's multimodality. The proposed depth can be computed using manifold gradient making faster than halfspace depth by several orders of magnitude. The performance of our depth is demonstrated through numerical simulations as well as applications such as anomaly detection on real data and homogeneity testing.
  arXiv  Detail & Related papers  (2023-12-21T18:55:22Z)
• Bounding the amount of entanglement from witness operators [2.226837304625373]
  We present an approach to estimate the operational distinguishability between an entangled state and any separable state directly from measuring an entanglement witness. We show that this estimation also implies bounds on a variety of other well-known entanglement quantifiers.
  arXiv  Detail & Related papers  (2023-12-08T08:28:56Z)
• A Multivariate Unimodality Test Harnessing the Dip Statistic of Mahalanobis Distances Over Random Projections [0.18416014644193066]
  We extend one-dimensional unimodality principles to multi-dimensional spaces through linear random projections and point-to-point distancing. Our method, rooted in $alpha$-unimodality assumptions, presents a novel unimodality test named mud-pod. Both theoretical and empirical studies confirm the efficacy of our method in unimodality assessment of multidimensional datasets.
  arXiv  Detail & Related papers  (2023-11-28T09:11:02Z)
• Almost qudits in the prepare-and-measure scenario [0.0]
  We introduce and investigate quantum information encoded in carriers that nearly, but not entirely, correspond to standard qudits. We show how small higher-dimensional components can significantly compromise the conclusions of established protocols. We also consider viewing almost qubit systems as a physical resource available to the experimenter.
  arXiv  Detail & Related papers  (2022-08-16T18:00:07Z)
• Fixed-point iterations for several dissimilarity measure barycenters in the Gaussian case [69.9674326582747]
  In target tracking and sensor fusion contexts it is not unusual to deal with a large number of Gaussian densities. Fixed-Point Iterations (FPI) are presented for the computation of barycenters according to several dissimilarity measures.
  arXiv  Detail & Related papers  (2022-05-10T11:12:12Z)
• Nystr\"om Kernel Mean Embeddings [92.10208929236826]
  We propose an efficient approximation procedure based on the Nystr"om method. It yields sufficient conditions on the subsample size to obtain the standard $n-1/2$ rate. We discuss applications of this result for the approximation of the maximum mean discrepancy and quadrature rules.
  arXiv  Detail & Related papers  (2022-01-31T08:26:06Z)
• Sensing Cox Processes via Posterior Sampling and Positive Bases [56.82162768921196]
  We study adaptive sensing of point processes, a widely used model from spatial statistics. We model the intensity function as a sample from a truncated Gaussian process, represented in a specially constructed positive basis. Our adaptive sensing algorithms use Langevin dynamics and are based on posterior sampling (textscCox-Thompson) and top-two posterior sampling (textscTop2) principles.
  arXiv  Detail & Related papers  (2021-10-21T14:47:06Z)
• Quantum Optimal Control for Pure-State Preparation Using One Initial State [0.0]
  This paper presents a framework for solving the pure-state preparation problem using numerical optimal control. We consider the case where a number of qubits are dispersively coupled to a readout cavity.
  arXiv  Detail & Related papers  (2021-06-16T21:49:48Z)
• Estimating leverage scores via rank revealing methods and randomization [50.591267188664666]
  We study algorithms for estimating the statistical leverage scores of rectangular dense or sparse matrices of arbitrary rank. Our approach is based on combining rank revealing methods with compositions of dense and sparse randomized dimensionality reduction transforms.
  arXiv  Detail & Related papers  (2021-05-23T19:21:55Z)
• Bayesian Quadrature on Riemannian Data Manifolds [79.71142807798284]
  A principled way to model nonlinear geometric structure inherent in data is provided. However, these operations are typically computationally demanding. In particular, we focus on Bayesian quadrature (BQ) to numerically compute integrals over normal laws. We show that by leveraging both prior knowledge and an active exploration scheme, BQ significantly reduces the number of required evaluations.
  arXiv  Detail & Related papers  (2021-02-12T17:38:04Z)
• Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimization [94.18714844247766]
  Wasserstein barycenters provide a geometric notion of the weighted average of probability measures based on optimal transport. We present a scalable algorithm to compute Wasserstein-2 barycenters given sample access to the input measures.
  arXiv  Detail & Related papers  (2021-02-02T21:01:13Z)
• Sinkhorn Natural Gradient for Generative Models [125.89871274202439]
  We propose a novel Sinkhorn Natural Gradient (SiNG) algorithm which acts as a steepest descent method on the probability space endowed with the Sinkhorn divergence. We show that the Sinkhorn information matrix (SIM), a key component of SiNG, has an explicit expression and can be evaluated accurately in complexity that scales logarithmically. In our experiments, we quantitatively compare SiNG with state-of-the-art SGD-type solvers on generative tasks to demonstrate its efficiency and efficacy of our method.
  arXiv  Detail & Related papers  (2020-11-09T02:51:17Z)
• A Kernel-Based Approach to Non-Stationary Reinforcement Learning in Metric Spaces [53.47210316424326]
  KeRNS is an algorithm for episodic reinforcement learning in non-stationary Markov Decision Processes. We prove a regret bound that scales with the covering dimension of the state-action space and the total variation of the MDP with time.
  arXiv  Detail & Related papers  (2020-07-09T21:37:13Z)
• On the minmax regret for statistical manifolds: the role of curvature [68.8204255655161]
  Two-part codes and the minimum description length have been successful in delivering procedures to single out the best models. We derive a sharper expression than the standard one given by the complexity, where the scalar curvature of the Fisher information metric plays a dominant role.
  arXiv  Detail & Related papers  (2020-07-06T17:28:19Z)
• $\gamma$-ABC: Outlier-Robust Approximate Bayesian Computation Based on a Robust Divergence Estimator [95.71091446753414]
  We propose to use a nearest-neighbor-based $gamma$-divergence estimator as a data discrepancy measure. Our method achieves significantly higher robustness than existing discrepancy measures.
  arXiv  Detail & Related papers  (2020-06-13T06:09:27Z)
• A machine learning approach to Bayesian parameter estimation [0.0]
  We formulate parameter estimation as a classification task and use artificial neural networks to efficiently perform Bayesian estimation. We show that the network's posterior distribution is centered at the true (unknown) value of the parameter within an uncertainty given by the inverse Fisher information.
  arXiv  Detail & Related papers  (2020-06-03T16:33:21Z)

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.