Related papers: Commitment capacity of classical-quantum channels
We give the trade-off curve showing the capacity of a quantum channel as a function of the amount of entanglement used by the sender and receiver for transmitting information. The endpoints of this curve are given by the…
We present a general model for quantum channels with memory, and show that it is sufficiently general to encompass all causal automata: any quantum process in which outputs up to some time t do not depend on inputs at times t' > t can be…
The computational problem of distinguishing two quantum channels is central to quantum computing. It is a generalization of the well-known satisfiability problem from classical to quantum computation. This problem is shown to be…
We introduce an infinite sequence of quantum channels for which the Holevo capacity is additive. The channel series is closely related to the quantum channels arising from universal quantum cloning machines. The additivity proof is…
We study the identification capacity of classical-quantum channels ("cq-channels"), under channel uncertainty and privacy constraints. To be precise, we consider first compound memoryless cq-channels and determine their identification…
Transmission of classical information using quantum objects such as polarized photons is studied. The classical (Shannon) channel capacity and its relation to quantum (von Neumann) channel capacity is investigated for various receiver…
Quantum channels represent a broad spectrum of operations crucial to quantum information theory, encompassing everything from the transmission of quantum information to the manipulation of various resources. In the domain of states, the…
The ``impossibility proof'' on unconditionally secure quantum bit commitment is examined. It is shown that the possibility of juxtaposing quantum and classical randomness has not been properly taken into account. A specific protocol that…
The set of quantum Gaussian channels acting on one bosonic mode can be classified according to the action of the group of Gaussian unitaries. We look for bounds on the classical capacity for channels belonging to such a classification.…
The weak converse coding theorems have been proved for the quantum source and channel. The results give the lower bound for capacity of source and the upper bound for capacity of channel. The monotonicity of mutual quantum information have…
We develop a novel framework for proving converse theorems for channel coding, which is based on the analysis technique of multicast transmission with an additional auxiliary receiver, which serves as a genie to the original receiver. The…
This work investigates the application of quantum machine learning techniques for classical and quantum communication across different qubit channel models. By employing parameterized quantum circuits and a flexible channel noise model, we…
We consider the problem of transmitting classical and quantum information reliably over an entanglement-assisted quantum channel. Our main result is a capacity theorem that gives a three-dimensional achievable rate region. Points in the…
The entanglement-assisted classical capacity of a quantum channel is known to provide the formal quantum generalization of Shannon's classical channel capacity theorem, in the sense that it admits a single-letter characterization in terms…
We show that it is possible for the so-called weak locking capacity of a quantum channel [Guha et al., PRX 4:011016, 2014] to be much larger than its private capacity. Both reflect different ways of capturing the notion of reliable…
This thesis will be focused on the classical capacity of quantum channels, one of the first areas treated by quantum information theorists. The problem is fairly solved since some years. Nevertheless, this work will give me a reason to…
Uniform continuity bounds on entropies are generally expressed in terms of a single distance measure between a pair of probability distributions or quantum states, typically, the total variation distance or trace distance. However, if an…
We consider quantum channels with one sender and two receivers, used in several different ways for the simultaneous transmission of independent messages. We begin by extending the technique of superposition coding to quantum channels with a…
We investigate the quantum capacity of noisy quantum channels which can be represented by coupling a system to an effectively small environment. A capacity formula is derived for all cases where both system and environment are…
It is easy to show coincidence of the entanglement-assisted classical capacity and the Holevo capacity for any c-q channel between finite dimensional quantum systems. In this paper we prove the converse assertion: coincidence of the…