Detecting high-dimensional entanglement by local randomized projections

• URL: http://arxiv.org/abs/2501.01088v1
• Date: Thu, 02 Jan 2025 06:20:05 GMT
• Title: Detecting high-dimensional entanglement by local randomized projections
• Authors: Jin-Min Liang, Shuheng Liu, Shao-Ming Fei, Qiongyi He,
• Abstract summary: 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.
• Score: 1.8749305679160366
• License:
• Abstract: The characterization of high-dimensional entanglement plays a crucial role in the field of quantum information science. Conventional methods perform either fixed measurement bases or randomized measurements with high-order moments. Here, we introduce a criterion for estimating the Schmidt number of bipartite high-dimensional states based on local randomized projections with first-order moments. To extract more information from limited experimental data, we propose an estimation algorithm of the Schmidt number. We exhibit the performance of the proposed approach by considering the maximally entangled state under depolarizing and random noise models. Our approach not only obtains a more accurate estimation of the Schmidt number but also reduces the number of projections compared to known methods.

Related papers

• Semidefinite relaxations for high-dimensional entanglement in the steering scenario [0.0]
  We introduce semidefinite programming hierarchies for benchmarking entanglement properties in the high-dimensional steering scenario. We demonstrate the usefulness of these methods, which can be directly used to analyse experiments on high-dimensional systems.
  arXiv  Detail & Related papers  (2024-10-03T15:00:59Z)
• Random Projection using Random Quantum Circuits [0.0]
  We explore a near-term use of local random quantum circuits in dimensional reduction of large low-rank data sets. We prove that the matrix representations of local random quantum circuits with sufficiently shorter depths serve as good candidates for random projection. We also benchmark the performance of quantum random projection against the commonly used classical random projection.
  arXiv  Detail & Related papers  (2023-08-26T17:32:48Z)
• Distributed Sketching for Randomized Optimization: Exact Characterization, Concentration and Lower Bounds [54.51566432934556]
  We consider distributed optimization methods for problems where forming the Hessian is computationally challenging. We leverage randomized sketches for reducing the problem dimensions as well as preserving privacy and improving straggler resilience in asynchronous distributed systems.
  arXiv  Detail & Related papers  (2022-03-18T05:49:13Z)
• Dual-Frequency Quantum Phase Estimation Mitigates the Spectral Leakage of Quantum Algorithms [76.15799379604898]
  Quantum phase estimation suffers from spectral leakage when the reciprocal of the record length is not an integer multiple of the unknown phase. We propose a dual-frequency estimator, which approaches the Cramer-Rao bound, when multiple samples are available.
  arXiv  Detail & Related papers  (2022-01-23T17:20:34Z)
• Fast Approximation of the Sliced-Wasserstein Distance Using Concentration of Random Projections [19.987683989865708]
  The Sliced-Wasserstein distance (SW) is being increasingly used in machine learning applications. We propose a new perspective to approximate SW by making use of the concentration of measure phenomenon. Our method does not require sampling a number of random projections, and is therefore both accurate and easy to use compared to the usual Monte Carlo approximation.
  arXiv  Detail & Related papers  (2021-06-29T13:56:19Z)
• 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)
• Mean-squared-error-based adaptive estimation of pure quantum states and unitary transformations [0.0]
  We propose a method to estimate with high accuracy pure quantum states of a single qudit. Our method is based on the minimization of the squared error between the complex probability amplitudes of the unknown state and its estimate. We show that our estimation procedure can be easily extended to estimate unknown unitary transformations acting on a single qudit.
  arXiv  Detail & Related papers  (2020-08-23T00:32:10Z)
• Mixed-state entanglement from local randomized measurements [2.536333994672575]
  We propose a method for detecting bipartite entanglement in a many-body mixed state based on estimating moments of the partially transposed density matrix. Our method can be applied to any quantum system with single-qubit control.
  arXiv  Detail & Related papers  (2020-07-13T10:58:03Z)
• Stochastic Saddle-Point Optimization for Wasserstein Barycenters [69.68068088508505]
  We consider the populationimation barycenter problem for random probability measures supported on a finite set of points and generated by an online stream of data. We employ the structure of the problem and obtain a convex-concave saddle-point reformulation of this problem. In the setting when the distribution of random probability measures is discrete, we propose an optimization algorithm and estimate its complexity.
  arXiv  Detail & Related papers  (2020-06-11T19:40:38Z)
• Gaussian Process States: A data-driven representation of quantum many-body physics [59.7232780552418]
  We present a novel, non-parametric form for compactly representing entangled many-body quantum states. The state is found to be highly compact, systematically improvable and efficient to sample. It is also proven to be a universal approximator' for quantum states, able to capture any entangled many-body state with increasing data set size.
  arXiv  Detail & Related papers  (2020-02-27T15:54:44Z)
• Optimal Randomized First-Order Methods for Least-Squares Problems [56.05635751529922]
  This class of algorithms encompasses several randomized methods among the fastest solvers for least-squares problems. We focus on two classical embeddings, namely, Gaussian projections and subsampled Hadamard transforms. Our resulting algorithm yields the best complexity known for solving least-squares problems with no condition number dependence.
  arXiv  Detail & Related papers  (2020-02-21T17:45:32Z)

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.