Generalized Concentratable Entanglement via Parallelized Permutation Tests
- URL: http://arxiv.org/abs/2406.18517v1
- Date: Wed, 26 Jun 2024 17:44:01 GMT
- Title: Generalized Concentratable Entanglement via Parallelized Permutation Tests
- Authors: Xiaoyu Liu, Johannes Knörzer, Zherui Jerry Wang, Jordi Tura,
- Abstract summary: We introduce Generalized Concentratable Entanglement measures, highlight a natural correspondence to quantum Tsallis entropies, and conjecture a new entropic inequality.
We show how to efficiently measure the GCE in a quantum computer, using parallelized permutation tests across a prime number of state copies.
- Score: 1.9761078960577445
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Multipartite entanglement is an essential resource for quantum information theory and technologies, but its quantification has been a persistent challenge. Recently, Concentratable Entanglement (CE) has been introduced as a promising candidate for a multipartite entanglement measure, which can be efficiently estimated across two state copies. In this work, we introduce Generalized Concentratable Entanglement (GCE) measures, highlight a natural correspondence to quantum Tsallis entropies, and conjecture a new entropic inequality that may be of independent interest. We show how to efficiently measure the GCE in a quantum computer, using parallelized permutation tests across a prime number of state copies. We exemplify the practicality of such computation for probabilistic entanglement concentration into W states with three state copies. Moreover, we show that an increased number of state copies provides an improved error bound on this family of multipartite entanglement measures in the presence of imperfections. Finally, we prove that GCE is still a well-defined entanglement monotone as its value, on average, does not increase under local operations and classical communication (LOCC).
Related papers
- Multipartite entanglement theory with entanglement-nonincreasing
operations [91.3755431537592]
We extend the resource theory of entanglement for multipartite systems beyond the standard framework of local operations and classical communication.
We demonstrate that in this adjusted framework, the transformation rates between multipartite states are fundamentally dictated by the bipartite entanglement entropies of the respective quantum states.
arXiv Detail & Related papers (2023-05-30T12:53:56Z) - Tripartite entanglement measure under local operations and classical
communication [0.6759148939470331]
We study the concurrence fill, which admits a geometric interpretation to measure genuine tripartite entanglement.
Our results shed light on studying genuine entanglement and also reveal the complex structure of multipartite systems.
arXiv Detail & Related papers (2022-10-13T03:39:20Z) - A Hierarchy of Multipartite Correlations Based on Concentratable
Entanglement [3.7468898363447654]
We show that Concentratable Entanglement induces a hierarchy upon pure states from which different entanglement structures can be certified.
In particular, we find that nearly all genuine multipartite entangled states can be verified through CE.
arXiv Detail & Related papers (2022-09-15T21:07:40Z) - 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) - Informationally complete measures of quantum entanglement [0.0]
We introduce a family of entanglement measures which are given by the complete eigenvalues of the reduced density matrices of the system.
It is demonstrated that such ICEMs can characterize finer and distinguish better the entanglement than existing well-known entanglement measures.
arXiv Detail & Related papers (2022-06-22T19:27:07Z) - Theory of Quantum Generative Learning Models with Maximum Mean
Discrepancy [67.02951777522547]
We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs)
We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution.
Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
arXiv Detail & Related papers (2022-05-10T08:05:59Z) - Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees.
Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation.
We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
arXiv Detail & Related papers (2022-03-30T02:02:16Z) - Experimental violations of Leggett-Garg's inequalities on a quantum
computer [77.34726150561087]
We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems.
Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
arXiv Detail & Related papers (2021-09-06T14:35:15Z) - Using Quantum Metrological Bounds in Quantum Error Correction: A Simple
Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates.
Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
arXiv Detail & Related papers (2020-04-24T17:58:10Z) - Single-copies estimation of entanglement negativity [1.7179583883220435]
Entanglement plays a central role in quantum information processing.
We propose a scheme to estimate the entanglement negativity of any bi- partition of a composite system.
arXiv Detail & Related papers (2020-04-23T17:57:01Z) - Einselection from incompatible decoherence channels [62.997667081978825]
We analyze an open quantum dynamics inspired by CQED experiments with two non-commuting Lindblad operators.
We show that Fock states remain the most robust states to decoherence up to a critical coupling.
arXiv Detail & Related papers (2020-01-29T14:15:19Z)
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.