相关论文: Accessible versus Holevo Information for a Binary …

We formulate multiparameter quantum estimation in the parametric and semiparametric setting. While the Holevo Cram\'er-Rao bound (CRB) requires no substantial modifications in moving from the former to the latter, we generalize the Helstrom…

We present a new decoding procedure to transmit classical information in a quantum channel which, saturating asymptotically the Holevo bound, achieves the optimal rate of the communication line. Differently from previous proposals, it is…

The unconditional security of a quantum key distribution protocol is often defined in terms of the accessible information, that is, the maximum mutual information between the distributed key S and the outcome of an optimal measurement on…

We derive an exact expression for the quantumness of a Hilbert space (defined in quant-ph/0302092), and show that in composite Hilbert spaces the signal states must contain at least some entangled states in order to achieve such a…

"Bounds on information combining" are entropic inequalities that determine how the information (entropy) of a set of random variables can change when these are combined in certain prescribed ways. Such bounds play an important role in…

Consider the finite regular language L_n = {w0 : w \in {0,1}^*, |w| \le n}. It was shown by Ambainis, Nayak, Ta-Shma and Vazirani that while this language is accepted by a deterministic finite automaton of size O(n), any one-way quantum…

This paper considers a random access system where each sender can be in two modes of operation, active or not active, and where the set of active users is available to a common receiver only. Active transmitters encode data into independent…

In this paper we generalize the notion of common information of two dependent variables introduced by G\'acs & K\"orner. They defined common information as the largest entropy rate of a common random variable two parties observing one of…

We derive an achievability bound to quantify the performance of a type-based unsourced multiple access system -- an information-theoretic model for grant-free multiple access with correlated messages. The bound extends available…

This paper presents self-contained proofs of the strong subadditivity inequality for quantum entropy and some related inequalities for the quantum relative entropy, most notably its convexity and its monotonicity under stochastic maps.…

In this paper we present finite-key security analysis for quantum key distribution protocol based on weak coherent (in particular phase-coded) states using a fully quantum asymptotic equipartition property technique. This work is the…

Every sufficiently rich set of measurements on a fixed quantum system defines a statistical norm on the states of that system via the optimal bias that can be achieved in distinguishing the states using measurements from that set (assuming…

We study the problem of separating the data produced by a given quantum measurement (on states from a memoryless source which is unknown except for its average state), described by a positive operator valued measure (POVM), into a…

In all lossy communication channels realized to date, information is inevitably leaked to a potential eavesdropper. Here we present a communication protocol that does not allow for any information leakage to a potential eavesdropper in a…

We propose a classification of measurement apparatuses based on their reliability and accessibility. Our notion of reliability parameterises the possibility of getting unexpected wrong results when using the apparatus in a given time…

The secret-key rate measures the rate at which Alice and Bob can extract secret bits from sampling a joint probability distribution, unknown to an eavesdropper Eve. The secret-key rate has been bounded above by the intrinsic information and…

Although a concept class may be learnt more efficiently using quantum samples as compared with classical samples in certain scenarios, Arunachalam and de Wolf (JMLR, 2018) proved that quantum learners are asymptotically no more efficient…

We leverage proof techniques Fourier analysis and an existing result in coding theory to derive new bounds for the problem of non-interactive simulation of binary random variables. Previous bounds in the literature were derived by applying…

Quantum states of light are the obvious choice for communicating quantum information. To date, encoding information into the polarisation states of single photons has been widely used as these states form an natural closed two state qubit.…

We study the reachability problem of a quantum system modelled by a quantum automaton. The reachable sets are chosen to be boolean combinations of (closed) subspaces of the state space of the quantum system. Four different reachability…