Quantum and private capacities of low-noise channels
- URL: http://arxiv.org/abs/1705.04335v3
- Date: Tue, 5 Dec 2023 15:51:57 GMT
- Title: Quantum and private capacities of low-noise channels
- Authors: Felix Leditzky, Debbie Leung and Graeme Smith
- Abstract summary: We determine both the quantum and the private capacities of low-noise quantum channels to leading orders.
Super-additivity and degenerate codes have negligible benefit for the quantum capacity.
shielding does not improve the private capacity beyond the quantum capacity.
- Score: 10.098114696565863
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We determine both the quantum and the private capacities of low-noise quantum
channels to leading orders in the channel's distance to the perfect channel. It
has been an open problem for more than 20 years to determine the capacities of
some of these low-noise channels such as the depolarizing channel. We also show
that both capacities are equal to the single-letter coherent information of the
channel, again to leading orders. We thus find that, in the low noise regime,
super-additivity and degenerate codes have negligible benefit for the quantum
capacity, and shielding does not improve the private capacity beyond the
quantum capacity, in stark contrast to the situation when noisier channels are
considered.
Related papers
- 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) - QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum
Circuits [82.50620782471485]
QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits.
It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness.
Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
arXiv Detail & Related papers (2024-01-10T22:33:00Z) - 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) - The superadditivity effects of quantum capacity decrease with the
dimension for qudit depolarizing channels [0.0]
We study how the gain in quantum capacity of qudit depolarizing channels relates to the dimension of the systems considered.
We conclude that when high dimensional qudits experiencing depolarizing noise are considered, the coherent information of the channel is not only an achievable rate but essentially the maximum possible rate for any quantum block code.
arXiv Detail & Related papers (2023-01-24T16:54:09Z) - Capacities of the covariant Pauli channel [0.0]
We study the four well-known capacities of a two- parameter family of qubit Pauli channels.
We find exact expressions for the classical capacity and entanglement assisted capacities.
We analytically determine the regions where the quantum capacity of the channel vanishes.
arXiv Detail & Related papers (2022-06-13T12:48:21Z) - Exact solution for the quantum and private capacities of bosonic
dephasing channels [10.787390511207686]
We provide the first exact calculation of the quantum, private, two-way assisted quantum, and secret-key capacities of bosonic dephasing channels.
arXiv Detail & Related papers (2022-05-11T19:12:12Z) - Commitment capacity of classical-quantum channels [70.51146080031752]
We define various notions of commitment capacity for classical-quantum channels.
We prove matching upper and lower bound on it in terms of the conditional entropy.
arXiv Detail & Related papers (2022-01-17T10:41:50Z) - 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) - 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) - Quantum Channel State Masking [78.7611537027573]
Communication over a quantum channel that depends on a quantum state is considered when the encoder has channel side information (CSI) and is required to mask information on the quantum channel state from the decoder.
A full characterization is established for the entanglement-assisted masking equivocation region, and a regularized formula is given for the quantum capacity-leakage function without assistance.
arXiv Detail & Related papers (2020-06-10T16:18:03Z)
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.