Andrew J. P. Garner

A framework for phase and interference in generalized probabilistic theories

Andrew J. P. Garner1∗, Oscar C. O. Dahlsten † , Yoshifumi Nakata3‡, Mio Murao and Vlatko Vedral Atomic and Laser Physics, Clarendon Laboratory, University of Oxford, Parks Road, Oxford, OX13PU, United Kingdom Center for Quantum Technologies, National University of Singapore, Republic of Singapore Department of Physics, Graduate School of Science, University of Tokyo, Tokyo 113-0033, Japan Institute for Nano Quantum Information Electronics, University of Tokyo, Tokyo 153-8505, Japan (Dated: May 11, 2014)

The classical-quantum divergence of complexity in modelling spin chains

The minimal memory required to model a given stochastic process - known as the statistical complexity - is a widely adopted quantifier of structure in complexity science. Here, we ask if quantum mechanics can fundamentally change the qualitative behaviour of this measure. We study this question in the context of the classical Ising spin chain. In this system, the statistical complexity is known to grow monotonically with temperature. We evaluate the spin chains quantum mechanical statistical complexity by explicitly constructing its provably simplest quantum model, and demonstrate that this measure exhibits drastically different behaviour: it rises to a maximum at some finite temperature then tends back towards zero for higher temperatures. This demonstrates how complexity, as captured by the amount of memory required to model a process, can exhibit radically different behaviour when quantum processing is allowed.

Guaranteed energy-efficient bit reset in finite time.

Landauers principle states that it costs at least kBTln2 of work to reset one bit in the presence of a heat bath at temperature T. The bound of kBTln2 is achieved in the unphysical infinite-time limit. Here we ask what is possible if one is restricted to finite-time protocols. We prove analytically that it is possible to reset a bit with a work cost close to kBTln2 in a finite time. We construct an explicit protocol that achieves this, which involves thermalizing and changing the systems Hamiltonian so as to avoid quantum coherences. Using concepts and techniques pertaining to single-shot statistical mechanics, we furthermore prove that the heat dissipated is exponentially close to the minimal amount possible not just on average, but guaranteed with high confidence in every run. Moreover, we exploit the protocol to design a quantum heat engine that works near the Carnot efficiency in finite time.

The uncertainty principle enables non-classical dynamics in an interferometer.

The quantum uncertainty principle stipulates that when one observable is predictable there must be some other observables that are unpredictable. The principle is viewed as holding the key to many quantum phenomena and understanding it deeper is of great interest in the study of the foundations of quantum theory. Here we show that apart from being restrictive, the principle also plays a positive role as the enabler of non-classical dynamics in an interferometer. First we note that instantaneous action at a distance should not be possible. We show that for general probabilistic theories this heavily curtails the non-classical dynamics. We prove that there is a trade-off with the uncertainty principle that allows theories to evade this restriction. On one extreme, non-classical theories with maximal certainty have their non-classical dynamics absolutely restricted to only the identity operation. On the other extreme, quantum theory minimizes certainty in return for maximal non-classical dynamics.The uncertainty principle limits quantum states such that when one observable takes predictable values there must be some other mutually unbiased observables which take uniformly random values. We show that this restrictive condition plays a positive role as the enabler of non-classical dynamics in an interferometer. First we note that instantaneous action at a distance between different paths of an interferometer should not be possible. We show that for general probabilistic theories this heavily curtails the non-classical dynamics. We prove that there is a trade-off with the uncertainty principle, that allows theories to evade this restriction. On one extreme, non-classical theories with maximal certainty have their non-classical dynamics absolutely restricted to only the identity operation. On the other extreme, quantum theory minimises certainty in return for maximal nonclassical dynamics.

Using quantum theory to simplify input–output processes

All natural things process and transform information. They receive environmental information as input, and transform it into appropriate output responses. Much of science is dedicated to building models of such systems—algorithmic abstractions of their input–output behavior that allow us to simulate how such systems can behave in the future, conditioned on what has transpired in the past. Here, we show that classical models cannot avoid inefficiency—storing past information that is unnecessary for correct future simulation. We construct quantum models that mitigate this waste, whenever it is physically possible to do so. This suggests that the complexity of general input–output processes depends fundamentally on what sort of information theory we use to describe them.Responding to the environment is easier with quantum mechanicsCan a quantum goldfish exhibit more complex behaviour than a classical dolphin? In complexity science, the complexity of an input-output process – a system that reacts differently when supplied with different environmental stimuli – can be quantified by the minimal memory needed to reproduce the process’s observed behaviour. This reflects the intuition that a goldfish – that remembers very little – can only exhibit fairly simple input-output behaviour. Here we show how these ideas can radically change when generalized to the quantum domain. A quantum system may exhibit behaviour that appears considerably more complex than a classical system that has significantly more memory.

Provably unbounded memory advantage in stochastic simulation using quantum mechanics

Simulating the stochastic evolution of real quantities on a digital computer requires a trade-off between the precision to which these quantities are approximated, and the memory required to store them. The statistical accuracy of the simulation is thus generally limited by the internal memory available to the simulator. Here, using tools from computational mechanics, we show that quantum processors with a fixed finite memory can simulate stochastic processes of real variables to arbitrarily high precision. This demonstrates a provable, unbounded memory advantage that a quantum simulator can exhibit over its best possible classical counterpart.

The complex and quaternionic quantum bit from relativity of simultaneity on an interferometer

The patterns of fringes produced by an interferometer have long been important testbeds for our best contemporary theories of physics. Historically, interference has been used to contrast quantum mechanics with classical physics, but recently experiments have been performed that test quantum theory against even more exotic alternatives. A physically motivated family of theories are those where the state space of a two-level system is given by a sphere of arbitrary dimension. This includes classical bits, and real, complex and quaternionic quantum theory. In this paper, we consider relativity of simultaneity (i.e. that observers may disagree about the order of events at different locations) as applied to a two-armed interferometer, and show that this forbids most interference phenomena more complicated than those of complex quantum theory. If interference must depend on some relational property of the setting (such as path difference), then relativity of simultaneity will limit state spaces to standard complex quantum theory, or a subspace thereof. If this relational assumption is relaxed, we find one additional theory compatible with relativity of simultaneity: quaternionic quantum theory. Our results have consequences for current laboratory interference experiments: they have to be designed carefully to avoid rendering beyond-quantum effects invisible by relativity of simultaneity.

Interferometric Computation Beyond Quantum Theory

There are quantum solutions for computational problems that make use of interference at some stage in the algorithm. These stages can be mapped into the physical setting of a single particle travelling through a many-armed interferometer. There has been recent foundational interest in theories beyond quantum theory. Here, we present a generalized formulation of computation in the context of a many-armed interferometer, and explore how theories can differ from quantum theory and still perform distributed calculations in this set-up. We shall see that quaternionic quantum theory proves a suitable candidate, whereas box-world does not. We also find that a classical hidden variable model first presented by Spekkens (Phys Rev A 75(3): 32100, 2007) can also be used for this type of computation due to the epistemic restriction placed on the hidden variable.

On Defining the Hamiltonian Beyond Quantum Theory

Energy is a crucial concept within classical and quantum physics. An essential tool to quantify energy is the Hamiltonian. Here, we consider how to define a Hamiltonian in general probabilistic theories—a framework in which quantum theory is a special case. We list desiderata which the definition should meet. For 3-dimensional systems, we provide a fully-defined recipe which satisfies these desiderata. We discuss the higher dimensional case where some freedom of choice is left remaining. We apply the definition to example toy theories, and discuss how the quantum notion of time evolution as a phase between energy eigenstates generalises to other theories.