Bounding quantum capacities via partial orders and complementarity
- URL: http://arxiv.org/abs/2202.11688v1
- Date: Wed, 23 Feb 2022 18:53:51 GMT
- Title: Bounding quantum capacities via partial orders and complementarity
- Authors: Christoph Hirche and Felix Leditzky
- Abstract summary: We give operationally motivated bounds on several quantum capacities, including the quantum capacity and private capacity of a quantum channel and the one-way distillable entanglement and private key of a quantum state.
Our bounds help to further understand the interplay between different capacities, as they give operational limitations on superadditivity and the difference between capacities in terms of the information-theoretic properties of the complementary channel or state.
- Score: 9.010643838773476
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum capacities are fundamental quantities that are notoriously hard to
compute and can exhibit surprising properties such as superadditivity. Thus, a
vast amount of literature is devoted to finding tight and computable bounds on
these capacities. We add a new viewpoint by giving operationally motivated
bounds on several capacities, including the quantum capacity and private
capacity of a quantum channel and the one-way distillable entanglement and
private key of a quantum state. These bounds are generally phrased in terms of
capacity quantities involving the complementary channel or state. As a tool to
obtain these bounds, we discuss partial orders on quantum channels and states,
such as the less noisy and the more capable order. Our bounds help to further
understand the interplay between different capacities, as they give operational
limitations on superadditivity and the difference between capacities in terms
of the information-theoretic properties of the complementary channel or state.
They can also be used as a new approach towards numerically bounding
capacities, as discussed with some examples.
Related papers
- The multimode conditional quantum Entropy Power Inequality and the squashed entanglement of the extreme multimode bosonic Gaussian channels [53.253900735220796]
Inequality determines the minimum conditional von Neumann entropy of the output of the most general linear mixing of bosonic quantum modes.
Bosonic quantum systems constitute the mathematical model for the electromagnetic radiation in the quantum regime.
arXiv Detail & Related papers (2024-10-18T13:59:50Z) - 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) - Noise is resource-contextual in quantum communication [1.8749305679160366]
Estimating the information transmission capability of a quantum channel remains one of the fundamental problems in quantum information processing.
One of the most significant manifestations of this is the superadditivity of the channel capacity.
Our constructions demonstrate that noise is context dependent in quantum communication.
arXiv Detail & Related papers (2023-05-01T06:24:03Z) - Estimate distillable entanglement and quantum capacity by squeezing useless entanglement [5.086696108576776]
Quantum Internet relies on quantum entanglement as a fundamental resource for secure and efficient quantum communication.
It remains challenging to accurately estimate the distillable entanglement and its closely related essential quantity, the quantum capacity.
We propose efficiently computable upper bounds for both quantities based on the idea that the useless entanglement within a state or a quantum channel does not contribute to the distillable entanglement or the quantum capacity.
arXiv Detail & Related papers (2023-03-13T16:02:18Z) - 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) - Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources.
The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
arXiv Detail & Related papers (2022-09-16T02:37:32Z) - On quantum channel capacities: an additive refinement [0.0]
Capacities of quantum channels are fundamental quantities in the theory of quantum information.
Asymptotic regularization is generically necessary making the study of capacities notoriously hard.
We prove additive quantities for quantum channel capacities that can be employed for quantum Shannon theorems.
arXiv Detail & Related papers (2022-05-15T07:21:38Z) - Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems.
Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
arXiv Detail & Related papers (2021-08-30T23:50:05Z) - Extendibility limits the performance of quantum processors [5.949779668853555]
We introduce the resource theory of unextendibility, which is associated with the inability of extending quantum entanglement in a given quantum state to multiple parties.
We derive non-asymptotic, upper bounds on the rate at which quantum communication or entanglement preservation is possible by utilizing an arbitrary quantum channel a finite number of times.
We show that the bounds obtained are significantly tighter than previously known bounds for quantum communication over both the depolarizing and erasure channels.
arXiv Detail & Related papers (2021-08-06T14:17:08Z) - 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) - Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor.
We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
arXiv Detail & Related papers (2021-01-21T22:18:49Z)
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.