Related papers: Strong Converse for Identification via Quantum Cha…

Higher-dimensional entanglement is a valuable resource for several quantum information processing tasks, and is often characterized by the Schmidt number and specific classes of entangled states beyond qubit-qubit and qubit-qutrit systems.…

The quantum capacity of a quantum channel captures its capability for noiseless quantum communication. It lies at the heart of quantum information theory. Unfortunately, our poor understanding of nonadditivity of coherent information makes…

High-dimensional entanglement with spatial modes of light promises increased security and information capacity over quantum channels. Unfortunately, entanglement decays due to perturbations, corrupting quantum links which cannot be repaired…

Existing fixed-length feedback communication schemes are either specialized to particular channels (Schalkwijk--Kailath, Horstein), or apply to general channels but either have high coding complexity (block feedback schemes) or are…

We explore the classical communication over quantum channels with one sender and two receivers, or with two senders and one receiver, First, for the quantum broadcast channel (QBC) and the quantum multi-access channel (QMAC), we study the…

In [arXiv:1712.03219] the existence of a strongly (pointwise) converging sequence of quantum channels that can not be represented as a reduction of a sequence of unitary channels strongly converging to a unitary channel is shown. In this…

Compressive sensing is used to perform high-dimensional quantum channel estimation with classical light. As an example, we perform a numerical simulation for the case of a three-dimensional classically non-separable state that is propagated…

Shared entanglement is a resource available to parties communicating over a quantum channel, much akin to public coins in classical communication protocols. Whereas shared randomness does not help in the transmission of information, or…

Given a quantum channel -- that is, a completely positive trace-preserving linear map -- as the only communication resource available between two parties, we consider the problem of characterizing the set of classical noisy channels that…

We construct an explicit quantum coding scheme which achieves a communication rate not less than the coherent information when used to transmit quantum information over a noisy quantum channel. For Pauli and erasure channels we also present…

A quantum steganography protocol with large payload is proposed, based on dense coding and entanglement swapping of GHZ states. Its super quantum channel is formed by building up the hidden channel within the original quantum secure direct…

This work presents a differentiable geometric parameterization of quantum channels in Kraus representation, which can be efficiently probed to find an unknown quantum channel. We explore its feasibility in finding the quasi inverse…

Establishing the strong converse theorem for a communication channel confirms that the capacity of that channel, that is, the maximum achievable rate of reliable information communication, is the ultimate limit of communication over that…

We consider the scenario in which Alice transmits private classical messages to Bob via a classical-quantum channel, part of whose output is intercepted by an eavesdropper, Eve. We prove the existence of a universal coding scheme under…

In this paper we study quantum communication channels with correlated noise effects, i.e., quantum channels with memory. We derive a model for correlated noise channels that includes a channel memory state. We examine the case where the…

We exhibit a possible road towards a strong converse for the quantum capacity of degradable channels. In particular, we show that all degradable channels obey what we call a "pretty strong" converse: When the code rate increases above the…

We study the problem of channel resolvability for fixed i.i.d. input distributions and discrete memoryless channels (DMCs), and derive the strong converse theorem for any DMCs that are not necessarily full rank. We also derive the optimal…

We introduce conclusive identification task for classical channels: a receiver identifies transmitted inputs without error when possible, and responds inconclusively when outputs are ambiguous. For a symmetric not-fully-corrupted channel $N…

This paper considers the covert identification problem in which a sender aims to reliably convey an identification (ID) message to a set of receivers via a binary-input discrete memoryless channel (BDMC), and simultaneously to guarantee…

We study private classical communication over quantum multiple-access channels. For an arbitrary number of transmitters, we derive a regularized expression of the capacity region. In the case of degradable channels, we establish a…