Related papers: Achievable rate-region for $3-$User Classical-Quan…
We study commitment scheme for classical-quantum channels. To accomplish this we define various notions of commitment capacity for these channels and prove matching upper and lower bound on it in terms of the conditional entropy. Our…
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.…
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…
The capacity region of the interference channel in which one transmitter non-causally knows the message of the other, termed the cognitive interference channel, has remained open since its inception in 2005. A number of subtly differing…
The optimal rate region for interference networks is characterized when encoding is restricted to random code ensembles with superposition coding and time sharing. A simple simultaneous nonunique decoding rule, under which each receiver…
By leveraging quantum-mechanical properties like superposition, entanglement, and interference, quantum computing (QC) offers promising solutions for problems that classical computing has not been able to solve efficiently, such as drug…
We introduce a new quantum decoder based on a variant of the pretty good measurement, but defined via an alternative matrix quotient. We use this decoder to show new lower bounds on the error exponent both in the one-shot and asymptotic…
In this paper, we study the achievable rate region of Gaussian multiuser channels with the messages transmitted being from finite input alphabets and the outputs being {\em quantized at the receiver}. In particular, we focus on the…
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…
Facilitating the ability to achieve logical qubit error rates below physical qubit error rates, error correction is anticipated to play an important role in scaling quantum computers. While many algorithms require millions of physical…
The problem of characterizing the capacity region for Gaussian broadcast channels with receiver message side information appears difficult and remains open for N >= 3 receivers. This paper proposes a joint network and Gelfand-Pinsker coding…
The lower bound on the decoding error probability for the optimal code given a signal-to-noise ratio and a code rate are investigated in this letter for the reconfigurable intelligent surface (RIS) communication system over a Rician fading…
A general framework describing the statistical discrimination of an ensemble of quantum channels is given by the name of quantum reading. Several tools can be applied in quantum reading to reduce the error probability in distinguishing the…
Recently, a class of quantum secret sharing schemes called communication efficient quantum threshold secret sharing schemes (CE-QTS) was introduced. These schemes reduced the communication cost during secret recovery. In this paper, we…
This report surveys quantum error-correcting codes. As Preskill claimed, 21st century would be the golden age of quantum error correction. Quantum channels behave differently from classical channels, so researchers face difficulties in…
In this paper, capacity bounds for the two-user Interference Channel (IC) with cooperative receivers via conferencing links of finite capacities is investigated. The capacity results known for this communication scenario are limited to a…
This article shows that the capacity region of a two users weak Gaussian interference channel can be achieved using single letter Gaussian code-books. The approach relies on traversing the boundary in incremental steps. Starting from a…
Quantum queue-channels arise naturally in the context of buffering in quantum networks, wherein the noise suffered by the quantum states depends on the time spent waiting in the buffer. It has been shown that the upper-bound on the…
Orthogonal coding schemes, known to asymptotically achieve the capacity per unit cost (CPUC) for single-user ergodic memoryless channels with a zero-cost input symbol, are investigated for single-user compound memoryless channels, which…
Quantum error correction codes (QECCs) play a central role in both quantum communications and quantum computation. Practical quantum error correction codes, such as stabilizer codes, are generally structured to suit a specific use, and…