Computable and Faithful Lower Bound for Entanglement Cost
- URL: http://arxiv.org/abs/2311.10649v1
- Date: Fri, 17 Nov 2023 17:07:26 GMT
- Title: Computable and Faithful Lower Bound for Entanglement Cost
- Authors: Xin Wang, Mingrui Jing, Chengkai Zhu
- Abstract summary: This paper proposes computable and faithful lower bounds for the entanglement cost of general quantum states and quantum channels.
We also establish the best-known lower bound for the entanglement cost of arbitrary dimensional isotropic states.
- Score: 5.7169366634489895
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum entanglement is a crucial resource in quantum information processing.
However, quantifying the entanglement required to prepare quantum states and
implement quantum processes remains challenging. This paper proposes computable
and faithful lower bounds for the entanglement cost of general quantum states
and quantum channels. We introduce the concept of logarithmic $k$-negativity, a
generalization of logarithmic negativity, to establish a general lower bound
for the entanglement cost of quantum states under quantum operations that
completely preserve the positivity of partial transpose (PPT). This bound is
efficiently computable via semidefinite programming and is non-zero for any
entangled state that is not PPT, making it faithful in the entanglement theory
with non-positive partial transpose. Furthermore, we delve into specific and
general examples to demonstrate the advantages of our proposed bounds compared
with previously known computable ones. Notably, we affirm the irreversibility
of asymptotic entanglement manipulation under PPT operations for full-rank
entangled states and the irreversibility of channel manipulation for amplitude
damping channels. We also establish the best-known lower bound for the
entanglement cost of arbitrary dimensional isotropic states. These findings
push the boundaries of understanding the structure of entanglement and the
fundamental limits of entanglement manipulation.
Related papers
- Inevitable Negativity: Additivity Commands Negative Quantum Channel Entropy [2.7961972519572442]
Quantum channels represent a broad spectrum of operations crucial to quantum information theory.
This paper establishes a rigorous framework for assessing the uncertainty in both classical and quantum channels.
arXiv Detail & Related papers (2024-06-19T20:33:17Z) - Reversible Entanglement Beyond Quantum Operations [9.828466699951377]
We introduce a reversible theory of exact entanglement manipulation by establishing a necessary and sufficient condition for state transfer.
We show that logarithmic negativity emerges as the pivotal entanglement measure for determining entangled states' transformations.
arXiv Detail & Related papers (2023-12-07T17:25:28Z) - Quantum process tomography of continuous-variable gates using coherent
states [49.299443295581064]
We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit.
We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
arXiv Detail & Related papers (2023-03-02T18:08:08Z) - Approximation of the Nearest Classical-Classical State to a Quantum
State [0.0]
A revolutionary step in computation is driven by quantumness or quantum correlations, which are permanent in entanglements but often in separable states.
The exact quantification of quantumness is an NP-hard problem; thus, we consider alternative approaches to approximate it.
We show that the objective value decreases along the flow by proofs and numerical results.
arXiv Detail & Related papers (2023-01-23T08:26:17Z) - The power of noisy quantum states and the advantage of resource dilution [62.997667081978825]
Entanglement distillation allows to convert noisy quantum states into singlets.
We show that entanglement dilution can increase the resilience of shared quantum states to local noise.
arXiv Detail & Related papers (2022-10-25T17:39:29Z) - 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) - A Quantum Optimal Control Problem with State Constrained Preserving
Coherence [68.8204255655161]
We consider a three-level $Lambda$-type atom subjected to Markovian decoherence characterized by non-unital decoherence channels.
We formulate the quantum optimal control problem with state constraints where the decoherence level remains within a pre-defined bound.
arXiv Detail & Related papers (2022-03-24T21:31:34Z) - Computable lower bounds on the entanglement cost of quantum channels [8.37609145576126]
A class of lower bounds for the entanglement cost of any quantum state was recently introduced in [arXiv:2111.02438].
Here we extend their definitions to point-to-point quantum channels, establishing a lower bound for the quantum entanglement cost of any channel.
This leads to a bound that is computable as a semidefinite program and that can outperform previously known lower bounds.
arXiv Detail & Related papers (2022-01-23T13:05:36Z) - Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems.
By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z) - Direct Quantum Communications in the Presence of Realistic Noisy
Entanglement [69.25543534545538]
We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement.
Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
arXiv Detail & Related papers (2020-12-22T13:06:12Z) - Cost of quantum entanglement simplified [13.683637401785505]
We introduce an entanglement measure that has a precise information-theoretic meaning as the exact cost required to prepare an entangled state.
Our results bring key insights into the fundamental entanglement structure of arbitrary quantum states, and they can be used directly to assess and quantify the entanglement produced in quantum-physical experiments.
arXiv Detail & Related papers (2020-07-28T14:36:23Z)
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.