Quantum Physics

Quantum computation by single-qubit measurements was proposed by Raussendorf and Briegel [PRL 86, 5188] as a potential scheme for implementing quantum computers. It also offers an unusual means of describing unitary transformations. To better understand which measurement-based procedures perform unitary operations, we may consider the following problem: under what circumstances can a measurement-based procedure for a unitary U be found, provided a similar procedure for U which relies on post-selection? In this talk, I describe the so-called \'Measurement Pattern Interpolation\' problem, the intuition behind the solved special cases, and possible applications of a general solution to this problem.

Conventional quantum mechanics answers this question by specifying the required mathematical properties of wavefunctions and invoking the Born postulate. The ontological question remains unanswered. There is one exception to this. A variation of the Feynman chessboard model allows a classical stochastic process to assemble a wavefunction, based solely on the geometry of spacetime paths. A direct comparison of how a related process assembles a Probability Density Function reveals both how and why PDFs and wavefunctions differ from the perspective of an underlying kinetic theory. If the fine-scale motion of a particle through spacetime is continuous and position is a single valued function of time, then we are able to describe ensembles of paths directly by PDFs. However, should paths have time reversed portions so that position is not a single-valued function of time, a simple Bernoulli counting of paths fails, breaking the link to PDF\'s! Under certain circumstances, correcting the path-counting to accommodate time-reversed sections results in wavefunctions not PDFs. The result is that a single `switch\' simultaneously turns on both special relativity and quantum propagation. Physically, fine-scale random motion in space alone yields a diffusive process with PDFs governed by the Telegraph equations. If the fine-scale motion includes both directions in time, the result is a wavefunction satisfying the Dirac equation that also provides a detailed answer to the title question.

Many statistics problems involve predicting the joint strategy that will be chosen by the players in a noncooperative game. Conventional game theory predicts that the joint strategy will satisfy an ``equilibrium concept\'\'. The relative probabilities of the joint strategies satisfying the equilibrium concept are not given, and all joint strategies that do not satisfy it are given probability zero. As an alternative, I view the prediction problem as one of statistical inference, where the ``data\'\' includes the details of the noncooperative game. This replaces conventional game theory\'s focus on how to specify a set of equilibrium joint strategies with a focus on how to specify a density function over joint strategies. I explore a Bayesian version of such a Predictive Game Theory (PGT) that provides a posterior density over joint strategies. It is based on the the entropic prior and on a likelihood that quantifies the rationalities of the players. The Quantal Response Equilibrium (QRE) is a popular game theory equilibrium concept parameterized by player rationalities. I show that for some games the local peaks of the posterior density over joint strategies approximate the associated QRE\'s, and derive the associated correction terms. I also discuss how to estimate parameters of the likelihood from observational data, and how to sample from the posterior. I end by showing how PGT can be used to specify a {it{unique}} equilibrium for any noncooperative game, thereby providing a solution to a long-standing problem of conventional game theory.

By storing quantum information in the degenerate ground state of a Hamiltonian, it is hoped that it can be made quite robust against noise processes. We will examine this situation, with particular emphasis on the Toric code in 2D, and show how adversarial effects, either perturbations to the Hamiltonian or interactions with an environment, destroy the stored information extremely quickly.

I show that physical devices that perform observation, prediction, or recollection share an underlying mathematical structure. I call devices with that structure ``inference devices\'\'. I present a set of existence and impossibility results concerning inference devices. These results hold independent of the precise physical laws governing our universe. In a limited sense, the impossibility results establish that Laplace was wrong to claim that even in a classical, non-chaotic universe the future can be unerringly predicted, given sufficient knowledge of the present. Alternatively, these impossibility results can be viewed as a non-quantum mechanical ``uncertainty principle\'\'. Next I explore the close connections between the mathematics of inference devices and of Turing Machines. I end by informally discussing the philosophical implications of these results, e.g., for whether the universe ``is\'\' a computer.

We analyze how quantum complexity poses bounds to the simulation of quantum systems. While methods as Density Functional Theory (DFT) and the Density Matrix Renormalization Group (DMRG) work very well in practice, essentially nothing on the formal requirements is known. In this talk, we consider these methods from a quantum complexity perspective: First, we discuss DFT which encapsulates the difficulty of solving the Schroedinger equation in a universal functional and show that this functional cannot be efficiently computed unless several complexity classes collapse. Second, we consider DMRG, a method to deal with quantum spin chains, and show that even under reasonable assumptions -- a polynomial gap and matrix product ground states -- finding the ground state is still a computationally hard problem. Beyond pinpointing the limitations of the methods, this helps us to understand under which assumptions we might be able to prove their convergence.

The unparalleled empirical success of quantum theory strongly suggests that it accurately captures fundamental aspects of the workings of the physical world. The clear articulation of these aspects is of inestimable value --- not only for the deeper understanding of quantum theory in itself, but for its further development, particularly for the development of a theory of quantum gravity. Recently, there has been growing interest in elucidating these aspects by expressing, in a less abstract mathematical language, what we think quantum theory might be telling us about how nature works, and trying to derive, or reconstruct, quantum theory from these postulates. In this talk, I describe a simple reconstruction of the finite- dimensional quantum formalism. The derivation takes places with a classical probabilistic framework equipped with the information (or Fisher-Rao) metric, and rests upon a small number of elementary ideas (such as complementarity and global gauge invariance). The complex structure of quantum formalism arises very naturally. The derivation provides a number of non-trivial insights into the quantum formalism, such as the extensive nature of the role of information geometry in determining the quantum formalism, the importance of global gauge invariance, and the importance (or lack thereof) of assumptions concerning separated systems.

The question whether SICs exist can be viewed as a question about the structure of the convex set of quantum measurements, or turned into one about quantum states, asserting that they must have a high degree of symmetry. I\'ll address Chris Fuchs\' contrast of a \'probability first\' view of the issue with a \'generalized probabilistic theories\' view of it. I\'ll review some of what\'s known about the structure of convex state and measurement spaces with symmetries of a similar flavor, including the quantum one, and speculate on connections to recent SIC triple product results. And I\'ll present some old calculations, which will look familiar to old hands but may be worth contemplating yet again, reducing the Heisenberg-symmetric-SIC existence problem to the existence of solutions to a set of simultaneous polynomials in unit-modulus complex variables.

Abstract: Complete sets of mutually unbiased bases are clearly \'cousins\' of SICs. One difference is that there is a \'theory\' for MUBs, in the sense that they are straightforward to construct in some cases, and probably impossible to construct in others. Moreover complete sets of MUBs do appear naturally in the algebraic geometry of projective space (in particular they come from elliptic curves with certain symmetries). I will describe some unsuccessful attempts I have made to go from MUBs to SICs.