arXiv subjects

Renato Renner

Publications and source records attributed to Renato Renner.

At least 37 records · Page 2Linked to original sources

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↗

arXiv2023

Commuting operations factorise

Consider two agents, Alice and Bob, each of whom takes a quantum input, operates on a shared quantum system $K$, and produces a quantum output. Alice and Bob's operations may commute, in the sense that the joint input-output behaviour is independent of the order in which they access $K$. Here we ask whether this commutation property implies that $K$ can be split into two factors on which Alice and Bob act separately. The question can be regarded as a "fully quantum" generalisation of a problem posed by Tsirelson, who considered the case where Alice and Bob's inputs and outputs are classical. In this case, the answer is negative in general, but it is known that a factorisation exists in finite dimensions. Here we show the same holds in the fully quantum case, i.e., commuting operations factorise, provided that all input systems are finite-dimensional.

quant-ph↗

arXiv2023

The debate over QKD: A rebuttal to the NSA's objections

A recent publication by the NSA assessing the usability of quantum cryptography has generated significant attention, concluding that this technology is not recommended for use. Here, we reply to this criticism and argue that some of the points raised are unjustified, whereas others are problematic now but can be expected to be resolved in the foreseeable future.

quant-ph↗

arXiv2023

Improved DIQKD protocols with finite-size analysis

The security of finite-length keys is essential for the implementation of device-independent quantum key distribution (DIQKD). Presently, there are several finite-size DIQKD security proofs, but they are mostly focused on standard DIQKD protocols and do not directly apply to the recent improved DIQKD protocols based on noisy preprocessing, random key measurements, and modified CHSH inequalities. Here, we provide a general finite-size security proof that can simultaneously encompass these approaches, using tighter finite-size bounds than previous analyses. In doing so, we develop a method to compute tight lower bounds on the asymptotic keyrate for any such DIQKD protocol with binary inputs and outputs. With this, we show that positive asymptotic keyrates are achievable up to depolarizing noise values of $9.33\%$, exceeding all previously known noise thresholds. We also develop a modification to random-key-measurement protocols, using a pre-shared seed followed by a "seed recovery" step, which yields substantially higher net key generation rates by essentially removing the sifting factor. Some of our results may also improve the keyrates of device-independent randomness expansion.

quant-ph↗

arXiv2023

Quantum Advantage in Cryptography

Ever since its inception, cryptography has been caught in a vicious circle: Cryptographers keep inventing methods to hide information, and cryptanalysts break them, prompting cryptographers to invent even more sophisticated encryption schemes, and so on. But could it be that quantum information technology breaks this circle? At first sight, it looks as if it just lifts the competition between cryptographers and cryptanalysts to the next level. Indeed, quantum computers will render most of today's public key cryptosystems insecure. Nonetheless, there are good reasons to believe that cryptographers will ultimately prevail over cryptanalysts. Quantum cryptography allows us to build communication schemes whose secrecy relies only on the laws of physics and some minimum assumptions about the cryptographic hardware - leaving basically no room for an attack. While we are not yet there, this article provides an overview of the principles and state of the art of quantum cryptography, as well as an assessment of current challenges and prospects for overcoming them.

quant-ph↗

arXiv2022

Energy requirement for implementing unitary gates on energy-unbounded systems

The processing of quantum information always has a cost in terms of physical resources such as energy or time. Determining the resource requirements is not only an indispensable step in the design of practical devices - the resources need to be actually provided - but may also yield fundamental constraints on the class of processes that are physically possible. Here we study how much energy is required to implement a desired unitary gate on a quantum system with a non-trivial energy spectrum. We derive a general lower bound on the energy requirement, extending the main result of Ref. [1] from finite dimensional systems to systems with unbounded Hamiltonians. Such an extension has immediate applications in quantum information processing with optical systems, and allows us to provide bounds on the energy requirement of continuous variable quantum gates, such as displacement and squeezing gates.

quant-ph↗

arXiv2022

Generalised entropy accumulation

Consider a sequential process in which each step outputs a system $A_i$ and updates a side information register $E$. We prove that if this process satisfies a natural "non-signalling" condition between past outputs and future side information, the min-entropy of the outputs $A_1, \dots, A_n$ conditioned on the side information $E$ at the end of the process can be bounded from below by a sum of von Neumann entropies associated with the individual steps. This is a generalisation of the entropy accumulation theorem (EAT), which deals with a more restrictive model of side information: there, past side information cannot be updated in subsequent rounds, and newly generated side information has to satisfy a Markov condition. Due to its more general model of side-information, our generalised EAT can be applied more easily and to a broader range of cryptographic protocols. As examples, we give the first multi-round security proof for blind randomness expansion and a simplified analysis of the E91 QKD protocol. The proof of our generalised EAT relies on a new variant of Uhlmann's theorem and new chain rules for the Renyi divergence and entropy, which might be of independent interest.

quant-ph↗

arXiv2022

The nonequilibrium cost of accurate information processing

Accurate information processing is crucial both in technology and in nature. To achieve it, any information processing system needs an initial supply of resources away from thermal equilibrium. Here we establish a fundamental limit on the accuracy achievable with a given amount of nonequilibrium resources. The limit applies to arbitrary information processing tasks and arbitrary information processing systems subject to the laws of quantum mechanics. It is easily computable and is expressed in terms of an entropic quantity, which we name reverse entropy, associated to a time reversal of the information processing task under consideration. The limit is achievable for all deterministic classical computations and for all their quantum extensions. As an application, we establish the optimal tradeoff between nonequilibrium and accuracy for the fundamental tasks of storing, transmitting, cloning, and erasing information. Our results set a target for the design of new devices approaching the ultimate efficiency limit, and provide a framework for demonstrating thermodynamical advantages of quantum devices over their classical counterparts.

quant-ph↗

arXiv2022

Thought experiments in a quantum computer

We introduce a software package that allows users to design and run simulations of thought experiments in quantum theory. In particular, it covers cases where several reasoning agents are modelled as quantum systems, such as Wigner's friend experiment. Users can customize the protocol of the experiment, the inner workings of agents (including a quantum circuit that models their reasoning process), the abstract logical system used (which may or not allow agents to combine premises and make inferences about each other's reasoning), and the interpretation of quantum theory used by different agents. Our open-source software is written in a quantum programming language, ProjectQ, and runs on classical or quantum hardware. As an example, we model the Frauchiger-Renner extended Wigner's friend thought experiment, where agents are allowed to measure each other's physical memories, and make inferences about each other's reasoning.

quant-ph↗

arXiv2022

Independent quality assessment of a commercial quantum random number generator

We reverse-engineer, test and analyse hardware and firmware of the commercial quantum-optical random number generator Quantis from ID Quantique. We show that > 99% of its output data originates in physically random processes: random timing of photon absorption in a semiconductor material, and random growth of avalanche owing to impact ionisation. Under a strong assumption that these processes correspond to a measurement of an initially pure state of the components, our analysis implies the unpredictability of the generated randomness. We have also found minor non-random contributions from imperfections in detector electronics and an internal processing algorithm, specific to this particular device. Our work shows that the design quality of a commercial quantum-optical randomness source can be verified without cooperation of the manufacturer and without access to the engineering documentation.

quant-ph↗

arXiv2022

Quantum clocks are more precise than classical ones

A clock is, from an information-theoretic perspective, a system that emits information about time. One may therefore ask whether the theory of information imposes any constraints on the maximum precision of clocks. Here we show a quantum-over-classical advantage for clocks or, more precisely, the task of generating information about what time it is. The argument is based on information-theoretic considerations: we analyse how the precision of a clock scales with its size, measured in terms of the number of bits that could be stored in it. We find that a quantum clock can achieve a quadratically improved precision compared to a purely classical one of the same size.

quant-ph↗

arXiv2021

The black hole information puzzle and the quantum de Finetti theorem

The black hole information puzzle arises from a discrepancy between conclusions drawn from general relativity and quantum theory about the nature of the radiation emitted by a black hole. According to Hawking's original argument, the radiation is thermal and its entropy thus increases monotonically as the black hole evaporates. Conversely, due to the reversibility of time evolution according to quantum theory, the radiation entropy should start to decrease after a certain time, as predicted by the Page curve. This decrease has been confirmed by new calculations based on the replica trick, which also exhibit its geometrical origin: spacetime wormholes that form between the replicas. Here we analyse the discrepancy between these and Hawking's original conclusions from a quantum information theory viewpoint, using in particular the quantum de Finetti theorem. The theorem implies the existence of extra information, $W$, which is neither part of the black hole nor the radiation, but plays the role of a reference. The entropy obtained via the replica trick can then be identified to be the entropy $S(R|W)$ of the radiation conditioned on the reference $W$, whereas Hawking's original result corresponds to the non-conditional entropy $S(R)$. The entropy $S(R|W)$, which mathematically is an ensemble average, gains an operational meaning in an experiment with $N$ independently prepared black holes: For large $N$, it equals the normalised entropy of their joint radiation, $S(R_1 \cdots R_N)/N$. The discrepancy between this entropy and $S(R)$ implies that the black holes are correlated. The replica wormholes may thus be interpreted as the geometrical representation of this correlation. Our results also suggest a many-black-hole extension of the widely used random unitary model, which we support with non-trivial checks.

hep-th↗

arXiv2021

Security in Quantum Cryptography

Quantum cryptography exploits principles of quantum physics for the secure processing of information. A prominent example is secure communication, i.e., the task of transmitting confidential messages from one location to another. The cryptographic requirement here is that the transmitted messages remain inaccessible to anyone other than the designated recipients, even if the communication channel is untrusted. In classical cryptography, this can usually only be guaranteed under computational hardness assumptions, e.g., that factoring large integers is infeasible. In contrast, the security of quantum cryptography relies entirely on the laws of quantum mechanics. Here we review this physical notion of security, focusing on quantum key distribution and secure communication.

quant-ph↗

arXiv2021

Testing quantum theory with thought experiments

Quantum mechanics is one of our most successful physical theories; its predictions agree with experimental observations to an extremely high accuracy. However, the bare formalism of quantum theory does not provide straightforward answers to seemingly simple questions: for example, how should one model systems that include agents who are themselves using quantum theory? These foundational questions may be investigated with a theorist's tool -- the thought experiment. Its purpose is to turn debates about the interpretation of quantum theory into actual physics questions. In this article, we give a state-of-the-art overview on quantum thought experiments involving observers, from the basic Wigner's friend to the recent Frauchiger-Renner setup, clarifying their interpretational significance and responding to objections and criticism on the way.

quant-ph↗

arXiv2021

Fundamental energy requirement of reversible quantum operations

Landauer's principle asserts that any computation has an unavoidable energy cost that grows proportionally to its degree of logical irreversibility. But even a logically reversible operation, when run on a physical processor that operates on different energy levels, requires energy. Here we quantify this energy requirement, providing upper and lower bounds that coincide up to a constant factor. We derive these bounds from a general quantum resource-theoretic argument, which implies that the initial resource requirement for implementing a unitary operation within an error~$ε$ grows like $1/\sqrt ε$ times the amount of resource generated by the operation. Applying these results to quantum circuits, we find that their energy requirement can, by an appropriate design, be made independent of their time complexity.

quant-ph↗

arXiv2021

Optimal universal programming of unitary gates

A universal quantum processor is a device that takes as input a (quantum) program, containing an encoding of an arbitrary unitary gate, and a (quantum) data register, on which the encoded gate is applied. While no perfect universal quantum processor can exist, approximate processors have been proposed in the past two decades. A fundamental open question is how the size of the smallest quantum program scales with the approximation error. Here we answer the question, by proving a bound on the size of the program and designing a concrete protocol that attains the bound in the asymptotic limit. Our result is based on a connection between optimal programming and the Heisenberg limit of quantum metrology, and establishes an asymptotic equivalence between the tasks of programming, learning, and estimating unitary gates.

quant-ph↗

arXiv2020

Are quantum cryptographic security claims vacuous?

A central claim in quantum cryptography is that secrecy can be proved rigorously, based on the assumption that the relevant information-processing systems obey the laws of quantum physics. This claim has recently been challenged by Bernstein (arXiv:1803.04520). He argues that the laws of physics may also entail an unavoidable leakage of any classical information encoded in physical carriers. The security claim of quantum key distribution would then be vacuous, as the computation of the final secret key would leak its value. However, as we explain in this short note, Bernstein's reasoning is based on a too "classical" understanding of physics. It follows from known theorems about fault-tolerant quantum computation that quantum physics avoids his conclusion.

quant-ph↗