Related papers: Generalized Perfect Codes for Symmetric Classical-…
The present work continues investigation of the capacities of measurement (quantum-classical) channels in the most general setting, initiated in~\cite{HCT}. The proof of coding theorems is given for the classical capacity and…
A model of quantum noisy channel with input encoding by a classical random vector is described. An equation of optimality is derived to determine a complete set of wave functions describing quantum decodings based on quasi-measurements…
We associate to every quantum channel $T$ acting on a Hilbert space $\mathcal{H}$ a pair of Hamiltonian operators over the symmetric subspace of $\mathcal{H}^{\otimes 2}$. The expectation values of these Hamiltonians over symmetric product…
We consider the problem of deterministically cloning quantum channels with respect to the best attainable rate and the highest quality, so-called optimal cloning. We demonstrate that cloning quantum states is, in-fact, equivalent to cloning…
The aim of this work is to study the zero-error capacity of pure-state classical-quantum channels in the setting of list decoding. We provide an achievability bound for list-size two and a converse bound holding for every fixed list size.…
This paper considers a problem of quantum communication between parties that are connected through a network of quantum channels. The model in this paper assumes that there is no prior entanglement shared among any of the parties, but that…
Quantum reading provides a general framework where to formulate the statistical discrimination of quantum channels. Several paths have been taken for such a problem. However, there is much to be done in the avenue of optimizing channel…
We study the properties of quantum stabilizer codes that embed a finite-dimensional protected code space in an infinite-dimensional Hilbert space. The stabilizer group of such a code is associated with a symplectically integral lattice in…
In this work we improve the quantum communication rates of various quantum channels of interest using permutation-invariant quantum codes. We focus in particular on parametrized families of quantum channels and aim to improve bounds on…
We present a generalization of quantum error correction to infinite-dimensional Hilbert spaces. The generalization yields new classes of quantum error correcting codes that have no finite-dimensional counterparts. The error correction…
We derive the effective channel for a logical qubit protected by an arbitrary quantum error-correcting code, and derive the map between channels induced by concatenation. For certain codes in the presence of single-bit Pauli errors, we…
Designing encoding and decoding circuits to reliably send messages over many uses of a noisy channel is a central problem in communication theory. When studying the optimal transmission rates achievable with asymptotically vanishing error…
We derive universal codes for simultaneous transmission of classical messages and entanglement through quantum channels, possibly under attack of a malignant third party. These codes are robust to different kinds of channel uncertainty. To…
We study the problem of transmission of information over classical and classical-quantum channels in the one-shot regime where the underlying codes are constrained to be group codes. In the achievability part, we introduce a new input…
Tradeoffs between the information rate and fidelity of quantum error-correcting codes are discussed. Quantum channels to be considered are those subject to independent errors and modeled as tensor products of copies of a general completely…
Holevo, Schumacher, and Westmoreland's coding theorem guarantees the existence of codes that are capacity-achieving for the task of sending classical data over a channel with classical inputs and quantum outputs. Although they demonstrated…
We investigate the set of quantum channels acting on a single qubit. We provide an alternative, compact generalization of the Fujiwara-Algoet conditions for complete positivity to non-unital qubit channels, which we then use to characterize…
Channel capacity describes the size of the nearly ideal channels, which can be obtained from many uses of a given channel, using an optimal error correcting code. In this paper we collect and compare minor and major variations in the…
We prove a one-shot "minimax" converse bound for quantum channel coding assisted by positive partial transpose channels between sender and receiver. The bound is similar in spirit to the converse by Polyanskiy, Poor, and Verdu [IEEE Trans.…
Quantum synchronizable error-correcting codes are special quantum error-correcting codes that are designed to correct both the effect of quantum noise on qubits and misalignment in block synchronization. It is known that in principle such a…