Related papers: Universal classical-quantum channel resolvability …
One of the major achievements of the recently emerged quantum information theory is the introduction and thorough investigation of the notion of quantum channel which is a basic building block of any data-transmitting or data-processing…
Coded source compression, also known as source compression with helpers, has been a major variant of distributed source compression, but has hitherto received little attention in the quantum regime. This work treats and solves the…
We show that covert secret key expansion is possible using a public authenticated classical channel and a quantum channel largely under control of an adversary, which we precisely define. We also prove a converse result showing that, under…
Optimal encoding of classical data for statistical inference using quantum computing is investigated. A universal encoder is sought that is optimal for a wide array of statistical inference tasks. Accuracy of any statistical inference is…
In this article, we investigate the additivity phenomenon in the dynamic capacity of a quantum channel for trading classical communication, quantum communication and entanglement. Understanding such additivity property is important if we…
In a recent breakthrough, Mahadev constructed a classical verification of quantum computation (CVQC) protocol for a classical client to delegate decision problems in BQP to an untrusted quantum prover under computational assumptions. In…
A pair of quantum channels are said to be incompatible if they cannot be realized as marginals of a single channel. This paper addresses the general structure of the incompatibility of completely positive channels with a fixed quantum input…
Quantum Key Distribution (QKD) enables two parties to establish a common secret key that is information-theoretically secure by transmitting random bits that are encoded as qubits and sent over a quantum channel, followed by classical…
It is easy to show coincidence of the entanglement-assisted classical capacity and the Holevo capacity for any c-q channel between finite dimensional quantum systems. In this paper we prove the converse assertion: coincidence of the…
A quantum channel models the interaction between the system we are interested in and its environment. Such a model can capture the main features of the interaction but because of the complexity of the environment we can not assume that it…
In this paper we consider the classical capacity problem for Gaussian measurement channels without imposing any kind of threshold condition. We prove Gaussianity of the average state of the optimal ensemble in general and discuss the…
We derive a lower bound on the secrecy capacity of the compound wiretap channel with channel state information at the transmitter which matches the general upper bound on the secrecy capacity of general compound wiretap channels given by…
We construct a new entanglement-assisted quantum polar coding scheme which achieves the symmetric coherent information rate by synthesizing "amplitude" and "phase" channels from a given, arbitrary quantum channel. We first demonstrate the…
How could quantum cryptography help us achieve what are not achievable in classical cryptography? In this work we study the classical cryptographic problem that two parties would like to perform secure computations with long outputs. As a…
Superadditivity effects in the classical capacity of discrete multi-access channels (MACs) and continuous variable (CV) Gaussian MACs are analysed. New examples of the manifestation of superadditivity in the discrete case are provided…
We consider the problem of semantic security via classical-quantum and quantum wiretap channels and use explicit constructions to transform a non-secure code into a semantically secure code, achieving capacity by means of biregular…
We present a quantumly-enhanced protocol to achieve unconditionally secure delegated classical computation where the client and the server have both limited classical and quantum computing capacity. We prove the same task cannot be achieved…
In the present paper we introduce and study Bosonic Gaussian classical-quantum (c-q) channels; the embedding of the classical input into quantum is always possible and therefore the classical entanglement-assisted capacity C_{ea} under…
Supermaps between quantum channels (completely positive trace-preserving (CPTP) maps of matrix algebras) were introduced in [Chiribella et al., EPL 83(3) (2008)]. In this work we generalise to supermaps between channels of any type; by…
Quantum channels can describe all transformations allowed by quantum mechanics. We provide an explicit universal protocol to construct all possible quantum channels, using a single qubit ancilla with quantum non-demolition readout and…