Quantum Foundations

This paper critically examines the view of quantum mechanics that emerged shortly after the introduction of quantum mechanics and that has been widespread ever since. Although N. Bohr, P. A. M. Dirac, and W. Heisenberg advanced this view earlier, it is best exemplified by J. von Neumann’s argument in Mathematical Foundations of Quantum Mechanics (1932) that the transformation of \'a [quantum] state ... under the action of an energy operator . . . is purely causal,\' while, \'on the other hand, the state ... which may measure a [given] quantity ... undergoes in a measurement a non-casual change.\' Accordingly, while the paper discusses all four of these arguments, it will especially focus on that of von Neumann. The paper also offers an alternative, radically noncausal, view of the quantum-mechanical situation and considers the differences between the ensemble and the Bayesian understanding quantum mechanics. It will also discuss the Bayesian approach to quantum information theory in this set of contexts.

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.

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.

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.

I present three realizations about the SIC problem which excited me several years ago but which did not - unsurprisingly - lead anywhere. 1. In odd dimensions d, the metaplectic representation of SL(2,Z_d) decomposes into two irreducible components, acting on the odd and even parity subspaces respectively. It follows that if a fiducial vector | Psi> possesses some Clifford-symmetry, the same is already true for both its even and its odd parity components |Psi_e>, |Psi_o>. What is more, these components have potentially a larger symmetry group than their sum. Indeed, this effect can be verified when looking at the known numerical solutions in d=5 and d=7. A finding of remarkably little consequence! 2. In composite dimensions d=p_1^r_1 ... p_k^r_k, all elements of the Clifford group factor with respect to some tensor decomposition C^d=C^(p_1^r_1) x ... x C^(p_k^r_k) of the underlying Hilbert space. This structure may potentially be used to simplify the constraints on fiducial vectors. My optimism is vindicated by the following, ground-breaking result: In even dimensions 2d not divisible by four, the Hilbert space is of the form C^2 x C^d. So it makes sense to ask for the Schmidt-coefficients of a fiducial vector with respect to that tensor product structure. They can be computed to be 1/2(1 +/- sqrt{3/(d+1)}), removing one (!) parameter from the problem and establishing that, asymptotically, fiducial vectors are maximally entangled. 3. Becoming slightly more esoteric, I could move on to talk about discrete Wigner functions and show in what sense finding elements of a set of MUBs corresponds to imposing that a certain matrix be positive, while a similar argument for fiducial vectors requires a related matrix to be unitary. Now, positivity has \'local\' consequences: it implies constraints on small sub-matrices. Unitarity, on the other hand, seems to be more \'global\' in that all algebraic consequences of unitarity involve \'many\' matrix elements at the same time. This point of view suggests that SICs are harder to find than MUBs (in case anybody wondered). If we solve the problem by Wednesday, I\'ll talk about quantum expanders.

As a means of exactly derandomizing certain quantum information processing tasks, unitary designs have become an important concept in quantum information theory. A unitary design is a collection of unitary matrices that approximates the entire unitary group, much like a spherical design approximates the entire unit sphere. We use irreducible representations of the unitary group to find a general lower bound on the size of a unitary t-design in U(d), for any d and t. The tightness of these bounds is then considered, where specific unitary 2-designs are introduced that are analogous to SIC-POVMs and complete sets of MUBs in the complex projective case. Additionally, we catalogue the known constructions of unitary t-designs and give an upper bound on the size of the smallest weighted unitary t-design in U(d). This is joint work with Aidan Roy (Calgary): \'Unitary designs and codes,\' arXiv:0809.3813.