One-Shot Hybrid State Redistribution
- URL: http://arxiv.org/abs/2006.12059v3
- Date: Wed, 25 May 2022 01:43:50 GMT
- Title: One-Shot Hybrid State Redistribution
- Authors: Eyuri Wakakuwa, Yoshifumi Nakata, Min-Hsiu Hsieh
- Abstract summary: We consider state redistribution of a "hybrid" information source that has both classical and quantum components.
The available resources are shared entanglement, and noiseless classical and quantum communication channels.
- Score: 20.28217079480463
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We consider state redistribution of a "hybrid" information source that has
both classical and quantum components. The sender transmits classical and
quantum information at the same time to the receiver, in the presence of
classical and quantum side information both at the sender and at the decoder.
The available resources are shared entanglement, and noiseless classical and
quantum communication channels. We derive one-shot direct and converse bounds
for these three resources, represented in terms of the smooth conditional
entropies of the source state. Various coding theorems for two-party source
coding problems are systematically obtained by reduction from our results,
including the ones that have not been addressed in previous literature.
Related papers
- Three-Receiver Quantum Broadcast Channels: Classical Communication with Quantum Non-unique Decoding [44.37825061268399]
In network communication, there is a hierarchy among receivers based on information they decode due.
This hierarchy may result in varied information quality, such as higher-quality video for certain receivers.
We explore three-receiver quantum broadcast channels with two- and three-degraded message sets.
arXiv Detail & Related papers (2024-06-14T09:07:53Z) - Entanglement Distribution and Quantum Teleportation in Higher Dimension
over the Superposition of Causal Orders of Quantum Channels [13.359442837017202]
We develop and formulate the theoretical framework for transmission of classical information through entanglement distribution of qudits over two quantum channels.
Results show that entanglement distribution of a qudit provides a considerable gain in fidelity even with increase in noise.
arXiv Detail & Related papers (2023-03-19T15:06:24Z) - Lossy Quantum Source Coding with a Global Error Criterion based on a
Posterior Reference Map [7.646713951724011]
We consider the lossy quantum source coding problem where the task is to compress a given quantum source below its von Neumann entropy.
Inspired by the duality connections between the rate-distortion and channel coding problems in the classical setting, we propose a new formulation for the problem.
arXiv Detail & Related papers (2023-02-01T17:44:40Z) - Quantum Semantic Communications for Resource-Efficient Quantum Networking [52.3355619190963]
This letter proposes a novel quantum semantic communications (QSC) framework exploiting advancements in quantum machine learning and quantum semantic representations.
The proposed framework achieves approximately 50-75% reduction in quantum communication resources needed, while achieving a higher quantum semantic fidelity.
arXiv Detail & Related papers (2022-05-05T03:49:19Z) - Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs.
Super-Quantum Encoders [67.12391801199688]
We investigate dense coding by imposing various locality restrictions to our decoder.
In this task, the sender Alice and the receiver Bob share an entangled state.
arXiv Detail & Related papers (2021-09-26T07:29:54Z) - Capacities of Gaussian Quantum Channels with Passive Environment
Assistance [0.0]
Passive environment assisted communication takes place via a quantum channel modeled as a unitary interaction between the information carrying system and an environment.
We consider both quantum communication and classical communication with helper, as well as classical communication with free classical coordination between sender and helper.
arXiv Detail & Related papers (2021-01-03T10:33:43Z) - Quantum Broadcast Channels with Cooperating Decoders: An
Information-Theoretic Perspective on Quantum Repeaters [78.7611537027573]
Communication over a quantum broadcast channel with cooperation between the receivers is considered.
We develop lower and upper bounds on the capacity region in each setting.
arXiv Detail & Related papers (2020-11-18T11:58:48Z) - Explicit construction of optimal witnesses for input-output correlations
attainable by quantum channels [3.441021278275805]
We consider the problem of characterizing the set of classical noisy channels that can be obtained from a quantum channel.
We consider various classes of linear witnesses and compute their optimum values in closed form for several classes of quantum channels.
The witnesses that we consider here are formulated as communication games, in which Alice's aim is to exploit a single use of a given quantum channel to help Bob guess some information she has received from an external referee.
arXiv Detail & Related papers (2020-09-02T07:34:23Z) - Single-Shot Secure Quantum Network Coding for General Multiple Unicast
Network with Free One-Way Public Communication [56.678354403278206]
We propose a canonical method to derive a secure quantum network code over a multiple unicast quantum network.
Our code correctly transmits quantum states when there is no attack.
It also guarantees the secrecy of the transmitted quantum state even with the existence of an attack.
arXiv Detail & Related papers (2020-03-30T09:25:13Z) - Permutation Enhances Classical Communication Assisted by Entangled
States [67.12391801199688]
We show that the capacity satisfies the strong converse property and thus the formula serves as a sharp dividing line between achievable and unachievable rates of communication.
As examples, we derive analytically the classical capacity of various quantum channels of interests.
arXiv Detail & Related papers (2020-01-07T01:49:31Z)
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.