Related papers: The Classical-Quantum Channel with Random State Pa…
We consider state redistribution of a "hybrid" information source that has both classical and quantum components. The sender transmits classical and quantum information at the same time to the receiver, in the presence of classical and…
When classical information is sent through a quantum channel of nonorthogonal states, there is a possibility that transmittable classical information exceeds a channel capacity in a single use of the initial channel by extending it into…
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…
When classical or quantum information is broadcast to separate receivers, there exist codes that encrypt the encoded data such that the receivers cannot recover it when performing local operations and classical communication, but they can…
We exhibit discrete memoryless quantum channels whose quantum capacity assisted by two-way classical communication, $Q_2$, exceeds their unassisted one-shot Holevo capacity $C_H$. These channels may be thought of as having a data input and…
Quantum mechanics allows operations to be in indefinite causal order. Recently there have been active discussions on enhanced communication strategies through exotic causal structures. In light of this, through the process matrix formalism,…
We investigate the quantum channel consisting of two localized quantum systems that communicate through a scalar quantum field. We choose a scalar field rather than a tensor or vector field, such as the electromagnetic field, in order to…
Given an unknown quantum state distributed over two systems, we determine how much quantum communication is needed to transfer the full state to one system. This communication measures the "partial information" one system needs conditioned…
We calculate the entanglement-assisted classical capacity of symmetric and asymmetric Pauli channels where two consecutive uses of the channels are correlated. It is evident from our study that in the presence of memory, a higher amount of…
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…
The readout of a classical memory can be modelled as a problem of quantum channel discrimination, where a decoder retrieves information by distinguishing the different quantum channels encoded in each cell of the memory [S. Pirandola, Phys.…
We give a capacity formula for the classical information transmission over a noisy quantum channel, with separable encoding by the sender and limited resources provided by the receiver's pre-shared ancilla. Instead of a pure state, we…
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…
This work is motivated by a quite general question: Under which circumstances are the capacities of information transmission systems continuous? The research is explicitly carried out on arbitrarily varying quantum channels (AVQCs). We give…
We study here the conditions to perform the distribution of a pure state on a quantum network using quantum operations which can succeed with a non-zero probability, the Stochastic Local Operation and Classical Communication (SLOCC)…
We characterize the capacity for the discrete-time arbitrarily varying channel with discrete inputs, outputs, and states when (a) the encoder and decoder do not share common randomness, (b) the input and state are subject to cost…
Classical communication through quantum channels may be enhanced by sharing entanglement. Superdense coding allows the encoding, and transmission, of up to two classical bits of information in a single qubit. In this paper, the maximum…
We give a short proof that the coherent information is an achievable rate for the transmission of quantum information through a noisy quantum channel. Our method is to produce random codes by performing a unitarily covariant projective…
A fully general strong converse for channel coding states that when the rate of sending classical information exceeds the capacity of a quantum channel, the probability of correctly decoding goes to zero exponentially in the number of…
For a continuous-input-continuous-output arbitrarily distributed quantum channel carrying classical information, the channel capacity can be computed in terms of the distribution of the channel envelope, received signal strength over a…