Certifying entanglement dimensionality by reduction moments

• URL: http://arxiv.org/abs/2501.15360v2
• Date: Tue, 28 Jan 2025 04:05:29 GMT
• Title: Certifying entanglement dimensionality by reduction moments
• Authors: Changhao Yi, Xiaodi Li, Huangjun Zhu,
• Abstract summary: We combine the k-reduction map, the moment method, and the classical shadow method into a practical protocol for certifying the entanglement dimensionality. 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. 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.
• Score: 6.408674550016314
• License:
• Abstract: In this paper, we combine the k-reduction map, the moment method, and the classical shadow method into a practical protocol for certifying the entanglement dimensionality. 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. The core of our protocol utilizes the moment method to determine whether the k-reduced operator, i.e., the operator obtained after applying the k-reduction map on a quantum state, contains negative eigenvalues or not. Notably, we propose a systematic method for constructing reduction moment criteria, which apply to a much wider range of states than fidelity-based methods. The performance of our approach gets better and better with the moment order employed, which is corroborated by extensive numerical simulation. To apply our approach, it suffices to implement a unitary 3-design instead of a 4-design, which is more feasible in practice than the correlation matrix method. In the course of study, 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.

Related papers

• Symmetric Rank-One Quasi-Newton Methods for Deep Learning Using Cubic Regularization [0.5120567378386615]
  First-order descent and other first-order variants, such as Adam and AdaGrad, are commonly used in the field of deep learning. However, these methods do not exploit curvature information. Quasi-Newton methods re-use previously computed low Hessian approximations.
  arXiv  Detail & Related papers  (2025-02-17T20:20:11Z)
• Entrywise error bounds for low-rank approximations of kernel matrices [55.524284152242096]
  We derive entrywise error bounds for low-rank approximations of kernel matrices obtained using the truncated eigen-decomposition. A key technical innovation is a delocalisation result for the eigenvectors of the kernel matrix corresponding to small eigenvalues. We validate our theory with an empirical study of a collection of synthetic and real-world datasets.
  arXiv  Detail & Related papers  (2024-05-23T12:26:25Z)
• A Bound on the Maximal Marginal Degrees of Freedom [0.0]
  This paper addresses low rank approximations and surrogates for kernel ridge regression. We demonstrate that the computational cost of the most popular low rank approach, which is the Nystr"om method, is almost linear in the sample size. The result builds on a thorough theoretical analysis of the approximation of elementary kernel functions by elements in the range of the associated integral operator.
  arXiv  Detail & Related papers  (2024-02-20T10:25:44Z)
• Analysis of the Single Reference Coupled Cluster Method for Electronic Structure Calculations: The Full Coupled Cluster Equations [2.3271703838711972]
  We introduce a new well-posedness analysis for the single reference coupled cluster method based on the invertibility of the CC derivative. Preliminary numerical experiments indicate that the constants that appear in our estimates are a significant improvement over those obtained from the local monotonicity approach.
  arXiv  Detail & Related papers  (2022-12-24T17:29:43Z)
• Self-Supervised Training with Autoencoders for Visual Anomaly Detection [61.62861063776813]
  We focus on a specific use case in anomaly detection where the distribution of normal samples is supported by a lower-dimensional manifold. We adapt a self-supervised learning regime that exploits discriminative information during training but focuses on the submanifold of normal examples. We achieve a new state-of-the-art result on the MVTec AD dataset -- a challenging benchmark for visual anomaly detection in the manufacturing domain.
  arXiv  Detail & Related papers  (2022-06-23T14:16:30Z)
• Search for an efficient entanglement witness operator for bound entangled states in bipartite quantum systems [0.0]
  Entanglement detection problem is one of the important problem in quantum information theory. There are some powerful entanglement detection criterion such as partial transposition criterion, realignment criterion. In this work, we take an analytical approach to construct a witness operator.
  arXiv  Detail & Related papers  (2022-04-13T06:41:14Z)
• Optimal policy evaluation using kernel-based temporal difference methods [78.83926562536791]
  We use kernel Hilbert spaces for estimating the value function of an infinite-horizon discounted Markov reward process. We derive a non-asymptotic upper bound on the error with explicit dependence on the eigenvalues of the associated kernel operator. We prove minimax lower bounds over sub-classes of MRPs.
  arXiv  Detail & Related papers  (2021-09-24T14:48:20Z)
• Re-Assessing the "Classify and Count" Quantification Method [88.60021378715636]
  "Classify and Count" (CC) is often a biased estimator. Previous works have failed to use properly optimised versions of CC. We argue that, while still inferior to some cutting-edge methods, they deliver near-state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2020-11-04T21:47:39Z)
• Understanding Implicit Regularization in Over-Parameterized Single Index Model [55.41685740015095]
  We design regularization-free algorithms for the high-dimensional single index model. We provide theoretical guarantees for the induced implicit regularization phenomenon.
  arXiv  Detail & Related papers  (2020-07-16T13:27:47Z)
• Accurate Optimization of Weighted Nuclear Norm for Non-Rigid Structure from Motion [15.641335104467982]
  We show that more accurate results can be achieved with 2nd order methods. Our main result shows how to construct bilinear formulations, for a general class of regularizers. We show experimentally, on a number of structure from motion problems, that our approach outperforms state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-03-23T13:52:16Z)
• Interpolation Technique to Speed Up Gradients Propagation in Neural ODEs [71.26657499537366]
  We propose a simple literature-based method for the efficient approximation of gradients in neural ODE models. We compare it with the reverse dynamic method to train neural ODEs on classification, density estimation, and inference approximation tasks.
  arXiv  Detail & Related papers  (2020-03-11T13:15:57Z)

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.