One-Shot Static Entanglement Cost of Bipartite Quantum Channels
- URL: http://arxiv.org/abs/2103.10014v2
- Date: Wed, 16 Jun 2021 03:26:40 GMT
- Title: One-Shot Static Entanglement Cost of Bipartite Quantum Channels
- Authors: Ho-Joon Kim, Soojoon Lee
- Abstract summary: We first investigate the one-shot static entanglement cost to simulate a bipartite quantum channel under the set of non-entangling channels.
We conceive a set of quantum channels that extends the set of non-entangling channels.
We find out that the one-shot static entanglement cost under the extended set of channels is given by the channel's standard log-robustness.
- Score: 3.8073142980733
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We first investigate the one-shot static entanglement cost to simulate a
bipartite quantum channel under the set of non-entangling channels. The lower
bound on the static entanglement cost is given by the generalized robustness of
the target channel as well as the robust-generating power of the channel, which
implies that the cost necessary to generate a bipartite quantum channel might
not be retrievable in general. Next, we conceive a set of quantum channels that
extends the set of non-entangling channels. We find out that the one-shot
static entanglement cost under the extended set of channels is given by the
channel's standard log-robustness. This gives the one-shot dynamic entanglement
cost under a set of free superchannels that do not generate dynamic
entanglement resource; the extended set is shown to be equivalent to the set of
free superchannels.
Related papers
- Resolvability of classical-quantum channels [54.825573549226924]
We study the resolvability of classical-quantum channels in two settings, for the channel output generated from the worst input, and form the fixed independent and identically distributed (i.i.d.) input.
For the fixed-input setting, while the direct part follows from the known quantum soft covering result, we exploit the recent alternative quantum Sanov theorem to solve the strong converse.
arXiv Detail & Related papers (2024-10-22T05:18:43Z) - Unextendible entanglement of quantum channels [4.079147243688764]
We study the ability of quantum channels to perform quantum communication tasks.
A quantum channel can distill a highly entangled state between two parties.
We generalize the formalism of $k$-extendibility to bipartite superchannels.
arXiv Detail & Related papers (2024-07-22T18:00:17Z) - Entangled Pair Resource Allocation under Uncertain Fidelity Requirements [59.83361663430336]
In quantum networks, effective entanglement routing facilitates communication between quantum source and quantum destination nodes.
We propose a resource allocation model for entangled pairs and an entanglement routing model with a fidelity guarantee.
Our proposed model can reduce the total cost by at least 20% compared to the baseline model.
arXiv Detail & Related papers (2023-04-10T07:16:51Z) - On the monotonicity of a quantum optimal transport cost [91.3755431537592]
We show that the generalization of the $2$-Wasserstein distance proposed by Chakrabarti et al. is not monotone under partial traces.
We propose a stabilized version of the original definition, which we show to be monotone under the application of general quantum channels.
arXiv Detail & Related papers (2022-11-21T18:33:50Z) - Bi-PPT channels are entanglement breaking [77.34726150561087]
We show that bi-PPT channels are always entanglement breaking.
We also show that degradable quantum channels staying completely positive under composition with a transposition are entanglement breaking.
arXiv Detail & Related papers (2022-04-04T17:53:38Z) - Designing Stochastic Channels [0.0]
Pauli channels and depolarizing channels are widely studied because they can be efficiently simulated in many relevant quantum circuits.
Despite their wide use, the properties of general channels have received little attention.
arXiv Detail & Related papers (2022-01-18T18:01:15Z) - Energy-constrained LOCC-assisted quantum capacity of bosonic dephasing
channel [0.0]
We study the LOCC-assisted quantum capacity of bosonic dephasing channel with energy constraint on input states.
We derive explicit upper and lower bounds for the energy-constrained LOCC-assisted quantum capacity of the bosonic dephasing channel.
arXiv Detail & Related papers (2021-11-07T20:21:33Z) - Quantifying Quantumness of Channels Without Entanglement [0.0]
We show that quantum channels breaking entanglement, incompatibility, or nonlocality are related to tests of macrorealism.
A hierarchy of quantum non-breaking channels is derived, akin to the existing hierarchy relations for temporal and spatial quantum correlations.
arXiv Detail & Related papers (2021-06-30T02:48:04Z) - Creating and destroying coherence with quantum channels [62.997667081978825]
We study optimal ways to create a large amount of quantum coherence via quantum channels.
correlations in multipartite systems do not enhance the ability of a quantum channel to create coherence.
We show that a channel can destroy more coherence when acting on a subsystem of a bipartite state.
arXiv Detail & Related papers (2021-05-25T16:44:13Z) - Coherent control and distinguishability of quantum channels via
PBS-diagrams [59.94347858883343]
We introduce a graphical language for coherent control of general quantum channels inspired by practical quantum optical setups involving polarising beam splitters (PBS)
We characterise the observational equivalence of purified channels in various coherent-control contexts, paving the way towards a faithful representation of quantum channels under coherent control.
arXiv Detail & Related papers (2021-03-02T22:56:25Z) - One-shot manipulation of entanglement for quantum channels [10.609815608017065]
We show that the dynamic resource theory of quantum entanglement can be formulated using the superchannel theory.
We identify the separable channels and the class of free superchannels that preserve channel separability as free resources, and choose the swap channels as dynamic entanglement golden units.
arXiv Detail & Related papers (2020-12-04T14:42:16Z)
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.