Related papers: Non-Asymptotic Classical Data Compression with Qua…
The classical-input quantum-output (cq) wiretap channel is a communication model involving a classical sender $X$, a legitimate quantum receiver $B$, and a quantum eavesdropper $E$. The goal of a private communication protocol that uses…
A new measure of information leakage for quantum encoding of classical data is defined. An adversary can access a single copy of the state of a quantum system that encodes some classical data and is interested in correctly guessing a…
In classical information theory, the Doeblin coefficient of a classical channel provides an efficiently computable upper bound on the total-variation contraction coefficient of the channel, leading to what is known as a strong…
Quantum state preparation (QSP) for a general $n$-qubit state requires $O(2^n)$ CNOT gates and circuit depth, making exact amplitude encoding (EAE) impractical for near-term quantum hardware. We introduce an ancilla-free hybrid…
We study lower bounds on the optimal error probability in classical coding over classical-quantum channels at rates below the capacity, commonly termed quantum sphere-packing bounds. Winter and Dalai have derived such bounds for…
Large deviation theory offers a powerful and general statistical framework to study the asymptotic dynamical properties of rare events. The application of the formalism to concrete experimental situations is, however, often restricted by…
We re-examine a non-Gaussian quantum error correction code designed to protect optical coherent-state qubits against errors due to an amplitude damping channel. We improve on a previous result [Phys. Rev. A 81, 062344 (2010)] by providing a…
Consider a source E of pure quantum states with von Neumann entropy S. By the quantum source coding theorem, arbitrarily long strings of signals may be encoded asymptotically into S qubits/signal (the Schumacher limit) in such a way that…
We describe a method for lossless quantum compression if the output of the information source is not known. We compute the best possible compression rate, minimizing the expected base length of the output quantum bit string (the base length…
A central question in classical information theory is that of source compression, which is the task where Alice receives a sample from a known probability distribution and needs to transmit it to the receiver Bob with small error. This…
Quantum information science strives to leverage the quantum-mechanical nature of our universe in order to achieve large improvements in certain information processing tasks. In deep-space optical communications, current receivers for the…
We analyze the optimal trade-off between the error exponent and the excess-rate exponent for variable-rate Slepian-Wolf codes. In particular, we first derive upper (converse) bounds on the optimal error and excess-rate exponents, and then…
We propose a rigorous analysis approach for the subset sum problem in the context of lossless data compression, where the phase transition of the subset sum problem is directly related to the passage between ambiguous and non-ambiguous…
The theory of error-correcting codes is concerned with constructing codes that optimize simultaneously transmission rate and relative minimum distance. These conflicting requirements determine an asymptotic bound, which is a continuous…
We describe a general quantum receiver protocol that maps laser-light-modulated classical communications signals into quantum processors for decoding with quantum logic. The quantum logic enables joint quantum measurements over a codeword…
The population $\mathrm{KL}_{\inf}$ is a fundamental quantity that appears in lower bounds for (asymptotically) optimal regret of pure-exploration stochastic bandit algorithms, and optimal stopping time of sequential tests. Motivated by…
We show that within any quantum stabilizer code there lurks a classical binary linear code with similar error-correcting capabilities, thereby demonstrating new connections between quantum codes and classical codes. Using this result --…
Quantum data locking is a quantum communication primitive that allows the use of a short secret key to encrypt a much longer message. It guarantees information-theoretical security against an adversary with limited quantum memory. Here we…
Let $\boldsymbol W=\{\boldsymbol W_n:n\in\mathbb N\}$ be a sequence of random vectors in $\mathbb R^d$, $d\ge 1$. This paper considers the logarithmic asymptotics of the extremes of $\boldsymbol W$, that is, for any vector $\boldsymbol…
A strong converse bound for the classical identification capacity of a quantum channel is an upper bound on the asymptotic identification rate of classical messages sent through the channel, such that, above this rate, the probability of an…