arXiv subjects

Stephanie Wehner

Publications and source records attributed to Stephanie Wehner.

At least 127 records · Page 7Linked to original sources

arXiv2014

Relative Thermalization

When studying thermalization of quantum systems, it is typical to ask whether a system interacting with an environment will evolve towards a local thermal state. Here, we show that a more general and relevant question is "when does a system thermalize relative to a particular reference?" By relative thermalization we mean that, as well as being in a local thermal state, the system is uncorrelated with the reference. We argue that this is necessary in order to apply standard statistical mechanics to the study of the interaction between a thermalized system and a reference. We then derive a condition for relative thermalization of quantum systems interacting with an arbitrary environment. This condition has two components: the first is state-independent, reflecting the structure of invariant subspaces, like energy shells, and the relative sizes of system and environment; the second depends on the initial correlations between reference, system and environment, measured in terms of conditional entropies. Intuitively, a small system interacting with a large environment is likely to thermalize relative to a reference, but only if, initially, the reference was not highly correlated with the system and environment. Our statement makes this intuition precise, and we show that in many natural settings this thermalization condition is approximately tight. Established results on thermalization, which usually ignore the reference, follow as special cases of our statements.

quant-ph↗

arXiv2013

A Monogamy-of-Entanglement Game With Applications to Device-Independent Quantum Cryptography

We consider a game in which two separate laboratories collaborate to prepare a quantum system and are then asked to guess the outcome of a measurement performed by a third party in a random basis on that system. Intuitively, by the uncertainty principle and the monogamy of entanglement, the probability that both players simultaneously succeed in guessing the outcome correctly is bounded. We are interested in the question of how the success probability scales when many such games are performed in parallel. We show that any strategy that maximizes the probability to win every game individually is also optimal for the parallel repetition of the game. Our result implies that the optimal guessing probability can be achieved without the use of entanglement. We explore several applications of this result. First, we show that it implies security for standard BB84 quantum key distribution when the receiving party uses fully untrusted measurement devices, i.e. we show that BB84 is one-sided device independent. Second, we show how our result can be used to prove security of a one-round position-verification scheme. Finally, we generalize a well-known uncertainty relation for the guessing probability to quantum side information.

quant-ph↗

arXiv2013

Secure bit commitment from relativistic constraints

We investigate two-party cryptographic protocols that are secure under assumptions motivated by physics, namely relativistic assumptions (no-signalling) and quantum mechanics. In particular, we discuss the security of bit commitment in so-called split models, i.e. models in which at least some of the parties are not allowed to communicate during certain phases of the protocol. We find the minimal splits that are necessary to evade the Mayers-Lo-Chau no-go argument and present protocols that achieve security in these split models. Furthermore, we introduce the notion of local versus global command, a subtle issue that arises when the split committer is required to delegate non-communicating agents to open the commitment. We argue that classical protocols are insecure under global command in the split model we consider. On the other hand, we provide a rigorous security proof in the global command model for Kent's quantum protocol [Kent 2011, Unconditionally Secure Bit Commitment by Transmitting Measurement Outcomes]. The proof employs two fundamental principles of modern physics, the no-signalling property of relativity and the uncertainty principle of quantum mechanics.

quant-ph↗

arXiv2013

If no information gain implies no disturbance, then any discrete physical theory is classical

It has been suggested that nature could be discrete in the sense that the underlying state space of a physical system has only a finite number of pure states. For example, the Bloch ball of a single qubit could be discretized into small patches and only appear round to us due to experimental limitations. Here, we present a strong physical argument for the quantum theoretical property that every state space (even the smallest possible one, the qubit) has infinitely many pure states. We propose a simple physical postulate which dictates that in fact the only possible discrete theory is classical mechanics. More specifically, we postulate that no information gain implies no disturbance, or read in the contrapositive, that disturbance leads to some form of information gain. In a theory like quantum mechanics where we already know that the converse holds, i.e. information gain does imply disturbance, this can be understood as postulating an equivalence between disturbance and information gain. What is more, we show that non-classical discrete theories are still ruled out even if we relax the postulate to hold only approximately in the sense that no information gain only causes a small amount of disturbance. Finally, our postulate also rules out popular generalizations such as the PR-box that allows non-local correlations beyond the limits of quantum theory.

quant-ph↗

arXiv2013

Entanglement improves classical control

Electronic devices all around us contain classical control circuits. Such circuits consist of a network of controllers which can read and write signals to wires of the circuit with the goal to minimize the cost function of the circuit's output signal. Here, we propose the use of shared entanglement between controllers as a resource to improve the performance of otherwise purely classical control circuits. We study a well-known example from the classical control literature and demonstrate that allowing two controllers to share entanglement improves their ability to control. More precisely, we exhibit a family of circuits in which the the cost function using entanglement stays constant, but the minimal cost function without entanglement grows arbitrarily large. This demonstrates that entanglement can be a powerful resource in a classical control circuit.

quant-ph↗

arXiv2013

Convergence of SDP hierarchies for polynomial optimization on the hypersphere

We show how to bound the accuracy of a family of semi-definite programming relaxations for the problem of polynomial optimization on the hypersphere. Our method is inspired by a set of results from quantum information known as quantum de Finetti theorems. In particular, we prove a de Finetti theorem for a special class of real symmetric matrices to establish the existence of approximate representing measures for moment matrix relaxations.

math.OC↗

arXiv2013

Reference frame agreement in quantum networks

In order to communicate information in a quantum network effectively, all network nodes should share a common reference frame. Here, we propose to study how well m nodes in a quantum network can establish a common reference frame from scratch, even though t of them may be arbitrarily faulty. We present a protocol that allows all correctly functioning nodes to agree on a common reference frame as long as not more than t < m/3 nodes are faulty. Our protocol furthermore has the appealing property that it allows any existing two-party protocol for reference frame agreement to be lifted to a protocol for a quantum network.

quant-ph↗

arXiv2013

Computability limits non-local correlations

If the no-signalling principle was the only limit to the strength of non-local correlations, we would expect that any form of no-signalling correlation can indeed be realized. That is, there exists a state and measurements that remote parties can implement to obtain any such correlation. Here, we show that in any theory in which some functions cannot be computed, there must be further limits to non-local correlations than the no-signalling principle alone. We proceed to argue that even in a theory such as quantum mechanics in which non-local correlations are already weaker, the question of computability imposes such limits.

quant-ph↗

arXiv2013

Dependence of a quantum mechanical system on its own initial state and the initial state of the environment it interacts with

We present a unifying framework to the understanding of when and how quantum mechanical systems become independent of their initial conditions and adapt macroscopic properties (like temperature) of the environment.By viewing this problem from an quantum information theory perspective, we are able to simplify it in a very natural and easy way. We first show that for any interaction between the system and the environment, and almost all initial states of the system, the question of how long the system retains memory of its initial conditions can be answered by studying the temporal evolution of just one special initial state. This special state thereby depends only on our knowledge of macroscopic parameters of the system. We provide a simple entropic inequality for this state that can be used to determine whether mosts states of the system have, or have not become independent of their initial conditions after time $t$. We discuss applications of our entropic criterion to thermalization times in systems with an effective light-cone and to quantum memories suffering depolarizing noise. We make a similar statement for almost all initial states of the environment, and finally provide a sufficient condition for which a system never thermalizes, but remains close to its initial state for all times.

quant-ph↗

arXiv2012

Multipartite entanglement verification resistant against dishonest parties

Future quantum information networks will likely consist of quantum and classical agents, who have the ability to communicate in a variety of ways with trusted and untrusted parties and securely delegate computational tasks to untrusted large-scale quantum computing servers. Multipartite quantum entanglement is a fundamental resource for such a network and hence it is imperative to study the possibility of verifying a multipartite entanglement source in a way that is efficient and provides strong guarantees even in the presence of multiple dishonest parties. In this work, we show how an agent of a quantum network can perform a distributed verification of a multipartite entangled source with minimal resources, which is, nevertheless, resistant against any number of dishonest parties. Moreover, we provide a tight tradeoff between the level of security and the distance between the state produced by the source and the ideal maximally entangled state. Last, by adding the resource of a trusted common random source, we can further provide security guarantees for all honest parties in the quantum network simultaneously.

quant-ph↗

arXiv2012

A violation of the uncertainty principle implies a violation of the second law of thermodynamics

Uncertainty relations state that there exist certain incompatible measurements, to which the outcomes cannot be simultaneously predicted. While the exact incompatibility of quantum measurements dictated by such uncertainty relations can be inferred from the mathematical formalism of quantum theory, the question remains whether there is any more fundamental reason for the uncertainty relations to have this exact form. What, if any, would be the operational consequences if we were able to go beyond any of these uncertainty relations? We give a strong argument that justifies uncertainty relations in quantum theory by showing that violating them implies that it is also possible to violate the second law of thermodynamics. More precisely, we show that violating the uncertainty relations in quantum mechanics leads to a thermodynamic cycle with positive net work gain, which is very unlikely to exist in nature.

quant-ph↗

arXiv2012

Quantum to Classical Randomness Extractors

The goal of randomness extraction is to distill (almost) perfect randomness from a weak source of randomness. When the source yields a classical string X, many extractor constructions are known. Yet, when considering a physical randomness source, X is itself ultimately the result of a measurement on an underlying quantum system. When characterizing the power of a source to supply randomness it is hence a natural question to ask, how much classical randomness we can extract from a quantum system. To tackle this question we here take on the study of quantum-to-classical randomness extractors (QC-extractors). We provide constructions of QC-extractors based on measurements in a full set of mutually unbiased bases (MUBs), and certain single qubit measurements. As the first application, we show that any QC-extractor gives rise to entropic uncertainty relations with respect to quantum side information. Such relations were previously only known for two measurements. As the second application, we resolve the central open question in the noisy-storage model [Wehner et al., PRL 100, 220502 (2008)] by linking security to the quantum capacity of the adversary's storage device.

quant-ph↗

arXiv2012

Almost All Quantum States Have Low Entropy Rates for Any Coupling to the Environment

The joint state of a system that is in contact with an environment is called lazy, if the entropy rate of the system under any coupling to the environment is zero. Necessary and sufficient conditions have recently been established for a state to be lazy [ Phys. Rev. Lett. 106 050403 (2011)], and it was shown that almost all states of the system and the environment do not have this property [ Phys. Rev. A 81 052318 (2010)]. At first glance, this may lead us to believe that low entropy rates themselves form an exception, in the sense that most states are far from being lazy and have high entropy rates. Here, we show that in fact the opposite is true if the environment is sufficiently large. Almost all states of the system and the environment are pretty lazy-their entropy rates are low for any coupling to the environment.

quant-ph↗

arXiv2011

Unconditional security from noisy quantum storage

We consider the implementation of two-party cryptographic primitives based on the sole assumption that no large-scale reliable quantum storage is available to the cheating party. We construct novel protocols for oblivious transfer and bit commitment, and prove that realistic noise levels provide security even against the most general attack. Such unconditional results were previously only known in the so-called bounded-storage model which is a special case of our setting. Our protocols can be implemented with present-day hardware used for quantum key distribution. In particular, no quantum storage is required for the honest parties.

quant-ph↗

arXiv2011

A time-dependent Tsirelson's bound from limits on the rate of information gain in quantum systems

We consider the problem of distinguishing between a set of arbitrary quantum states in a setting in which the time available to perform the measurement is limited. We provide simple upper bounds on how well we can perform state discrimination in a given time as a function of either the average energy or the range of energies available during the measurement. We exhibit a specific strategy that nearly attains this bound. Finally, we consider several applications of our result. First, we obtain a time-dependent Tsirelson's bound that limits the extent of the Bell inequality violation that can be in principle be demonstrated in a given time t. Second, we obtain a Margolus-Levitin type bound when considering the special case of distinguishing orthogonal pure states.

quant-ph↗

arXiv2011

Achieving the physical limits of the bounded-storage model

Secure two-party cryptography is possible if the adversary's quantum storage device suffers imperfections. For example, security can be achieved if the adversary can store strictly less then half of the qubits transmitted during the protocol. This special case is known as the bounded-storage model, and it has long been an open question whether security can still be achieved if the adversary's storage were any larger. Here, we answer this question positively and demonstrate a two-party protocol which is secure as long as the adversary cannot store even a small fraction of the transmitted pulses. We also show that security can be extended to a larger class of noisy quantum memories.

quant-ph↗

arXiv2011

Does ignorance of the whole imply ignorance of the parts? - Large violations of non-contextuality in quantum theory

A central question in our understanding of the physical world is how our knowledge of the whole relates to our knowledge of the individual parts. One aspect of this question is the following: to what extent does ignorance about a whole preclude knowledge of at least one of its parts? Relying purely on classical intuition, one would certainly be inclined to conjecture that a strong ignorance of the whole cannot come without significant ignorance of at least one of its parts. Indeed, we show that this reasoning holds in any non-contextual hidden variable model (NC-HV). Curiously, however, such a conjecture is \emph{false} in quantum theory: we provide an explicit example where a large ignorance about the whole can coexist with an almost perfect knowledge of each of its parts. More specifically, we provide a simple information-theoretic inequality satisfied in any NC-HV, but which can be \emph{arbitrarily} violated by quantum mechanics. Our inequality has interesting implications for quantum cryptography.

quant-ph↗

arXiv2011

A transform of complementary aspects with applications to entropic uncertainty relations

Even though mutually unbiased bases and entropic uncertainty relations play an important role in quantum cryptographic protocols they remain ill understood. Here, we construct special sets of up to 2n+1 mutually unbiased bases (MUBs) in dimension d=2^n which have particularly beautiful symmetry properties derived from the Clifford algebra. More precisely, we show that there exists a unitary transformation that cyclically permutes such bases. This unitary can be understood as a generalization of the Fourier transform, which exchanges two MUBs, to multiple complementary aspects. We proceed to prove a lower bound for min-entropic entropic uncertainty relations for any set of MUBs, and show that symmetry plays a central role in obtaining tight bounds. For example, we obtain for the first time a tight bound for four MUBs in dimension d=4, which is attained by an eigenstate of our complementarity transform. Finally, we discuss the relation to other symmetries obtained by transformations in discrete phase space, and note that the extrema of discrete Wigner functions are directly related to min-entropic uncertainty relations for MUBs.

quant-ph↗