arXiv subjects

Roger Colbeck

Publications and source records attributed to Roger Colbeck.

At least 55 records · Page 3Linked to original sources

arXiv2013

Free randomness can be amplified

Are there fundamentally random processes in nature? Theoretical predictions, confirmed experimentally, such as the violation of Bell inequalities, point to an affirmative answer. However, these results are based on the assumption that measurement settings can be chosen freely at random, so assume the existence of perfectly free random processes from the outset. Here we consider a scenario in which this assumption is weakened and show that partially free random bits can be amplified to make arbitrarily free ones. More precisely, given a source of random bits whose correlation with other variables is below a certain threshold, we propose a procedure for generating fresh random bits that are virtually uncorrelated with all other variables. We also conjecture that such procedures exist for any non-trivial threshold. Our result is based solely on the no-signalling principle, which is necessary for the existence of free randomness.

quant-ph↗

arXiv2013

A short note on the concept of free choice

We argue that the concepts of "freedom of choice" and of "causal order" are intrinsically linked: a choice is considered "free" if it is correlated only to variables in its causal future. We discuss the implications of this to Bell-type scenarios, where two separate measurements are carried out, neither of which lies in the causal future of the other, and where one typically assumes that the measurement settings are chosen freely. Furthermore, we refute a recent criticism made by Ghirardi and Romano in [arXiv:1301.5040] and [arXiv:1302.1635] that we used an unphysical freedom of choice assumption in our previous works, [Nat. Commun. 2, 411 (2011)] and [Phys. Rev. Lett. 108, 150402 (2012)].

quant-ph↗

arXiv2012

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↗

arXiv2012

Uncertainty relations from simple entropic properties

Uncertainty relations provide constraints on how well the outcomes of incompatible measurements can be predicted, and, as well as being fundamental to our understanding of quantum theory, they have practical applications such as for cryptography and witnessing entanglement. Here we shed new light on the entropic form of these relations, showing that they follow from a few simple entropic properties, including the data processing inequality. We prove these relations without relying on the exact expression for the entropy, and hence show that a single technique applies to several entropic quantities, including the von Neumann entropy, min- and max-entropies and the Renyi entropies.

quant-ph↗

arXiv2012

Is a system's wave function in one-to-one correspondence with its elements of reality?

Although quantum mechanics is one of our most successful physical theories, there has been a long-standing debate about the interpretation of the wave function---the central object of the theory. Two prominent views are that (i) it corresponds to an element of reality, i.e. an objective attribute that exists before measurement, and (ii) it is a subjective state of knowledge about some underlying reality. A recent result [Pusey et al. arXiv:1111.3328] has placed the subjective interpretation into doubt, showing that it would contradict certain physically plausible assumptions, in particular that multiple systems can be prepared such that their elements of reality are uncorrelated. Here we show, based only on the assumption that measurement settings can be chosen freely, that a system's wave function is in one-to-one correspondence with its elements of reality. This also eliminates the possibility that it can be interpreted subjectively.

quant-ph↗

arXiv2011

No extension of quantum theory can have improved predictive power

According to quantum theory, measurements generate random outcomes, in stark contrast with classical mechanics. This raises the question of whether there could exist an extension of the theory which removes this indeterminism, as suspected by Einstein, Podolsky and Rosen (EPR). Although this has been shown to be impossible, existing results do not imply that the current theory is maximally informative. Here we ask the more general question of whether any improved predictions can be achieved by any extension of quantum theory. Under the assumption that measurements can be chosen freely, we answer this question in the negative: no extension of quantum theory can give more information about the outcomes of future measurements than quantum theory itself. Our result has significance for the foundations of quantum mechanics, as well as applications to tasks that exploit the inherent randomness in quantum theory, such as quantum cryptography.

quant-ph↗

arXiv2011

An experimental test of all theories with predictive power beyond quantum theory

According to quantum theory, the outcomes of future measurements cannot (in general) be predicted with certainty. In some cases, even with a complete physical description of the system to be measured and the measurement apparatus, the outcomes of certain measurements are completely random. This raises the question, originating in the paper by Einstein, Podolsky and Rosen, of whether quantum mechanics is the optimal way to predict measurement outcomes. Established arguments and experimental tests exclude a few specific alternative models. Here, we provide a complete answer to the above question, refuting any alternative theory with significantly more predictive power than quantum theory. More precisely, we perform various measurements on distant entangled photons, and, under the assumption that these measurements are chosen freely, we give an upper bound on how well any alternative theory could predict their outcomes. In particular, in the case where quantum mechanics predicts two equally likely outcomes, our results are incompatible with any theory in which the probability of a prediction is increased by more than ~0.19. Hence, we can immediately refute any already considered or yet-to-be-proposed alternative model with more predictive power than this.

quant-ph↗

arXiv2011

Quantum And Relativistic Protocols For Secure Multi-Party Computation

After a general introduction, the thesis is divided into four parts. In the first, we discuss the task of coin tossing, principally in order to highlight the effect different physical theories have on security in a straightforward manner, but, also, to introduce a new protocol for non-relativistic strong coin tossing. This protocol matches the security of the best protocol known to date while using a conceptually different approach to achieve the task. In the second part variable bias coin tossing is introduced. This is a variant of coin tossing in which one party secretly chooses one of two biased coins to toss. It is shown that this can be achieved with unconditional security for a specified range of biases, and with cheat-evident security for any bias. We also discuss two further protocols which are conjectured to be unconditionally secure for any bias. The third section looks at other two-party secure computations for which, prior to our work, protocols and no-go theorems were unknown. We introduce a general model for such computations, and show that, within this model, a wide range of functions are impossible to compute securely. We give explicit cheating attacks for such functions. In the final chapter we discuss the task of expanding a private random string, while dropping the usual assumption that the protocol's user trusts her devices. Instead we assume that all quantum devices are supplied by an arbitrarily malicious adversary. We give two protocols that we conjecture securely perform this task. The first allows a private random string to be expanded by a finite amount, while the second generates an arbitrarily large expansion of such a string.

quant-ph↗

arXiv2011

The Uncertainty Principle in the Presence of Quantum Memory

The uncertainty principle, originally formulated by Heisenberg, dramatically illustrates the difference between classical and quantum mechanics. The principle bounds the uncertainties about the outcomes of two incompatible measurements, such as position and momentum, on a particle. It implies that one cannot predict the outcomes for both possible choices of measurement to arbitrary precision, even if information about the preparation of the particle is available in a classical memory. However, if the particle is prepared entangled with a quantum memory, a device which is likely to soon be available, it is possible to predict the outcomes for both measurement choices precisely. In this work we strengthen the uncertainty principle to incorporate this case, providing a lower bound on the uncertainties which depends on the amount of entanglement between the particle and the quantum memory. We detail the application of our result to witnessing entanglement and to quantum key distribution.

quant-ph↗

arXiv2011

Private Randomness Expansion With Untrusted Devices

Randomness is an important resource for many applications, from gambling to secure communication. However, guaranteeing that the output from a candidate random source could not have been predicted by an outside party is a challenging task, and many supposedly random sources used today provide no such guarantee. Quantum solutions to this problem exist, for example a device which internally sends a photon through a beam-splitter and observes on which side it emerges, but, presently, such solutions require the user to trust the internal workings of the device. Here we seek to go beyond this limitation by asking whether randomness can be generated using untrusted devices---even ones created by an adversarial agent---while providing a guarantee that no outside party (including the agent) can predict it. Since this is easily seen to be impossible unless the user has an initially private random string, the task we investigate here is private randomness expansion. We introduce a protocol for private randomness expansion with untrusted devices which is designed to take as input an initially private random string and produce as output a longer private random string. We point out that private randomness expansion protocols are generally vulnerable to attacks that can render the initial string partially insecure, even though that string is used only inside a secure laboratory; our protocol is designed to remove this previously unconsidered vulnerability by privacy amplification. We also discuss extensions of our protocol designed to generate an arbitrarily long random string from a finite initially private random string. The security of these protocols against the most general attacks is left as an open question.

quant-ph↗

arXiv2010

Experimental investigation of the uncertainty principle in the presence of quantum memory

Heisenberg's uncertainty principle provides a fundamental limitation on an observer's ability to simultaneously predict the outcome when one of two measurements is performed on a quantum system. However, if the observer has access to a particle (stored in a quantum memory) which is entangled with the system, his uncertainty is generally reduced. This effect has recently been quantified by Berta et al. [Nature Physics 6, 659 (2010)] in a new, more general uncertainty relation, formulated in terms of entropies. Using entangled photon pairs, an optical delay line serving as a quantum memory and fast, active feed-forward we experimentally probe the validity of this new relation. The behaviour we find agrees with the predictions of quantum theory and satisfies the new uncertainty relation. In particular, we find lower uncertainties about the measurement outcomes than would be possible without the entangled particle. This shows not only that the reduction in uncertainty enabled by entanglement can be significant in practice, but also demonstrates the use of the inequality to witness entanglement.

quant-ph↗

arXiv2010

Simple Channel Coding Bounds

New channel coding converse and achievability bounds are derived for a single use of an arbitrary channel. Both bounds are expressed using a quantity called the "smooth 0-divergence", which is a generalization of Renyi's divergence of order 0. The bounds are also studied in the limit of large block-lengths. In particular, they combine to give a general capacity formula which is equivalent to the one derived by Verdu and Han.

cs.IT↗

arXiv2010

All reversible dynamics in maximally non-local theories are trivial

A remarkable feature of quantum theory is non-locality (i.e. the presence of correlations which violate Bell inequalities). However, quantum correlations are not maximally non-local, and it is natural to ask whether there are compelling reasons for rejecting theories in which stronger violations are possible. To shed light on this question, we consider post-quantum theories in which maximally non-local states (non-local boxes) occur. It has previously been conjectured that the set of dynamical transformations possible in such theories is severely limited. We settle the question affirmatively in the case of reversible dynamics, by completely characterizing all such transformations allowed in this setting. We find that the dynamical group is trivial, in the sense that it is generated solely by local operations and permutations of systems. In particular, no correlations can ever be created; non-local boxes cannot be prepared from product states (in other words, no analogues of entangling unitary operations exist), and classical computers can efficiently simulate all such processes.

quant-ph↗

arXiv2010

Defining the local part of a hidden variable model: a comment

In [Physical Review Letters 101, 050403 (2008)], we showed that quantum theory cannot be explained by a hidden variable model with a non-trivial local part. The purpose of this comment is to clarify our notion of local part, which seems to have caused some confusion in the recent literature. This notion is based on Bell's and demands that local hidden variables are physical, the idea being that, if discovered, they would not contradict basic physical principles. We explain why the recent supposed "counterexamples" that have appeared are not counterexamples to our theorem--in fact they are based on a definition of local hidden variables which would allow signalling and is therefore not physical.

quant-ph↗

arXiv2009

Duality Between Smooth Min- and Max-Entropies

In classical and quantum information theory, operational quantities such as the amount of randomness that can be extracted from a given source or the amount of space needed to store given data are normally characterized by one of two entropy measures, called smooth min-entropy and smooth max-entropy, respectively. While both entropies are equal to the von Neumann entropy in certain special cases (e.g., asymptotically, for many independent repetitions of the given data), their values can differ arbitrarily in the general case. In this work, a recently discovered duality relation between (non-smooth) min- and max-entropies is extended to the smooth case. More precisely, it is shown that the smooth min-entropy of a system A conditioned on a system B equals the negative of the smooth max-entropy of A conditioned on a purifying system C. This result immediately implies that certain operational quantities (such as the amount of compression and the amount of randomness that can be extracted from given data) are related. Such relations may, for example, have applications in cryptographic security proofs.

quant-ph↗

arXiv2009

A Fully Quantum Asymptotic Equipartition Property

The classical asymptotic equipartition property is the statement that, in the limit of a large number of identical repetitions of a random experiment, the output sequence is virtually certain to come from the typical set, each member of which is almost equally likely. In this paper, we prove a fully quantum generalization of this property, where both the output of the experiment and side information are quantum. We give an explicit bound on the convergence, which is independent of the dimensionality of the side information. This naturally leads to a family of Renyi-like quantum conditional entropies, for which the von Neumann entropy emerges as a special case.

quant-ph↗

arXiv2008

Quantum Self-Correcting Stabilizer Codes

In this paper, we explicitly construct (Abelian) anyonic excitations of arbitrary stabilizer Hamiltonians which are local on a 2D lattice of qubits. This leads directly to the conclusion that, in the presence of local thermal noise, such systems cannot be used for the fault-tolerant storage of quantum information by self-correction i.e. they are ruled out as candidates for a `quantum hard drive'. We suggest that in 3D, the same construction leads to an argument that self-correction is impossible.

quant-ph↗

arXiv2008

Hidden variable models for quantum theory cannot have any local part

It was shown by Bell that no local hidden variable model is compatible with quantum mechanics. If, instead, one permits the hidden variables to be entirely non-local, then any quantum mechanical predictions can be recovered. In this paper, we consider general hidden variable models which can have both local and non-local parts. We then show the existence of (experimentally verifiable) quantum correlations that are incompatible with any hidden variable model having a non-trivial local part, such as the model proposed by Leggett.

quant-ph↗