Identification Over Quantum Broadcast Channels
- URL: http://arxiv.org/abs/2201.11056v3
- Date: Tue, 1 Aug 2023 15:02:22 GMT
- Title: Identification Over Quantum Broadcast Channels
- Authors: Johannes Rosenberger, Christian Deppe, Uzi Pereg
- Abstract summary: The decoder only identifies whether a message of his choosing was sent or not.
An achievable identification region is derived for a quantum broadcast channel.
Results are demonstrated for the quantum erasure broadcast channel, where our region is suboptimal, but improves on the best previously known bounds.
- Score: 19.465727478912072
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Identification over quantum broadcast channels is considered. As opposed to
the information transmission task, the decoder only identifies whether a
message of his choosing was sent or not. This relaxation allows for a
double-exponential code size. An achievable identification region is derived
for a quantum broadcast channel, and a full characterization for the class of
classical-quantum broadcast channels. The identification capacity region of the
single-mode pure-loss bosonic broadcast channel is obtained as a consequence.
Furthermore, the results are demonstrated for the quantum erasure broadcast
channel, where our region is suboptimal, but improves on the best previously
known bounds.
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) - Zero-entropy encoders and simultaneous decoders in identification via quantum channels [49.126395046088014]
We show that all four combinations (pure/mixed encoder, simultaneous/general decoder) have a double-exponentially growing code size.
We show that the simultaneous identification capacity of a quantum channel equals the simultaneous identification capacity with pure state encodings.
arXiv Detail & Related papers (2024-02-14T11:59:23Z) - Classical State Masking over a Quantum Channel [78.7611537027573]
Transmission of classical information over a quantum state-dependent channel is considered, when the encoder can measure channel side information (CSI) and is required to mask information on the quantum channel state from the decoder.
Regularized formula is derived for the masking equivocation region, and a full characterization is established for a class of measurement channels.
arXiv Detail & Related papers (2021-09-26T16:29:27Z) - Coherent information of a quantum channel or its complement is
generically positive [7.741539072749043]
The task of determining whether a given quantum channel has positive capacity to transmit quantum information is a fundamental open problem in quantum information theory.
We show that the coherent information of a single copy of a randomly selected channel is positive almost surely if the channel's output space is larger than its environment.
arXiv Detail & Related papers (2021-07-01T12:09:20Z) - Detecting positive quantum capacities of quantum channels [9.054540533394926]
A noisy quantum channel can be used to reliably transmit quantum information at a non-zero rate.
This is because it requires computation of the channel's coherent information for an unbounded number of copies of the channel.
We show that a channel's ability to transmit information is intimately connected to the relative sizes of its input, output, and environment spaces.
arXiv Detail & Related papers (2021-05-13T14:26:45Z) - 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) - 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) - 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.