arXiv subjects

Renato Renner

Publications and source records attributed to Renato Renner.

At least 55 records · Page 3Linked to original sources

arXiv2020

Entropy accumulation

We ask the question whether entropy accumulates, in the sense that the operationally relevant total uncertainty about an $n$-partite system $A = (A_1, \ldots A_n)$ corresponds to the sum of the entropies of its parts $A_i$. The Asymptotic Equipartition Property implies that this is indeed the case to first order in $n$, under the assumption that the parts $A_i$ are identical and independent of each other. Here we show that entropy accumulation occurs more generally, i.e., without an independence assumption, provided one quantifies the uncertainty about the individual systems $A_i$ by the von Neumann entropy of suitably chosen conditional states. The analysis of a large system can hence be reduced to the study of its parts. This is relevant for applications. In device-independent cryptography, for instance, the approach yields essentially optimal security bounds valid for general attacks, as shown by Arnon-Friedman et al.

quant-ph↗

arXiv2020

Bounds on Lyapunov exponents via entropy accumulation

Lyapunov exponents describe the asymptotic behavior of the singular values of large products of random matrices. A direct computation of these exponents is however often infeasible. By establishing a link between Lyapunov exponents and an information theoretic tool called entropy accumulation theorem we derive an upper and a lower bound for the maximal and minimal Lyapunov exponent, respectively. The bounds assume independence of the random matrices, are analytical, and are tight in the commutative case as well as in other scenarios. They can be expressed in terms of an optimization problem that only involves single matrices rather than large products. The upper bound for the maximal Lyapunov exponent can be evaluated efficiently via the theory of convex optimization.

math-ph↗

arXiv2020

Advantage distillation for device-independent quantum key distribution

We derive a sufficient condition for advantage distillation to be secure against collective attacks in device-independent quantum key distribution (DIQKD), focusing on the repetition-code protocol. In addition, we describe a semidefinite programming method to check whether this condition holds for any probability distribution obtained in a DIQKD protocol. Applying our method to various probability distributions, we find that advantage distillation is possible up to depolarising-noise values of $q \approx 9.1\%$ or limited detector efficiencies of $η\approx 89.1\%$ in a 2-input 2-output scenario. This exceeds the noise thresholds of $q \approx 7.1\%$ and $η\approx 90.7\%$ respectively for DIQKD with one-way error correction using the CHSH inequality, thereby showing that it is possible to distill secret key beyond those thresholds.

quant-ph↗

arXiv2020

Ultimate limit on time signal generation

The generation of time signals is a fundamental task in science. Here we study the relation between the quality of a time signal and the physics of the system that generates it. According to quantum theory, any time signal can be decomposed into individual quanta that lead to single detection events. Our main result is a bound on how sharply peaked in time these events can be, which depends on the dimension of the signal generator. This result promises applications in various directions, including information theory, quantum clocks, and process simulation.

quant-ph↗

arXiv2020

Tangible phenomenological thermodynamics

In this paper, the foundations of classical phenomenological thermodynamics are being thoroughly revisited. A new rigorous basis for thermodynamics is laid out in the main text and presented in full detail in the appendix. All relevant concepts, such as work, heat, internal energy, heat reservoirs, reversibility, absolute temperature and entropy, are introduced on an abstract level and connected through traditional results, such as Carnot's Theorem, Clausius' Theorem and the Entropy Theorem. The paper offers insights into the basic assumptions one has to make in order to formally introduce a phenomenological thermodynamic theory. This contribution is of particular importance when applying phenomenological thermodynamics to systems, such as black holes, where the microscopic physics is not yet fully understood. Altogether, this work can serve as a basis for a complete and rigorous introduction to thermodynamics in an undergraduate course which follows the traditional lines as closely as possible.

math-ph↗

arXiv2020

Discovering physical concepts with neural networks

Despite the success of neural networks at solving concrete physics problems, their use as a general-purpose tool for scientific discovery is still in its infancy. Here, we approach this problem by modelling a neural network architecture after the human physical reasoning process, which has similarities to representation learning. This allows us to make progress towards the long-term goal of machine-assisted scientific discovery from experimental data without making prior assumptions about the system. We apply this method to toy examples and show that the network finds the physically relevant parameters, exploits conservation laws to make predictions, and can help to gain conceptual insights, e.g. Copernicus' conclusion that the solar system is heliocentric.

quant-ph↗

arXiv2020

Operationally meaningful representations of physical systems in neural networks

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.

quant-ph↗

arXiv2019

Accuracy enhancing protocols for quantum clocks

The accuracy of the time information generated by clocks can be enhanced by allowing them to communicate with each other. Here we consider a basic scenario where a quantum clock receives a low-accuracy time signal as input and ask whether it can generate an output of higher accuracy. We propose protocols that use a quantum clock with a $d$-dimensional state space to achieve an accuracy enhancement by a factor of $d$, for large enough $d$. If no feedback to the input signal is allowed, this enhancement is temporary. With feedback the accuracy enhancement can be retained indefinitely. Our protocols are specific to quantum clocks, and may be used to synchronise them in a network, defining a time scale that is more accurate than what can be achieved by non-interacting or classical clocks.

quant-ph↗

arXiv2019

A chain rule for the quantum relative entropy

The chain rule for the classical relative entropy ensures that the relative entropy between probability distributions on multipartite systems can be decomposed into a sum of relative entropies of suitably chosen conditional distributions on the individual systems. Here, we prove a similar chain rule inequality for the quantum relative entropy in terms of channel relative entropies. The new chain rule allows us to solve an open problem in the context of asymptotic quantum channel discrimination: surprisingly, adaptive protocols cannot improve the error rate for asymmetric channel discrimination compared to non-adaptive strategies. In addition, we give examples of quantum channels showing that the channel relative entropy is not additive under the tensor product.

quant-ph↗

arXiv2019

Imperfect Thermalizations Allow for Optimal Thermodynamic Processes

Optimal (reversible) processes in thermodynamics can be modelled as step-by-step processes, where the system is successively thermalized with respect to different Hamiltonians by an external thermal bath. However, in practice interactions between system and thermal bath will take finite time, and precise control of their interaction is usually out of reach. Motivated by this observation, we consider finite-time and uncontrolled operations between system and bath, which result in thermalizations that are only partial in each step. We show that optimal processes can still be achieved for any non-trivial partial thermalizations at the price of increasing the number of operations, and characterise the corresponding tradeoff. We focus on work extraction protocols and show our results in two different frameworks: A collision model and a model where the Hamiltonian of the working system is controlled over time and the system can be brought into contact with a heat bath. Our results show that optimal processes are robust to noise and imperfections in small quantum systems, and can be achieved by a large set of interactions between system and bath.

quant-ph↗

arXiv2019

Simple and tight device-independent security proofs

Device-independent security is the gold standard for quantum cryptography: not only is security based entirely on the laws of quantum mechanics, but it holds irrespective of any a priori assumptions on the quantum devices used in a protocol, making it particularly applicable in a quantum-wary environment. While the existence of device-independent protocols for tasks such as randomness expansion and quantum key distribution has recently been established, the underlying proofs of security remain very challenging, yield rather poor key rates, and demand very high-quality quantum devices, thus making them all but impossible to implement in practice. We introduce a technique for the analysis of device-independent cryptographic protocols. We provide a flexible protocol and give a security proof that provides quantitative bounds that are asymptotically tight, even in the presence of general quantum adversaries. At a high level our approach amounts to establishing a reduction to the scenario in which the untrusted device operates in an identical and independent way in each round of the protocol. This is achieved by leveraging the sequential nature of the protocol, and makes use of a newly developed tool, the "entropy accumulation theorem" of Dupuis et al. As concrete applications we give simple and modular security proofs for device-independent quantum key distribution and randomness expansion protocols based on the CHSH inequality. For both tasks we establish essentially optimal asymptotic key rates and noise tolerance. In view of recent experimental progress, which has culminated in loophole-free Bell tests, it is likely that these protocols can be practically implemented in the near future.

quant-ph↗

arXiv2018

Quantum theory cannot consistently describe the use of itself

Quantum theory provides an extremely accurate description of fundamental processes in physics. It thus seems likely that the theory is applicable beyond the, mostly microscopic, domain in which it has been tested experimentally. Here we propose a Gedankenexperiment to investigate the question whether quantum theory can, in principle, have universal validity. The idea is that, if the answer was yes, it must be possible to employ quantum theory to model complex systems that include agents who are themselves using quantum theory. Analysing the experiment under this presumption, we find that one agent, upon observing a particular measurement outcome, must conclude that another agent has predicted the opposite outcome with certainty. The agents' conclusions, although all derived within quantum theory, are thus inconsistent. This indicates that quantum theory cannot be extrapolated to complex systems, at least not in a straightforward manner.

quant-ph↗

arXiv2018

Toward an Algebraic Theory of Systems

We propose the concept of a system algebra with a parallel composition operation and an interface connection operation, and formalize composition-order invariance, which postulates that the order of composing and connecting systems is irrelevant, a generalized form of associativity. Composition-order invariance explicitly captures a common property that is implicit in any context where one can draw a figure (hiding the drawing order) of several connected systems, which appears in many scientific contexts. This abstract algebra captures settings where one is interested in the behavior of a composed system in an environment and wants to abstract away anything internal not relevant for the behavior. This may include physical systems, electronic circuits, or interacting distributed systems. One specific such setting, of special interest in computer science, are functional system algebras, which capture, in the most general sense, any type of system that takes inputs and produces outputs depending on the inputs, and where the output of a system can be the input to another system. The behavior of such a system is uniquely determined by the function mapping inputs to outputs. We consider several instantiations of this very general concept. In particular, we show that Kahn networks form a functional system algebra and prove their composition-order invariance. Moreover, we define a functional system algebra of causal systems, characterized by the property that inputs can only influence future outputs, where an abstract partial order relation captures the notion of "later". This system algebra is also shown to be composition-order invariant and appropriate instantiations thereof allow to model and analyze systems that depend on time.

cs.OH↗

arXiv2018

Confidence Polytopes in Quantum State Tomography

Quantum State Tomography is the task of inferring the state of a quantum system from measurement data. A reliable tomography scheme should not only report an estimate for that state, but also well-justified error bars. These may be specified in terms of confidence regions, i.e., subsets of the state space which contain the system's state with high probability. Here, building upon a quantum generalisation of Clopper-Pearson confidence intervals--a notion known from classical statistics--we present a simple and reliable scheme for generating confidence regions. These have the shape of a polytope and can be computed efficiently. We provide several examples to demonstrate the practical usability of the scheme in experiments.

quant-ph↗

arXiv2018

Necessary criterion for approximate recoverability

A tripartite state $ρ_{ABC}$ forms a Markov chain if there exists a recovery map $\mathcal{R}_{B \to BC}$ acting only on the $B$-part that perfectly reconstructs $ρ_{ABC}$ from $ρ_{AB}$. To achieve an approximate reconstruction, it suffices that the conditional mutual information $I(A:C|B)_ρ$ is small, as shown recently. Here we ask what conditions are necessary for approximate state reconstruction. This is answered by a lower bound on the relative entropy between $ρ_{ABC}$ and the recovered state $\mathcal{R}_{B\to BC}(ρ_{AB})$. The bound consists of the conditional mutual information and an entropic correction term that quantifies the disturbance of the $B$-part by the recovery map.

quant-ph↗

arXiv2018

Universal recovery maps and approximate sufficiency of quantum relative entropy

The data processing inequality states that the quantum relative entropy between two states $ρ$ and $σ$ can never increase by applying the same quantum channel $\mathcal{N}$ to both states. This inequality can be strengthened with a remainder term in the form of a distance between $ρ$ and the closest recovered state $(\mathcal{R} \circ \mathcal{N})(ρ)$, where $\mathcal{R}$ is a recovery map with the property that $σ= (\mathcal{R} \circ \mathcal{N})(σ)$. We show the existence of an explicit recovery map that is universal in the sense that it depends only on $σ$ and the quantum channel $\mathcal{N}$ to be reversed. This result gives an alternate, information-theoretic characterization of the conditions for approximate quantum error correction.

quant-ph↗

arXiv2018

Smooth entropy in axiomatic thermodynamics

Thermodynamics can be formulated in either of two approaches, the phenomenological approach, which refers to the macroscopic properties of systems, and the statistical approach, which describes systems in terms of their microscopic constituents. We establish a connection between these two approaches by means of a new axiomatic framework that can take errors and imprecisions into account. This link extends to systems of arbitrary sizes including microscopic systems, for which the treatment of imprecisions is pertinent to any realistic situation. Based on this, we identify the quantities that characterise whether certain thermodynamic processes are possible with entropy measures from information theory. In the error-tolerant case, these entropies are so-called smooth min and max entropies. Our considerations further show that in an appropriate macroscopic limit there is a single entropy measure that characterises which state transformations are possible. In the case of many independent copies of a system (the so-called i.i.d. regime), the relevant quantity is the von Neumann entropy.

quant-ph↗

arXiv2018

Performance of stochastic clocks in the Alternate Ticks Game

In standard quantum theory, time is not an observable. It enters as a parameter in the Schrödinger equation, but there is no measurement operator associated to it. Nevertheless, one may take an operational viewpoint and regard time as the information one can read from clocks. The Alternate Ticks Game, introduced in arXiv:1506.01373, is a completely operational means to quantify the accuracy of time scales generated by clocks. The idea is to count the number of ticks that two copies of a clock can produce until they run out of synchronisation. Here we investigate the performance of stochastic clocks in this game. These are clocks which are classical in the sense that they do not exploit quantum coherence. Our results support earlier conjectures that their accuracy grows linearly in the size of the clockwork, measured in terms of the dimension of the associated Hilbert space. In particular, we derive explicit bounds on the accuracy of a natural class of stochastic clocks, the stochastic ladder clocks.

quant-ph↗