arXiv subjects

Renato Renner

Publications and source records attributed to Renato Renner.

At least 19 recordsLinked to original sources

arXiv2026

Bipartite Bound Information Exists

There exist bipartite quantum states that cost entanglement to create, yet from which no singlet can be distilled. This extreme irreversibility is known as bound entanglement. A quarter-century ago, Gisin and Wolf asked whether classical information theory admits the same phenomenon. Are there correlations, shared by two parties and an eavesdropper, that cost secret bits to create, yet from which none can be distilled? This question is part of a broader program exploring the relation between quantum and classical information theory. We answer it in the affirmative, providing a simple example, a distribution of two bits and a trit. Bound entanglement thus has a classical counterpart, bound information. An even more direct correspondence was originally conjectured, namely that measuring purifications of bound-entangled states yields distributions with bound information. The very states that motivated the conjecture, however, yield no bound information when measured in the standard basis, whereas suitable measurements of purifications of separable states do. The analogy between bound entanglement and bound information thus lies in the accounting of resources, not in a correspondence between individual quantum states and the classical probability distributions induced by measuring them.

quant-ph↗

arXiv2026

The Paradox of the Third Particle is classical

The Paradox of the Third Particle arises when particles are described relative to one of them serving as a reference frame. Although it is typically attributed to quantum superpositions, we show that the paradox and its ramifications$\unicode{x2014}$such as the relativity of subsystems$\unicode{x2014}$already occur classically. In light of this insight, we establish a no-go theorem that holds whenever physical subsystems, whether classical or quantum, are used as reference frames: if one demands that frame transformations be information-preserving, then it is impossible to meaningfully partition the world into subsystems, like individual particles, from the perspective of each frame.

quant-ph↗

arXiv2026

Robust generalized quantum Stein's lemma

The generalized quantum Stein's lemma provides an explicit expression for the optimal error exponent when distinguishing many independent and identically distributed (iid) copies of a given bipartite state from the set of separable bipartite states. Here we prove that this result is robust, in the sense that the iid assumption can be relaxed to almost-iid. In particular, our result shows that the original argument of Brand\~ao and Plenio, which contains a logical gap, can be made rigorous. Our proof relies on a novel continuity bound for the relative entropy of entanglement with respect to the quantum Wasserstein distance. Combined with a recent insight that almost-iid states and their exact iid counterparts are asymptotically close in this distance, the bound implies that their relative entropies of entanglement coincide asymptotically.

quant-ph↗

arXiv2026

Almost-iid information theory

Information-theoretic techniques are based on the assumption that resources are well characterized by independent and identically distributed (iid) states. This assumption cannot be justified operationally, since, for example, correlations between subsequent systems emitted by a source cannot be detected by any practical tomographic protocol. Operationally motivated symmetry assumptions still imply, via de Finetti theorems, that the resources are described by almost-iid states. This raises the question: Are almost-iid resources as effective as perfect iid resources for information-processing tasks? Here we address this question and prove that the conditional entropy of almost-iid states asymptotically coincides with that of iid states. As an application, this implies that squashed entanglement is robust for almost-iid states, asymptotically matching its value on iid states.

quant-ph↗

arXiv2026

Against probability: A quantum state is more than a list of probability distributions

The state of a quantum system can be represented by listing the outcome probabilities for a tomographically complete set of measurements. Such representations appear throughout physics, for example, in quantum field theory via correlation functions and in quantum foundations within generalized probabilistic frameworks. In this paper, we show a no-go result: To enable useful statements, the probability representation must be topologically robust$\unicode{x2014}$preserving the notion of closeness between states. Yet, a topologically robust probability representation cannot simultaneously retain other essential structure, such as the subsystem structure.

quant-ph↗

arXiv2025

The Elegant Joint Measurement is Non-Classical in the Triangle Network

When quantum systems are shared by multiple parties in a network, the measurement outcomes of the parties can exhibit non-classical correlations, i.e., correlations that cannot be obtained if the parties shared classical systems instead. This phenomenon is known as quantum nonlocality and is typically demonstrated in the Bell scenario. However, the Bell scenario is fundamentally simpler to investigate than general networks, since the latter come with non-convex optimization problems that are often intractable. The triangle network is one of the simplest networks exhibiting this non-convexity due to the presence of three independent sources. Although some special cases of quantum nonlocality are known in the triangle network, general methods to certify classical incompatibility are still lacking, which suggests that our understanding of networks is still rather limited. For instance, the Elegant Joint Measurement (EJM) distribution is a simple and highly-symmetric outcome distribution that can be obtained with quantum systems and measurements in the triangle network. This distribution was conjectured to be non-classical eight years ago. In this article, we provide the first proof of non-classicality of the EJM distribution. To do so, we show how to combine inflation, a causal inference technique, with powerful symmetry reductions and Frank-Wolfe algorithms for large-scale optimization. We then use these methods to obtain computer-assisted proofs of non-classicality in exact arithmetic.

quant-ph↗

arXiv2025

A resource theory of gambling

Betting games provide a natural setting to capture how information yields strategic advantage. The Kelly criterion for betting, long a cornerstone of portfolio theory and information theory, admits an interpretation in the limit of infinitely many repeated bets. We extend Kelly's seminal result into the single-shot and finite-betting regimes, recasting it as a resource theory of adversarial information. This allows one to quantify what it means for the gambler to have more information than the odds-maker. Given a target rate of return, after a finite number of bets, we compute the optimal strategy which maximises the probability of successfully reaching the target, revealing a risk-reward trade-off characterised by a hierarchy of R\'enyi divergences between the true distribution and the odds. The optimal strategies in the one-shot regime coincide with strategies maximizing expected utility, and minimising hypothesis testing errors, thereby bridging economic and information-theoretic viewpoints. We then generalize this framework to a distributed side-information game, in which multiple players observe correlated signals about an unknown state. Recasting gambling as an adversarial resource theory provides a unifying lens that connects economic and information-theoretic perspectives, and allows for generalisation to the quantum domain, where quantum side-information and entanglement play analogous roles.

quant-ph↗

arXiv2025

Randomness from causally independent processes

We consider a pair of causally independent processes, modelled as the tensor product of two channels, acting on a possibly correlated input to produce random outputs X and Y. We show that, assuming the processes produce a sufficient amount of randomness, one can extract uniform randomness from X and Y. This generalizes prior results, which assumed that X and Y are (conditionally) independent. Note that in contrast to the independence of quantum states, the independence of channels can be enforced through spacelike separation. As a consequence, our results allow for the generation of randomness under more practical and physically justifiable assumptions than previously possible. We illustrate this with the example of device-independent randomness amplification, where we can remove the constraint that the adversary only has access to classical side information about the source.

quant-ph↗

arXiv2025

Defining Security in Quantum Key Distribution

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.

quant-ph↗

arXiv2025

Events and their Localisation are Relative to a Lab

The notions of events and their localisation fundamentally differ between quantum theory and general relativity, reconciling them becomes even more important and challenging in the context of quantum gravity where a classical spacetime background can no longer be assumed. We therefore propose an operational approach drawing from quantum information, to define events and their localisation relative to a Lab, which in particular includes a choice of physical degree of freedom (the reference) providing a generalised notion of "location". We define a property of the reference, relative measurability, that is sensitive to correlations between the Lab's reference and objects of study. Applying this proposal to analyse the quantum switch (QS), a process widely associated with indefinite causal order, we uncover differences between classical and quantum spacetime realisations of QS, rooted in the relative measurability of the associated references and possibilities for agents' interventions. Our analysis also clarifies a longstanding debate on the interpretation of QS experiments, demonstrating how different conclusions stem from distinct assumptions on the Labs. This provides a foundation for a more unified view of events, localisation, and causality across quantum and relativistic domains.

quant-ph↗

arXiv2025

The future of secure communications: device independence in quantum key distribution

In the ever-evolving landscape of quantum cryptography, Device-independent Quantum Key Distribution (DI-QKD) stands out for its unique approach to ensuring security based not on the trustworthiness of the devices but on nonlocal correlations. Beginning with a contextual understanding of modern cryptographic security and the limitations of standard quantum key distribution methods, this review explores the pivotal role of nonclassicality and the challenges posed by various experimental loopholes for DI-QKD. Various protocols, security against individual, collective and coherent attacks, and the concept of self-testing are also examined, as well as the entropy accumulation theorem, and additional mathematical methods in formulating advanced security proofs. In addition, the burgeoning field of semi-device-independent models (measurement DI--QKD, Receiver DI--QKD, and One--sided DI--QKD) is also analyzed. The practical aspects are discussed through a detailed overview of experimental progress and the open challenges toward the commercial deployment in the future of secure communications.

quant-ph↗

arXiv2025

The firewall paradox is Wigner's friend paradox

The firewall paradox, a puzzle in black hole physics, depends on an implicit assumption: a rule that allows the infalling and the outside observer to combine their perspectives. However, a recent extension of the Wigner's friend paradox shows that such a combination rule conflicts with quantum theory $\unicode{x2013}$ without involving gravity. This challenges the usual conclusion of the firewall paradox, that standard quantum gravity assumptions are incompatible. More generally, black hole puzzles and Wigner's friend puzzles are closely related by a correspondence. This suggests that the firewall paradox may be a symptom of the same fundamental issue that leads to the extended Wigner's friend paradox.

quant-ph↗

arXiv2025

Uhlmann's theorem for relative entropies

Uhlmann's theorem states that, for any two quantum states $\rho_{AB}$ and $\sigma_A$, there exists an extension $\sigma_{AB}$ of $\sigma_A$ such that the fidelity between $\rho_{AB}$ and $\sigma_{AB}$ equals the fidelity between their reduced states $\rho_A$ and $\sigma_A$. In this work, we generalize Uhlmann's theorem to $\alpha$-R\'enyi relative entropies for $\alpha \in [\frac{1}{2},\infty]$, a family of divergences that encompasses fidelity, relative entropy, and max-relative entropy corresponding to $\alpha=\frac{1}{2}$, $\alpha=1$, and $\alpha=\infty$, respectively.

quant-ph↗

arXiv2024

Device-Independent Randomness Amplification

Successful realization of Bell tests has settled an 80-year-long debate, proving the existence of correlations which cannot be explained by a local realistic model. Recent experimental progress allowed to rule out any possible loopholes in these tests, and opened up the possibility of applications in cryptography envisaged more than three decades ago. A prominent example of such an application is device-independent quantum key distribution, which has recently been demonstrated. One remaining gap in all existing experiments, however, is that access to perfect randomness is assumed. To tackle this problem, the concept of randomness amplification has been introduced, allowing to generate such randomness from a weak source -- a task impossible in classical physics. In this work, we demonstrate the amplification of imperfect randomness coming from a physical source. It is achieved by building on two recent developments: The first is a theoretical protocol implementing the concept of randomness amplification within an experimentally realistic setup, which however requires a combination of the degree of Bell inequality violation (S-value) and the amount of data not attained previously. The second is experimental progress enabling the execution of a loophole-free Bell test with superconducting circuits, which offers a platform to reach the necessary combination. Our experiment marks an important step in achieving the theoretical physical limits of privacy and randomness generation.

quant-ph↗

arXiv2024

Fundamental limits for realising quantum processes in spacetime

Understanding the interface between quantum and relativistic theories is crucial for fundamental and practical advances, especially given that key physical concepts such as causality take different forms in these theories. Bell's no-go theorem reveals limits on classical processes, arising from relativistic causality principles. Considering whether similar fundamental limits exist on quantum processes, we derive no-go theorems for quantum experiments realisable in classical background spacetimes. We account for general processes allowed by quantum theory, including those with indefinite causal order (ICO), which have also been the subject of recent experiments. Our first theorem implies that realisations of ICO processes that do not violate relativistic causality must involve the non-localization of systems in spacetime. The second theorem shows that for any such realisation of an ICO process, there exists a more fine-grained description in terms of a definite and acyclic causal order process. This enables a general reconciliation of quantum and relativistic notions of causality and, in particular, applies to experimental realisations of the quantum switch, a prominent ICO process. By showing what is impossible to achieve in classical spacetimes, these no-go results also offer insights into how causality and information processing may differ in future quantum experiments in relativistic regimes beyond classical spacetimes.

quant-ph↗

arXiv2024

Tomography of clock signals using the simplest possible reference

We show that finite physical clocks always have well-behaved signals, namely that every waiting-time distribution generated by a physical process on a system of finite size is guaranteed to be bounded by a decay envelope. Following this consideration, we show that one can reconstruct the distribution using only operationally available information, namely, that of the ordering of the ticks of one clock with the respect to those of another clock (which we call the reference), and that the simplest possible reference clock -- a Poisson process -- suffices.

quant-ph↗

arXiv2024

Exploring the Local Landscape in the Triangle Network

Characterizing the set of distributions that can be realized in the triangle network is a notoriously difficult problem. In this work, we investigate inner approximations of the set of local (classical) distributions of the triangle network. A quantum distribution that appears to be nonlocal is the Elegant Joint Measurement (EJM) [Entropy. 2019; 21(3):325], which motivates us to study distributions having the same symmetries as the EJM. We compare analytical and neural-network-based inner approximations and find a remarkable agreement between the two methods. Using neural network tools, we also conjecture network Bell inequalities that give a trade-off between the levels of correlation and symmetry that a local distribution may feature. Our results considerably strengthen the conjecture that the EJM is nonlocal.

quant-ph↗

arXiv2023

Security of quantum key distribution from generalised entropy accumulation

The goal of quantum key distribution (QKD) is to establish a secure key between two parties connected by an insecure quantum channel. To use a QKD protocol in practice, one has to prove that a finite size key is secure against general attacks: no matter the adversary's attack, they cannot gain useful information about the key. A much simpler task is to prove security against collective attacks, where the adversary is assumed to behave identically and independently in each round. In this work, we provide a formal framework for general QKD protocols and show that for any protocol that can be expressed in this framework, security against general attacks reduces to security against collective attacks, which in turn reduces to a numerical computation. Our proof relies on a recently developed information-theoretic tool called generalised entropy accumulation and can handle generic prepare-and-measure protocols directly without switching to an entanglement-based version.

quant-ph↗