Security of quantum key distribution
- R. Renner
- 1 December 2005
Computer Science
Ausgezeichnete Informatikdissertationen
This work proposes an approach which allows us to study general physical systems for which the above mentioned independence condition does not necessarily hold, and introduces new uncertainty measures, called smooth min- and max-entropy, which are generalizations of information-theoretical notions.
Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology
- U. Maurer, R. Renner, Clemens Holenstein
- 19 February 2004
Computer Science, Mathematics
Theory of Cryptography Conference
The goals of this paper are two-fold. First we introduce and motivate a generalization of the fundamental concept of the indistinguishability of two systems, called indifferentiability. This…
Quantum theory cannot consistently describe the use of itself
- D. Frauchiger, R. Renner
- 25 April 2016
Physics, Philosophy
Nature Communications
A variant of Wigner’s friend Gedankenexperiment where each of the current interpretations of QM fails in giving a consistent description, indicating that quantum theory cannot be extrapolated to complex systems, at least not in a straightforward manner.
The uncertainty principle in the presence of quantum memory
- M. Berta, M. Christandl, R. Colbeck, J. Renes, R. Renner
- 7 September 2009
Physics
The Heisenberg uncertainty principle bounds the uncertainties about the outcomes of two incompatible measurements on a quantum particle. This bound, however, changes if a memory device is involved…
Tight finite-key analysis for quantum cryptography
- M. Tomamichel, C. Lim, N. Gisin, R. Renner
- 21 March 2011
Computer Science, Mathematics
Nature Communications
This study demonstrates how two instances of discrepancies can be resolved by taking advantage of an enotropic formulation of the uncertainty principle, based on the uncertainty relation for smooth entropies.
A Fully Quantum Asymptotic Equipartition Property
- M. Tomamichel, R. Colbeck, R. Renner
- 10 November 2008
Computer Science
IEEE Transactions on Information Theory
A fully quantum generalization of the classical asymptotic equipartition property is shown, where both the output of the experiment and side information are quantum.
Smooth Renyi entropy and applications
We introduce a new entropy measure, called smooth Renyi entropy. The measure characterizes fundamental properties of a random variable Z, such as the amount of uniform randomness that can be…
One-shot classical-quantum capacity and hypothesis testing.
- Ligong Wang, R. Renner
- 30 July 2010
Computer Science
Physical Review Letters
This work shows that the one-shot classical capacity of a quantum channel is well approximated by a relative-entropy-type measure defined via hypothesis testing, and gives a conceptually simple proof of the well-known Holevo-Schumacher-Westmoreland theorem for the capacity of memoryless channels.
Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
It is shown that the two new quantities, and related notions, do not only extend Shannon entropy in the described contexts, but they also share central properties of the latter such as the chain rule as well as sub-additivity and monotonicity.
The Operational Meaning of Min- and Max-Entropy
- R. König, R. Renner, Christian Schaffner
- 8 July 2008
Computer Science
IEEE Transactions on Information Theory
The results establish a direct connection between min- and max-entropies, known to characterize information-processing tasks such as randomness extraction and state merging, and basic operational problems.
...
...