GMGraeme Mitchison

Graeme Mitchison

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Graeme Mitchison has a total of 8 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Cumulants and the moment algebra: tools for analysing weak measurements

    by Johan Aberg, Graeme Mitchison

    Recently it has been shown that cumulants significantly simplify the analysis of multipartite weak measurements. Here we consider the mathematical structure that underlies this, and find that it can be formulated in terms of what we call the moment algebra. Apart from resulting in simpler proofs, the flexibility of this structure allows generalizations of the original results to a number of weak measurement scenarios, including one where the weakly interacting pointers reach thermal equilibrium with the probed system.

  • Open Access

    One-and-a-half quantum de Finetti theorems

    by Matthias Christandl, Robert Koenig, Graeme Mitchison, Renato Renner

    We prove a new kind of quantum de Finetti theorem for representations of the unitary group U(d). Consider a pure state that lies in the irreducible representation U_{mu+nu} for Young diagrams mu and nu. U_{mu+nu} is contained in the tensor product of U_mu and U_nu; let xi be the state obtained by tracing out U_nu. We show that xi is close to a convex combination of states Uv, where U is in U(d) and v is the highest weight vector in U_mu. When U_{mu+nu} is the symmetric representation, this yields the conventional quantum de Finetti theorem for symmetric states, and our method of proof gives near-optimal bounds for the approximation of xi by a convex combination of product states. For the class of symmetric Werner states, we give a second de Finetti-style theorem (our 'half' theorem); the de Finetti-approximation in this case takes a particularly simple form, involving only product states with a fixed spectrum. Our proof uses purely group theoretic methods, and makes a link with the shifted Schur functions. It also provides some useful examples, and gives some insight into the structure of the set of convex combinations of product states.

  • Weak measurement takes a simple form for cumulants

    by Graeme Mitchison

    A weak measurement on a system is made by coupling a pointer weakly to the system and then measuring the position of the pointer. If the initial wave function for the pointer is real, the mean displacement of the pointer is proportional to the so-called weak value of the observable being measured. This gives an intuitively direct way of understanding weak measurement. However, if the initial pointer wave function takes complex values, the relationship between pointer displacement and weak value is not quite so simple, as pointed out recently by Jozsa [R. Jozsa, Phys. Rev. A 76, 044103 (2007)]. This is even more striking in the case of sequential weak measurements [G. Mitchison, R. Jozsa, and S. Popescu, Phys. Rev. A 76, 062105 (2007)]. These are carried out by coupling several pointers at different stages of the evolution of the system, and the relationship between the products of the measured pointer positions and the sequential weak values can become extremely complicated for an arbitrary initial pointer wave function. Surprisingly, all this complication vanishes when one calculates the cumulants of pointer positions. These are directly proportional to the cumulants of sequential weak values. This suggests that cumulants have a fundamental physical significance for weak measurement.


  • Sequential weak measurement

    by Graeme Mitchison, Richard Jozsa, Sandu Popescu

    The notion of weak measurement provides a formalism for extracting information from a quantum system in the limit of vanishing disturbance to its state. Here we extend this formalism to the measurement of sequences of observables. When these observables do not commute, we may obtain information about joint properties of a quantum system that would be forbidden in the usual strong measurement scenario. As an application, we provide a physically compelling characterization of the notion of counterfactual quantum computation.


  • Open Access

    Weak measurement takes a simple form for cumulants

    by Graeme Mitchison

    A weak measurement on a system is made by coupling a pointer weakly to the system and then measuring the position of the pointer. If the initial wavefunction for the pointer is real, the mean displacement of the pointer is proportional to the so-called weak value of the observable being measured. This gives an intuitively direct way of understanding weak measurement. However, if the initial pointer wavefunction takes complex values, the relationship between pointer displacement and weak value is not quite so simple, as pointed out recently by R. Jozsa. This is even more striking in the case of sequential weak measurements. These are carried out by coupling several pointers at different stages of evolution of the system, and the relationship between the products of the measured pointer positions and the sequential weak values can become extremely complicated for an arbitrary initial pointer wavefunction. Surprisingly, all this complication vanishes when one calculates the cumulants of pointer positions. These are directly proportional to the cumulants of sequential weak values. This suggests that cumulants have a fundamental physical significance for weak measurement.

  • Open Access

    Sequential weak measurement

    by Graeme Mitchison, Richard Jozsa, Sandu Popescu

    The notion of weak measurement provides a formalism for extracting information from a quantum system in the limit of vanishing disturbance to its state. Here we extend this formalism to the measurement of sequences of observables. When these observables do not commute, we may obtain information about joint properties of a quantum system that would be forbidden in the usual strong measurement scenario. As an application, we provide a physically compelling characterisation of the notion of counterfactual quantum computation.

  • Open Access

    A most compendious and facile quantum de Finetti theorem

    by Robert Koenig, Graeme Mitchison

    In its most basic form, the finite quantum de Finetti theorem states that the reduced k-partite density operator of an n-partite symmetric state can be approximated by a convex combination of k-fold product states. Variations of this result include Renner's "exponential" approximation by "almost-product" states, a theorem which deals with certain triples of representations of the unitary group, and D'Cruz et al.'s result for infinite-dimensional systems. We show how these theorems follow from a single, general de Finetti theorem for representations of symmetry groups, each instance corresponding to a particular choice of symmetry group and representation of that group. This gives some insight into the nature of the set of approximating states, and leads to some new results, including an exponential theorem for infinite-dimensional systems.

  • One-and-a-Half Quantum de Finetti Theorems

    by Matthias Christandl, Robert König, Graeme Mitchison, Renato Renner


  • Open Access

    A dual de Finetti theorem

    by Graeme Mitchison

    The quantum de Finetti theorem says that, given a symmetric state, the state obtained by tracing out some of its subsystems approximates a convex sum of power states. The more subsystems are traced out, the better this approximation becomes. Schur-Weyl duality suggests that there ought to be a dual result that applies to a unitarily invariant state rather than a symmetric state. Instead of tracing out a number of subsystems, one traces out part of every subsystem. The theorem then asserts that the resulting state approximates the fully mixed state, and the larger the dimension of the traced-out part of each subsystem, the better this approximation becomes. This paper gives a number of propositions together with their dual versions, to show how far the duality holds.

  • Open Access

    The limits of counterfactual computation

    by Graeme Mitchison, Richard Jozsa

    We show that the protocol recently proposed by Hosten et al. does not allow all possible results of a computation to be obtained counterfactually, as was claimed. It only gives a counterfactual outcome for one of the computer outputs. However, we confirm the observation that the protocol gives some protection against decoherence. In some situations, though, it may be more effective simply to run the computer several times.