One-Shot Triple-Resource Trade-Off in Quantum Channel Coding
- URL: http://arxiv.org/abs/2004.12593v2
- Date: Sat, 11 Feb 2023 12:37:11 GMT
- Title: One-Shot Triple-Resource Trade-Off in Quantum Channel Coding
- Authors: Eyuri Wakakuwa, Yoshifumi Nakata
- Abstract summary: We analyze a task in which classical and quantum messages are simultaneously communicated via a noisy quantum channel.
We derive direct and converse bounds for the one-shot capacity region, represented by the smooth conditional entropies and the error tolerance.
- Score: 9.137554315375919
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: We analyze a task in which classical and quantum messages are simultaneously
communicated via a noisy quantum channel, assisted with a limited amount of
shared entanglement. We derive direct and converse bounds for the one-shot
capacity region, represented by the smooth conditional entropies and the error
tolerance. The proof is based on the randomized partial decoupling theorem,
which is a generalization of the decoupling theorem. The two bounds match in
the asymptotic limit of infinitely many uses of a memoryless channel and
coincide with the previous result obtained by Hsieh and Wilde. Direct and
converse bounds for various communication tasks are obtained as corollaries,
both for the one-shot and asymptotic scenarios.
Related papers
- Communication Complexity of Common Randomness Generation with Isotropic
States [5.312109949216557]
The paper considers two communication models -- one-way classical communication and one-way quantum communication.
We show that in the case of classical communication, quantum isotropic states have no advantage over noisy classical correlation.
In the case of quantum communication, we demonstrate that the common randomness rate can be increased by using superdense coding on quantum isotropic states.
arXiv Detail & Related papers (2023-11-08T14:48:15Z) - Systematic compactification of the (multi) two-channel Kondo model. III.
Extended field-theoretic renormalization group analysis [68.8204255655161]
We calculate the detailed flow for the (multi) two-channel Kondo model and its compactified versions.
We gain insights into the contradistinction between the consistent vs. conventional bosonization-debosonization formalisms.
arXiv Detail & Related papers (2023-08-07T14:07:21Z) - Normal quantum channels and Markovian correlated two-qubit quantum
errors [77.34726150561087]
We study general normally'' distributed random unitary transformations.
On the one hand, a normal distribution induces a unital quantum channel.
On the other hand, the diffusive random walk defines a unital quantum process.
arXiv Detail & Related papers (2023-07-25T15:33:28Z) - Quantum soft-covering lemma with applications to rate-distortion coding, resolvability and identification via quantum channels [7.874708385247353]
We prove a one-shot quantum covering lemma in terms of smooth min-entropies.
We provide new upper bounds on the unrestricted and simultaneous identification capacities of quantum channels.
arXiv Detail & Related papers (2023-06-21T17:53:22Z) - Decoupling by local random unitaries without simultaneous smoothing, and
applications to multi-user quantum information tasks [0.0]
We show that a simple telescoping sum trick, together with the triangle inequality and a tensorisation property of expected-contractive coefficients of random channels, allow us to achieve general simultaneous decoupling for multiple users via local actions.
We obtain bounds on the expected deviation from ideal decoupling either in the one-shot setting in terms of smooth min-entropies, or the finite block length setting in terms of R'enyi entropies.
This leads to one-shot, finite block length, and simultaneous achievability results for several tasks in quantum Shannon theory.
arXiv Detail & Related papers (2023-04-24T14:17:32Z) - Tight One-Shot Analysis for Convex Splitting with Applications in
Quantum Information Theory [23.18400586573435]
We establish a one-shot error exponent and a one-shot strong converse for convex splitting with trace distance as an error criterion.
This leads to new one-shot exponent results in various tasks such as communication over quantum wiretap channels, secret key distillation, one-way quantum message compression, quantum measurement simulation, and quantum channel coding with side information at the transmitter.
arXiv Detail & Related papers (2023-04-24T12:47:37Z) - Simple and Tighter Derivation of Achievability for Classical
Communication over Quantum Channels [7.88657961743755]
In this work, we show that the pretty-good measurement naturally plays a role as the union bound as well.
A judicious application of it considerably simplifies the derivation of one-shot achievability for classical-quantum (c-q) channel coding via an elegant three-line proof.
The proposed method applies to deriving one-shot achievability for classical data compression with quantum side information, entanglement-assisted classical communication over quantum channels, and various quantum network information-processing protocols.
arXiv Detail & Related papers (2022-08-03T15:12:01Z) - 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) - Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
"Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation.
We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
arXiv Detail & Related papers (2021-12-09T19:00:00Z) - 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) - 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)
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.