Related papers: Random Coding Bound for the Reliability Function i…
We present an efficient method to extract the amount of true randomness that can be obtained by a Quantum Random Number Generator (QRNG). By repeating the measurements of a quantum system and by swapping between two mutually unbiased bases,…
We generalize the experimental success criterion for quantum teleportation/memory in continuous-variable quantum systems to be suitable for non-unit-gain condition by considering attenuation/amplification of the coherent-state amplitude.…
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…
Quantum key distribution is the most well-known application of quantum cryptography. Previous proposed proofs of security of quantum key distribution contain various technical subtleties. Here, a conceptually simpler proof of security of…
Protocols for discriminating between a pair of channels or for estimating a channel parameter can often be aided by adaptivity or by entanglement between the probe states. This can make it difficult to bound the best possible performance…
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…
We present an improved version of Berry's ansatz able to incorporate exactly the existence of boundaries and the correct normalization of the eigenfunction into an ensemble of random waves. We then reformulate the Random Wave conjecture…
This paper considers the problem of efficiently transmitting quantum states through a network. It has been known for some time that without additional assumptions it is impossible to achieve this task perfectly in general -- indeed, it is…
The efficiency of parameter estimation of quantum channels is studied in this paper. We introduce the concept of programmable parameters to the theory of estimation. It is found that programmable parameters obey the standard quantum limit…
Feedback holds a pivotal role in practical communication schemes, even though it does not enhance channel capacity. Its main attribute includes adaptability in transmission that allows for a higher rate of convergence of the error…
We consider a molecular channel, in which messages are encoded to the frequency of objects in a pool, and whose output during reading time is a noisy version of the input frequencies, as obtained by sampling with replacement from the pool.…
In this paper, we consider the generalized measurement where one particular quantum signal is unambiguously extracted from a set of non-commutative quantum signals and the other signals are filtered out. Simple expressions for the maximum…
The more than thirty years old issue of the information capacity of quantum communication channels was dramatically clarified during the last period, when a number of direct quantum coding theorems was discovered. To considerable extent…
Recently, the projective robustness of quantum states has been introduced in [arXiv:2109.04481(2021)]. It shows that the projective robustness is a useful resource monotone and can comprehensively characterize capabilities and limitations…
A theory is universal contextual if its prediction cannot be reproduced by an ontological model satisfying both preparation and measurement noncontextuality assumptions. In this report, we first generalize the logical proofs of quantum…
We show that no source encoding is needed in the definition of the capacity of a quantum channel for carrying quantum information. This allows us to use the coherent information maximized over all sources and and block sizes, but not…
The quantum channel capacity gives the ultimate limit for the rate at which quantum data can be reliably transmitted through a noisy quantum channel. Degradable quantum channels are among the few channels whose quantum capacities are known.…
We prove the security of theoretical quantum key distribution against the most general attacks which can be performed on the channel, by an eavesdropper who has unlimited computation abilities, and the full power allowed by the rules of…
A conjecture arising naturally in the investigation of additivity of classical information capacity of quantum channels states that the maximal purity of outputs from a quantum channel, as measured by the p-norm, should be multiplicative…
We study universal decoding over unknown discrete additive channels determined by a finite-state (unifilar) random process. Aiming at low-complexity decoders, we study variants of noise-guessing decoders that use estimators for the…