Mutually unbiased measurements-induced lower bounds of concurrence
- URL: http://arxiv.org/abs/2504.14160v1
- Date: Sat, 19 Apr 2025 03:18:53 GMT
- Title: Mutually unbiased measurements-induced lower bounds of concurrence
- Authors: Yu Lu, Meng Su, Zhong-Xi Shen, Hong-Xing Wu, Shao-Ming Fei, Zhi-Xi Wang,
- Abstract summary: We propose a family of lower bounds for concurrence in quantum systems using mutually unbiased measurements.<n>We demonstrate that these bounds outperform conventional approaches, particularly in capturing finer entanglement features.
- Score: 4.4265351794669225
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We propose a family of lower bounds for concurrence in quantum systems using mutually unbiased measurements, which prove more effective in entanglement estimation compared to existing methods. Through analytical and numerical examples, we demonstrate that these bounds outperform conventional approaches, particularly in capturing finer entanglement features. Additionally, we introduce separability criterions based on MUMs for arbitrary $d$-dimensional bipartite systems, the research results show that our criterion has more advantages than the existing criteria.
Related papers
- Top-K Pairwise Ranking: Bridging the Gap Among Ranking-Based Measures for Multi-Label Classification [120.37051160567277]
This paper proposes a novel measure named Top-K Pairwise Ranking (TKPR)
A series of analyses show that TKPR is compatible with existing ranking-based measures.
On the other hand, we establish a sharp generalization bound for the proposed framework based on a novel technique named data-dependent contraction.
arXiv Detail & Related papers (2024-07-09T09:36:37Z) - High-dimensional entanglement certification: bounding relative entropy
of entanglement in $2d+1$ experiment-friendly measurements [77.34726150561087]
Entanglement -- the coherent correlations between parties in a quantum system -- is well-understood and quantifiable.
Despite the utility of such systems, methods for quantifying high-dimensional entanglement are more limited and experimentally challenging.
We present a novel certification method whose measurement requirements scale linearly with dimension subsystem.
arXiv Detail & Related papers (2022-10-19T16:52:21Z) - Targeted Separation and Convergence with Kernel Discrepancies [61.973643031360254]
kernel-based discrepancy measures are required to (i) separate a target P from other probability measures or (ii) control weak convergence to P.<n>In this article we derive new sufficient and necessary conditions to ensure (i) and (ii)<n>For MMDs on separable metric spaces, we characterize those kernels that separate Bochner embeddable measures and introduce simple conditions for separating all measures with unbounded kernels.
arXiv Detail & Related papers (2022-09-26T16:41:16Z) - Bounding entanglement dimensionality from the covariance matrix [1.8749305679160366]
High-dimensional entanglement has been identified as an important resource in quantum information processing.
Most widely used methods for experiments are based on fidelity measurements with respect to highly entangled states.
Here, instead, we consider covariances of collective observables, as in the well-known Covariance Matrix Criterion.
arXiv Detail & Related papers (2022-08-09T17:11:44Z) - Entanglement quantification in atomic ensembles [0.0]
Entanglement measures quantify nonclassical correlations present in a quantum system.
We consider broad families of entanglement criteria based on variances of arbitrary operators.
We quantify bipartite and multipartite entanglement in spin-squeezed Bose-Einstein condensates of $sim 500$ atoms.
arXiv Detail & Related papers (2021-03-29T16:17:12Z) - Relative Deviation Margin Bounds [55.22251993239944]
We give two types of learning bounds, both distribution-dependent and valid for general families, in terms of the Rademacher complexity.
We derive distribution-dependent generalization bounds for unbounded loss functions under the assumption of a finite moment.
arXiv Detail & Related papers (2020-06-26T12:37:17Z) - Anomalies of weight-based coherence measure and mixed maximally coherent
states [6.292285191409447]
We show that the weight-based coherence measure displays some unusual properties, in sharp contrast to other popular coherence quantifiers.
We identify the existence of mixed maximally coherent states (MMCS) with respect to this coherence measure.
We present several important families of MMCS by gaining insights from the numerical simulations.
arXiv Detail & Related papers (2020-05-11T07:01:02Z) - Lower bounds in multiple testing: A framework based on derandomized
proxies [107.69746750639584]
This paper introduces an analysis strategy based on derandomization, illustrated by applications to various concrete models.
We provide numerical simulations of some of these lower bounds, and show a close relation to the actual performance of the Benjamini-Hochberg (BH) algorithm.
arXiv Detail & Related papers (2020-05-07T19:59:51Z) - Learning Ising models from one or multiple samples [26.00403702328348]
We provide guarantees for one-sample estimation, quantifying the estimation error in terms of the metric entropy of a family of interaction matrices.
Our technical approach benefits from sparsifying a model's interaction network, conditioning on subsets of variables that make the dependencies in the resulting conditional distribution sufficiently weak.
arXiv Detail & Related papers (2020-04-20T15:17:05Z) - 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.