Quantum Information

The one clean qubit model is a model of quantum computation in which all but one qubit starts in the maximally mixed state. One clean qubit computers are believed to be strictly weaker than standard quantum computers, but still capable of solving some classically intractable problems. I\'ll discuss my recent work in collaboration with Peter Shor which shows that evaluating a certain approximation to the Jones polynomial at a fifth root of unity for the trace closure of a braid is a complete problem for the one clean qubit complexity class.

We give a convenient representation for any map which is covariant with respect to an irreducible representation of SU(2), and use this representation to analyze the evolution of a quantum directional reference frame when it is exploited as a resource for performing quantum operations. We introduce the moments of a quantum reference frame, which serve as a complete description of its properties as a frame, and investigate how many times a quantum directional reference frame represented by a spin-j system can be used to perform a certain quantum operation with a given probability of success. We provide a considerable generalization of previous results on degradation of reference frame, from which follows a classification of the dynamics of spin-j system under the repeated action of any covariant map with respect to SU(2). Joint work with Lana Sheridan, Martin Laforest and Stephen Bartlett

Every restriction on quantum operations defines a resource theory, determining how quantum states that cannot be prepared under the restriction may be manipulated and used to circumvent the restriction. A superselection rule is a restriction that arises through the lack of a classical reference frame. The states that circumvent it (the resource) are quantum reference frames. We consider the resource theories that arise from three types of superselection rule, associated respectively with lacking: (i) a phase reference, (ii) a frame for chirality, and (iii) a frame for spatial orientation. Focussing on pure unipartite quantum states, we identify the necessary and sufficient conditions for a deterministic transformation between two resource states to be possible and, when these conditions are not met, the maximum probability with which the transformation can be achieved. We also determine when a particular transformation can be achieved reversibly in the limit of arbitrarily many copies and find the maximum rate of conversion. (joint work with Gilad Gour)

Entanglement plays a fundamental role in quantum information processing and is regarded as a valuable, fungible resource, The practical ability to transform (or manipulate) entanglement from one form to another is useful for many applications. Usually one considers entanglement manipulation of states which are multiple copies of a given bipartite entangled state and requires that the fidelity of the transformation to (or from) multiple copies of a maximally entangled state approaches unity asymptotically in the number of copies of the original state. The optimal rates of these protocols yield two asymptotic measures of entanglement, namely, entanglement cost and distillable entanglement. It is not always justified, however, to assume that the entanglement resource available, consists of states which are multiple copies, i.e.,tensor products, of a given entangled state. More generally, an entanglement resource is characterized by an arbitrary sequence of bipartite states which are not necessarily of the tensor product form. In this seminar, we address the issue of entanglement manipulation for such general resources and obtain expressions for the entanglement cost and distillable entanglement.

It is known that finite fields with d elements exist only when d is a prime or a prime power. When the dimension d of a finite dimensional Hilbert space is a prime power, we can associate to each basis state of the Hilbert space an element of a finite or Galois field, and construct a finite group of unitary transformations, the generalised Pauli group or discrete Heisenberg-Weyl group. Its elements can be expressed, in terms of the elements of a Galois field. This group presents numerous applications in Quantum Information Science e.g. tomography, dense coding, teleportation, error correction and so on. The aim of our talk is to give a general survey of these properties and to present recently obtained results in connection with three problems: -the so-called ''Mean King's problem'' in prime power dimension, -discrete Wigner distributions, -and quantum tomography . Finally we shall discuss a limitation of the possible dimensions in which the so-called epistemic interpretation can be consistently formulated, in relation with the existence of finite affine planes, Euler's conjecture and the 36 officers problem.

One of the cool, frustrating things about quantum theory is how the once-innocuous concept of "measurement" gets really complicated. I'd like to understand how we find out about the universe around us, and how to reconcile (a) everyday experience, (b) experiments on quantum systems, and (c) our theory of quantum measurements. In this talk, I'll try to braid three [apparently] separate research projects into the beginnings of an answer. I'll begin from the premise that you make a measurement to find something out, then attack some specific questions: "How do we find out about quantum systems?", "What can we find out about quantum systems?", and finally "What do we actually know, afterward?" I'll give precise statements of these questions, then present [partial] answers.

In this talk we discuss how large classes of classical spin models, such as the Ising and Potts models on arbitrary lattices, can be mapped to the graph state formalism. In particular, we show how the partition function of a spin model can be written as the overlap between a graph state and a complete product state. Here the graph state encodes the interaction pattern of the spin model---i.e., the lattice on which the model is defined---whereas the product state depends only on the couplings of the model, i.e., the interaction strengths. As main examples, we find that the 1D Ising model corresponds to the 1D cluster state, the 2D Ising model without external field is mapped to Kitaev's toric code state, and the 2D Ising model with external field corresponds to the 2D cluster state---but the mappings are completely general in that arbitrary graphs, and also q-state models can be treated. These mappings allow one to make connections between concepts in (classical) statistical mechanics and quantum information theory and to obtain a cross-fertilization between both fields. As a main application, we will prove that the classical Ising model on a 2D square lattice (with external field) is a "complete model", in the sense that the partition function of any other spin model---i.e., for q-state spins on arbitrary lattices---can be obtained as a special instance of the (q=2) 2D Ising partition function with suitably tuned (complex) couplings. This result is obtained by invoking the above mappings from spin models to graph states, and the property that the 2D cluster states are universal resource states for one-way quantum computation. Joint work with Wolfgang Duer and Hans Briegel, see PRL/ 98 117207 (2007)/ and quant-ph/0708.2275. For related work, see also S. Bravyi and R. Raussendorf, quant-ph/0610162.

In this talk, I describe some very simple but significant phenomena predicted by quantum theory. These are described simply in terms of what is observed in the laboratory, without making any presumptions about what sort of microscopic picture of reality might account for these observations. With these phenomena in hand, I demonstrate two simple applications of quantum theory to cryptography: how to build counterfeit-proof money and how to detect eavesdroppers on a channel (and thereby distribute a secret key which can be used to encode messages in a way that cannot be deciphered by one who does not have the key). Moving from quantum information theory to quantum foundations, I show how the qualitative features of these phenomena can be reproduced in a toy theory wherein systems have well-defined properties but observers can only come to know a limited amount about them. This shows the merits of the notion of \"hidden variables\" underlying quantum theory. Finally, I describe a phenomenon that is predicted by quantum theory but that *cannot* be reproduced by a natural class of hidden variable models, namely, those that are *local* in the sense that changes in one region cannot instantaneously affect the state of affairs in another. The phenomenon in question is the existence of certain strange correlations between the measurement outcomes on distant systems. It is illustrated in terms of a two-party game that is played out by a few lucky members of the audience.

The world at the size of individual atoms obeys very different laws of physics from those we are used to in the everyday world around us. Quantum mechanics rules, allowing atoms to be, in some sense, in more than one place at a time. Researchers all over the world are working to build \"quantum computers\" whose memories manipulate an inherently new type of information, \"quantum information.\" Quantum computers have capabilities impossible for a regular computer, no matter how advanced it may be, including the ability to run new kinds of computer programs capable of rapidly solving certain problems, and to make new highly secure codes for secret communication.

One simple way to think about physics is in terms of information. We gain information about physical systems by observing them, and with luck this data allows us to predict what they will do next. Quantum mechanics doesn\'t just change the rules about how physical objects behave - it changes the rules about how information behaves. In this talk we explore what quantum information is, and how strangely it differs from our intuitions. In particular we see how information about quantum particles can become entangled, leading to seemingly impossibly coordinated behaviour for separate objects.

The world at the size of individual atoms obeys very different laws of physics from those we are used to in the everyday world around us. Quantum mechanics rules, allowing atoms to be, in some sense, in more than one place at a time. Researchers all over the world are working to build \"quantum computers\" whose memories manipulate an inherently new type of information, \"quantum information.\" Quantum computers have capabilities impossible for a regular computer, no matter how advanced it may be, including the ability to run new kinds of computer programs capable of rapidly solving certain problems, and to make new highly secure codes for secret communication.

One simple way to think about physics is in terms of information. We gain information about physical systems by observing them, and with luck this data allows us to predict what they will do next. Quantum mechanics doesn\'t just change the rules about how physical objects behave - it changes the rules about how information behaves. In this talk we explore what quantum information is, and how strangely it differs from our intuitions. In particular we see how information about quantum particles can become entangled, leading to seemingly impossibly coordinated behaviour for separate objects.