Related papers: Universal classical-quantum channel resolvability …
Quantum capacity, as the key figure of merit for a given quantum channel, upper bounds the channel's ability in transmitting quantum information. Identifying different type of channels, evaluating the corresponding quantum capacity and…
Secure delegated quantum computing allows a computationally weak client to outsource an arbitrary quantum computation to an untrusted quantum server in a privacy-preserving manner. One of the promising candidates to achieve classical…
The quantum capacity of a noisy quantum channel determines the maximal rate at which we can code reliably over asymptotically many uses of the channel, and it characterizes the channel's ultimate ability to transmit quantum information…
Exploiting permutation invariance to reduce the exponential scaling of semidefinite programs in quantum information has emerged as a powerful computational technique. In this work, we develop a systematic framework for using this reduction…
In the problem of channel resolvability, where a given output probability distribution via a channel is approximated by transforming the uniform random numbers, characterizing the asymptotically minimum rate of the size of the random…
We present a new achievable rate region for the two-user binary-input classical-quantum broadcast channel. The result is a generalization of the classical Marton-Gelfand-Pinsker region and is provably larger than the best previously known…
In [1], it is shown that the simultaneous identification capacity region for the discrete, memoryless, classical-quantum multiple access channel is equal to the transmission capacity region for codes using a deterministic encoding scheme.…
Here, we study the capacity of a quantum channel, assuming linear optical encoding, as a function of available photons and optical modes. First, we observe that substantial improvement is made possible by not restricting ourselves to a…
We study error correction type protocols in which a quantum channel encodes logical information into an enlarged Hilbert space. Specifically, we consider channels realized by one dimensional random noisy quantum circuits with spatially…
Belief propagation is a powerful tool in statistical physics, machine learning, and modern coding theory. As a decoding method, it is ubiquitous in classical error correction and has also been applied to stabilizer-based quantum error…
The problem of mismatched decoding with an additive metric $q$ for a discrete memoryless channel $W$ is addressed. The "product-space" improvement of the random coding lower bound on the mismatch capacity, $C_q^{(\infty)}(W)$, was…
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…
A recent method to certify the classical capacity of quantum communication channels is applied for general damping channels in finite dimension. The method compares the mutual information obtained by coding on the computational and a…
Alice and Bob receive a bipartite state (possibly entangled) from some finite collection or from some subspace. Alice sends a message to Bob through a noisy quantum channel such that Bob may determine the initial state, with zero chance of…
Channel conversion constitutes a pivotal paradigm in information theory and its applications to quantum physics, providing a unified problem setting that encompasses celebrated results such as Shannon's noisy-channel coding theorem. Quantum…
We study an analog of the well-known Gel'fand Pinsker Channel which uses quantum states for the transmission of the data. We consider the case where both the sender's inputs to the channel and the channel states are to be taken from a…
Quantum channels describe subsystem or open system evolution. Using the classical Koopman operator that evolves functions on phase space, 4 classical Koopman channels are identified that are analogs of the 4 possible quantum channels in a…
We define a new family of codes for symmetric classical-quantum channels and establish their optimality. To this end, we extend the classical notion of generalized perfect and quasi-perfect codes to channels defined over some finite…
We explore several new converse bounds for classical communication over quantum channels in both the one-shot and asymptotic regimes. First, we show that the Matthews-Wehner meta-converse bound for entanglement-assisted classical…
When a logical qubit is protected using a quantum error-correcting code, the net effect of coding, decoherence (a physical channel acting on qubits in the codeword) and recovery can be represented exactly by an effective channel acting…