Local measurement strategies for multipartite entanglement quantification

• URL: http://arxiv.org/abs/2401.08065v1
• Date: Tue, 16 Jan 2024 02:48:54 GMT
• Title: Local measurement strategies for multipartite entanglement quantification
• Authors: Luke Coffman, Akshay Seshadri, Graeme Smith, and Jacob L. Beckey
• Abstract summary: We show how local symmetric informationally complete POVMs enable multipartite entanglement with only a single measurement setting. For all estimators, we provide both the classical post-processing cost and rigorous performance guarantees.
• Score: 3.249879651054463
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Despite multipartite entanglement being a global property of a quantum state, a number of recent works have made it clear that it can be quantified using only local measurements. This is appealing because local measurements are the easiest to implement on current quantum hardware. However, it remains an open question what protocol one should use in order to minimize the resources required to estimate multipartite entanglement from local measurements alone. In this work, we construct and compare several estimators of multipartite entanglement based solely on the data from local measurements. We first construct statistical estimators for a broad family of entanglement measures using local randomized measurement (LRM) data before providing a general criterion for the construction of such estimators in terms of projective 2-designs. Importantly, this allows us to de-randomize the multipartite estimation protocol based on LRMs. In particular, we show how local symmetric informationally complete POVMs enable multipartite entanglement quantification with only a single measurement setting. For all estimators, we provide both the classical post-processing cost and rigorous performance guarantees in the form of analytical upper bounds on the number of measurements needed to estimate the measures to any desired precision.

Related papers

• Localizing multipartite entanglement with local and global measurements [5.434628844260994]
  We study the task of localizing multipartite entanglement in pure quantum states onto a subsystem by measuring the remaining systems. We choose the $n$-tangle, the genuine multipartite entanglement concurrence and the concentratable entanglement (CE) as the underlying seed measure. We show that our entanglement localization framework certifies the near-optimality of recently discussed local-measurement protocols.
  arXiv  Detail & Related papers  (2024-11-06T17:58:35Z)
• Directly Estimating Mixed-State Entanglement with Bell Measurement Assistance [7.314117670864291]
  Entanglement plays a fundamental role in quantum physics and information processing. We develop an unbiased estimator for mixed-state entanglement in the few-shot scenario and directly estimate it using random unitary evolution in a photonic system.
  arXiv  Detail & Related papers  (2024-05-31T08:43:38Z)
• Many-body entropies and entanglement from polynomially-many local measurements [0.26388783516590225]
  We show that efficient estimation strategies exist under the assumption that all the spatial correlation lengths are finite. We argue that our method could be practically useful to detect bipartite mixed-state entanglement for large numbers of qubits available in today's quantum platforms.
  arXiv  Detail & Related papers  (2023-11-14T12:13:15Z)
• Beyond Normal: On the Evaluation of Mutual Information Estimators [52.85079110699378]
  We show how to construct a diverse family of distributions with known ground-truth mutual information. We provide guidelines for practitioners on how to select appropriate estimator adapted to the difficulty of problem considered.
  arXiv  Detail & Related papers  (2023-06-19T17:26:34Z)
• Robust and efficient verification of graph states in blind measurement-based quantum computation [52.70359447203418]
  Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
  arXiv  Detail & Related papers  (2023-05-18T06:24:45Z)
• Resource-efficient high-dimensional entanglement detection via symmetric projections [0.0]
  We introduce two families of criteria for detecting and quantifying the entanglement of a bipartite quantum state of arbitrary local dimension. Both criteria give a qualitative result in terms of the state's entanglement dimension and a quantitative result in terms of its fidelity with the maximally entangled state.
  arXiv  Detail & Related papers  (2023-04-09T16:38:36Z)
• End-to-end resource analysis for quantum interior point methods and portfolio optimization [63.4863637315163]
  We provide a complete quantum circuit-level description of the algorithm from problem input to problem output. We report the number of logical qubits and the quantity/depth of non-Clifford T-gates needed to run the algorithm.
  arXiv  Detail & Related papers  (2022-11-22T18:54:48Z)
• Intrinsic Dimensionality Estimation within Tight Localities: A Theoretical and Experimental Analysis [0.0]
  We propose a local ID estimation strategy stable even for tight' localities consisting of as few as 20 sample points. Our experimental results show that our proposed estimation technique can achieve notably smaller variance, while maintaining comparable levels of bias, at much smaller sample sizes than state-of-the-art estimators.
  arXiv  Detail & Related papers  (2022-09-29T00:00:11Z)
• Tight Cram\'{e}r-Rao type bounds for multiparameter quantum metrology through conic programming [61.98670278625053]
  It is paramount to have practical measurement strategies that can estimate incompatible parameters with best precisions possible. Here, we give a concrete way to find uncorrelated measurement strategies with optimal precisions. We show numerically that there is a strict gap between the previous efficiently computable bounds and the ultimate precision bound.
  arXiv  Detail & Related papers  (2022-09-12T13:06:48Z)
• 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)
• Direct estimation of quantum coherence by collective measurements [54.97898890263183]
  We introduce a collective measurement scheme for estimating the amount of coherence in quantum states. Our scheme outperforms other estimation methods based on tomography or adaptive measurements. We show that our method is accessible with today's technology by implementing it experimentally with photons.
  arXiv  Detail & Related papers  (2020-01-06T03:50:42Z)

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.