SearcharxivSearch

arXiv subjects

Jonathan Barrett

Publications and source records attributed to Jonathan Barrett.

At least 37 records · Page 2Linked to original sources

Entropy, majorization and thermodynamics in general probabilistic theories

In this note we lay some groundwork for the resource theory of thermodynamics in general probabilistic theories (GPTs). We consider theories satisfying a purely convex abstraction of the spectral decomposition of density matrices: that every state has a decomposition, with unique probabilities, into perfectly distinguishable pure states. The spectral entropy, and analogues using other Schur-concave functions, can be defined as the entropy of these probabilities. We describe additional conditions under which the outcome probabilities of a fine-grained measurement are majorized by those for a spectral measurement, and therefore the "spectral entropy" is the measurement entropy (and therefore concave). These conditions are (1) projectivity, which abstracts aspects of the Lueders-von Neumann projection postulate in quantum theory, in particular that every face of the state space is the positive part of the image of a certain kind of projection operator called a filter; and (2) symmetry of transition probabilities. The conjunction of these, as shown earlier by Araki, is equivalent to a strong geometric property of the unnormalized state cone known as perfection: that there is an inner product according to which every face of the cone, including the cone itself, is self-dual. Using some assumptions about the thermodynamic cost of certain processes that are partially motivated by our postulates, especially projectivity, we extend von Neumann's argument that the thermodynamic entropy of a quantum system is its spectral entropy to generalized probabilistic systems satisfying spectrality.

quant-ph

Computation in generalised probabilistic theories

From the existence of an efficient quantum algorithm for factoring, it is likely that quantum computation is intrinsically more powerful than classical computation. At present, the best upper bound known for the power of quantum computation is that BQP is in AWPP. This work investigates limits on computational power that are imposed by physical principles. To this end, we define a circuit-based model of computation in a class of operationally-defined theories more general than quantum theory, and ask: what is the minimal set of physical assumptions under which the above inclusion still holds? We show that given only an assumption of tomographic locality (roughly, that multipartite states can be characterised by local measurements), efficient computations are contained in AWPP. This inclusion still holds even without assuming a basic notion of causality (where the notion is, roughly, that probabilities for outcomes cannot depend on future measurement choices). Following Aaronson, we extend the computational model by allowing post-selection on measurement outcomes. Aaronson showed that the corresponding quantum complexity class is equal to PP. Given only the assumption of tomographic locality, the inclusion in PP still holds for post-selected computation in general theories. Thus in a world with post-selection, quantum theory is optimal for computation in the space of all general theories. We then consider if relativised complexity results can be obtained for general theories. It is not clear how to define a sensible notion of an oracle in the general framework that reduces to the standard notion in the quantum case. Nevertheless, it is possible to define computation relative to a `classical oracle'. Then, we show there exists a classical oracle relative to which efficient computation in any theory satisfying the causality assumption and tomographic locality does not include NP.

quant-ph

No $ψ$-epistemic model can fully explain the indistinguishability of quantum states

According to a recent no-go theorem (M. Pusey, J. Barrett and T. Rudolph, Nature Physics 8, 475 (2012)), models in which quantum states correspond to probability distributions over the values of some underlying physical variables must have the following feature: the distributions corresponding to distinct quantum states do not overlap. This is significant because if the distributions do not overlap, then the quantum state itself is encoded by the physical variables. In such a model, it cannot coherently be maintained that the quantum state merely encodes information about underlying physical variables. The theorem, however, considers only models in which the physical variables corresponding to independently prepared systems are independent. This work considers models that are defined for a single quantum system of dimension $d$, such that the independence condition does not arise. We prove a result in a similar spirit to the original no-go theorem, in the form of an upper bound on the extent to which the probability distributions can overlap, consistently with reproducing quantum predictions. In particular, models in which the quantum overlap between pure states is equal to the classical overlap between the corresponding probability distributions cannot reproduce the quantum predictions in any dimension $d \geq 3$. The result is noise tolerant, and an experiment is motivated to distinguish the class of models ruled out from quantum theory.

quant-ph

Memory Attacks on Device-Independent Quantum Cryptography

Device-independent quantum cryptographic schemes aim to guarantee security to users based only on the output statistics of any components used, and without the need to verify their internal functionality. Since this would protect users against untrustworthy or incompetent manufacturers, sabotage or device degradation, this idea has excited much interest, and many device-independent schemes have been proposed. Here we identify a critical weakness of device-independent protocols that rely on public communication between secure laboratories. Untrusted devices may record their inputs and outputs and reveal information about them via publicly discussed outputs during later runs. Reusing devices thus compromises the security of a protocol and risks leaking secret data. Possible defences include securely destroying or isolating used devices. However, these are costly and often impractical. We propose other more practical partial defences as well as a new protocol structure for device-independent quantum key distribution that aims to achieve composable security in the case of two parties using a small number of devices to repeatedly share keys with each another (and no other party).

quant-ph

The definition of multipartite nonlocality

In a multipartite setting, it is possible to distinguish quantum states that are genuinely $n$-way entangled from those that are separable with respect to some bipartition. Similarly, the nonlocal correlations that can arise from measurements on entangled states can be classified into those that are genuinely $n$-way nonlocal, and those that are local with respect to some bipartition. Svetlichny introduced an inequality intended as a test for genuine tripartite nonlocality. This work introduces two alternative definitions of $n$-way nonlocality, which we argue are better motivated both from the point of view of the study of nature, and from the point of view of quantum information theory. We show that these definitions are strictly weaker than Svetlichny's, and introduce a series of suitable Bell-type inequalities for the detection of 3-way nonlocality. Numerical evidence suggests that all 3-way entangled pure quantum states can produce 3-way nonlocal correlations.

quant-ph

Distinct Quantum States Can Be Compatible with a Single State of Reality

Perhaps the quantum state represents information about reality, and not reality directly. Wave function collapse is then possibly no more mysterious than a Bayesian update of a probability distribution given new data. We consider models for quantum systems with measurement outcomes determined by an underlying physical state of the system but where several quantum states are consistent with a single underlying state---i.e., probability distributions for distinct quantum states overlap. Significantly, we demonstrate by example that additional assumptions are always necessary to rule out such a model.

quant-ph

On the reality of the quantum state

Quantum states are the key mathematical objects in quantum theory. It is therefore surprising that physicists have been unable to agree on what a quantum state truly represents. One possibility is that a pure quantum state corresponds directly to reality. However, there is a long history of suggestions that a quantum state (even a pure state) represents only knowledge or information about some aspect of reality. Here we show that any model in which a quantum state represents mere information about an underlying physical state of the system, and in which systems that are prepared independently have independent physical states, must make predictions which contradict those of quantum theory.

quant-ph

Can different quantum state vectors correspond to the same physical state? An experimental test

A century on from the development of quantum theory, the interpretation of a quantum state is still discussed. If a physicist claims to have produced a system with a particular wave function, does this represent directly a physical wave of some kind, or is the wave function merely a summary of knowledge, or information, about the system? A recent no-go theorem shows that models in which the wave function is not physical, but corresponds only to an experimenter's information about a hypothetical real state of the system, must make different predictions from quantum theory when a certain test is carried out. Here we report on an experimental implementation using trapped ions. Within experimental error, the results confirm quantum theory. We analyse which kinds of theories are ruled out.

quant-ph

Unconditionally secure device-independent quantum key distribution with only two devices

Device-independent quantum key distribution is the task of using uncharacterized quantum devices to establish a shared key between two users. If a protocol is secure regardless of the device behaviour, it can be used to generate a shared key even if the supplier of the devices is malicious. To date, all device-independent quantum key distribution protocols that are known to be secure require separate isolated devices for each entangled pair, which is a significant practical limitation. We introduce a protocol that requires Alice and Bob to have only one device each. Although inefficient, our protocol is unconditionally secure against an adversarial supplier limited only by locally enforced signalling constraints.

quant-ph

Limits on non-local correlations from the structure of the local state space

The outcomes of measurements on entangled quantum systems can be nonlocally correlated. However, while it is easy to write down toy theories allowing arbitrary nonlocal correlations, those allowed in quantum mechanics are limited. Quantum correlations cannot, for example, violate a principle known as macroscopic locality, which implies that they cannot violate Tsirelson's bound. This work shows that there is a connection between the strength of nonlocal correlations in a physical theory, and the structure of the state spaces of individual systems. This is illustrated by a family of models in which local state spaces are regular polygons, where a natural analogue of a maximally entangled state of two systems exists. We characterize the nonlocal correlations obtainable from such states. The family allows us to study the transition between classical, quantum, and super-quantum correlations, by varying only the local state space. We show that the strength of nonlocal correlations - in particular whether the maximally entangled state violates Tsirelson's bound or not - depends crucially on a simple geometric property of the local state space, known as strong self-duality. This result is seen to be a special case of a general theorem, which states that a broad class of entangled states in probabilistic theories - including, by extension, all bipartite classical and quantum states - cannot violate macroscopic locality. Finally, our results show that there exist models which are locally almost indistinguishable from quantum mechanics, but can nevertheless generate maximally nonlocal correlations.

quant-ph

How much measurement independence is needed in order to demonstrate nonlocality?

If nonlocality is to be inferred from a violation of Bell's inequality, an important assumption is that the measurement settings are freely chosen by the observers, or alternatively, that they are random and uncorrelated with the hypothetical local variables. We study the case where this assumption is weakened, so that measurement settings and local variables are at least partially correlated. As we show, there is a connection between this type of model and models which reproduce nonlocal correlations by allowing classical communication between the distant parties, and a connection with models that exploit the detection loophole. We show that even if Bob's choices are completely independent, all correlations obtained from projective measurements on a singlet can be reproduced, with the correlation (measured by mutual information) between Alice's choice and local variables less than or equal to a single bit.

quant-ph

Strong nonlocality: A trade-off between states and measurements

Measurements on entangled quantum states can produce outcomes that are nonlocally correlated. But according to Tsirelson's theorem, there is a quantitative limit on quantum nonlocality. It is interesting to explore what would happen if Tsirelson's bound were violated. To this end, we consider a model that allows arbitrary nonlocal correlations, colloquially referred to as "box world". We show that while box world allows more highly entangled states than quantum theory, measurements in box world are rather limited. As a consequence there is no entanglement swapping, teleportation or dense coding.

quant-ph

Entropy and Information Causality in General Probabilistic Theories

We investigate the concept of entropy in probabilistic theories more general than quantum mechanics, with particular reference to the notion of information causality recently proposed by Pawlowski et. al. (arXiv:0905.2992). We consider two entropic quantities, which we term measurement and mixing entropy. In classical and quantum theory, they are equal, being given by the Shannon and von Neumann entropies respectively; in general, however, they are very different. In particular, while measurement entropy is easily seen to be concave, mixing entropy need not be. In fact, as we show, mixing entropy is not concave whenever the state space is a non-simplicial polytope. Thus, the condition that measurement and mixing entropies coincide is a strong constraint on possible theories. We call theories with this property monoentropic. Measurement entropy is subadditive, but not in general strongly subadditive. Equivalently, if we define the mutual information between two systems A and B by the usual formula I(A:B) = H(A) + H(B) - H(AB) where H denotes the measurement entropy and AB is a non-signaling composite of A and B, then it can happen that I(A:BC) < I(A:B). This is relevant to information causality in the sense of Pawlowski et al.: we show that any monoentropic non-signaling theory in which measurement entropy is strongly subadditive, and also satisfies a version of the Holevo bound, is informationally causal, and on the other hand we observe that Popescu-Rohrlich boxes, which violate information causality, also violate strong subadditivity. We also explore the interplay between measurement and mixing entropy and various natural conditions on theories that arise in quantum axiomatics.

quant-ph

The de Finetti theorem for test spaces

We prove a de Finetti theorem for exchangeable sequences of states on test spaces, where a test space is a generalization of the sample space of classical probability theory and the Hilbert space of quantum theory. The standard classical and quantum de Finetti theorems are obtained as special cases. By working in a test space framework, the common features that are responsible for the existence of these theorems are elucidated. In addition, the test space framework is general enough to imply a de Finetti theorem for classical processes. We conclude by discussing the ways in which our assumptions may fail, leading to probabilistic models that do not have a de Finetti theorem.

quant-ph

Teleportation in General Probabilistic Theories

In a previous paper, we showed that many important quantum information-theoretic phenomena, including the no-cloning and no-broadcasting theorems, are in fact generic in all non-classical probabilistic theories. An exception is teleportation, which most such theories do not support. In this paper, we investigate which probabilistic theories, and more particularly, which composite systems, {\em do} support a teleportation protocol. We isolate a natural class of composite systems that we term {\em regular}, and establish necessary and sufficient conditions for a regular tripartite system to support a conclusive, or post-selected, teleportation protocol. We also establish a sufficient condition for deterministic teleportation that yields a large supply of theories, neither classical nor quantum, that support such a protocol.

quant-ph

Noise robustness of the nonlocality of entangled quantum states

We study the nonlocal properties of states resulting from the mixture of an arbitrary entangled state rho of two d-dimensional systems and completely depolarized noise, with respective weights p and 1-p. We first construct a local model for the case in which rho is maximally entangled and p at or below a certain bound. We then extend the model to arbitrary rho. Our results provide bounds on the resistance to noise of the nonlocal correlations of entangled states. For projective measurements, the critical value of the noise parameter p for which the state becomes local is at least asymptotically log(d) larger than the critical value for separability.

quant-ph

A generalized no-broadcasting theorem

We prove a generalized version of the no-broadcasting theorem, applicable to essentially \emph{any} nonclassical finite-dimensional probabilistic model satisfying a no-signaling criterion, including ones with ``super-quantum'' correlations. A strengthened version of the quantum no-broadcasting theorem follows, and its proof is significantly simpler than existing proofs of the no-broadcasting theorem.

quant-ph

Information processing in generalized probabilistic theories

I introduce a framework in which a variety of probabilistic theories can be defined, including classical and quantum theories, and many others. From two simple assumptions, a tensor product rule for combining separate systems can be derived. Certain features, usually thought of as specifically quantum, turn out to be generic in this framework, meaning that they are present in all except classical theories. These include the non-unique decomposition of a mixed state into pure states, a theorem involving disturbance of a system on measurement (suggesting that the possibility of secure key distribution is generic), and a no-cloning theorem. Two particular theories are then investigated in detail, for the sake of comparison with the classical and quantum cases. One of these includes states that can give rise to arbitrary non-signalling correlations, including the super-quantum correlations that have become known in the literature as Nonlocal Machines or Popescu-Rohrlich boxes. By investigating these correlations in the context of a theory with well-defined dynamics, I hope to make further progress with a question raised by Popescu and Rohrlich, which is, why does quantum theory not allow these strongly nonlocal correlations? The existence of such correlations forces much of the dynamics in this theory to be, in a certain sense, classical, with consequences for teleportation, cryptography and computation. I also investigate another theory in which all states are local. Finally, I raise the question of what further axiom(s) could be added to the framework in order uniquely to identify quantum theory, and hypothesize that quantum theory is optimal for computation.

quant-ph