Renato Renner


Loading...

Last Name

Renner

First Name

Renato

Organisational unit

03781 - Renner, Renato / Renner, Renato

Search Results

Publications1 - 10 of 236
  • Ferradini, Carla; Sandfuchs, Martin; Wolf, Ramona; et al. (2025)
    arXiv
    The security of quantum key distribution (QKD) is quantified by a parameter $\varepsilon>0$, which -- under well-defined physical assumptions -- can be bounded explicitly. This contrasts with computationally secure schemes, where security claims are only asymptotic (i.e., under standard complexity assumptions, one only knows that $\varepsilon \to 0$ as the key size grows, but has no explicit bound). Here we explain the definition and interpretation of $\varepsilon$-security. Adopting an axiomatic approach, we show that $\varepsilon$ can be understood as the maximum probability of a security failure. Finally, we review and address several criticisms of this definition that have appeared in the literature.
  • Faist, Philippe; Dupuis, Frédéric; Oppenheim, Jonathan; et al. (2015)
    Nature Communications
    Irreversible information processing cannot be carried out without some inevitable thermodynamical work cost. This fundamental restriction, known as Landauer’s principle, is increasingly relevant today, as the energy dissipation of computing devices impedes the development of their performance. Here we determine the minimal work required to carry out any logical process, for instance a computation. It is given by the entropy of the discarded information conditional to the output of the computation. Our formula takes precisely into account the statistically fluctuating work requirement of the logical process. It enables the explicit calculation of practical scenarios, such as computational circuits or quantum measurements. On the conceptual level, our result gives a precise and operational connection between thermodynamic and information entropy, and explains the emergence of the entropy state function in macroscopic thermodynamics.
  • Ursin, Rupert; Jennewein, Thomas; Perdigues, Josep M.; et al. (2008)
    IAC Proceedings A2.1.3
  • Hänggi, Esther; Renner, Renato; Wolf, Stefan (2013)
    Theoretical Computer Science
  • Woods, Mischa P.; Silva, Ralph; Pütz, Gilles; et al. (2018)
    arXiv
  • Majenz, Christian; Berta, Mario; Dupuis, Frédéric; et al. (2016)
    arXiv
  • Renner, Renato; Wolf, Stefan (2013)
    Theoretical Computer Science
  • Security of quantum key distribution
    Item type: Doctoral Thesis
    Renner, Renato (2005)
  • Poulsen Nautrup, Hendrik; Metger, Tony; Iten, Raban; et al. (2020)
    arXiv
    To make progress in science, we often build abstract representations of physical systems that meaningfully encode information about the systems. The representations learnt by most current machine learning techniques reflect statistical structure present in the training data; however, these methods do not allow us to specify explicit and operationally meaningful requirements on the representation. Here, we present a neural network architecture based on the notion that agents dealing with different aspects of a physical system should be able to communicate relevant information as efficiently as possible to one another. This produces representations that separate different parameters which are useful for making statements about the physical system in different experimental settings. We present examples involving both classical and quantum physics. For instance, our architecture finds a compact representation of an arbitrary two-qubit system that separates local parameters from parameters describing quantum correlations. We further show that this method can be combined with reinforcement learning to enable representation learning within interactive scenarios where agents need to explore experimental settings to identify relevant variables.
  • Renner, Renato; Skripsky, Juraj; Wolf, Stefan (2003)
    Proceedings of the 2003 IEEE International Symposium on Information Theory
Publications1 - 10 of 236