Quantum Physics

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.

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.

Abstract: Adapting the concept of Wigner functions to finite dimensional systems is no simple matter. Basic issues with existing proposals are that they are either over-complete in the sense that the degrees of freedom in the Wigner function does not match the degrees of freedom in the original density matrix, or that they work only for restricted dimensions, namely for prime powers. We propose a new way to define a Wigner function and associated quantum phase space for some non-prime power dimensions. This allows to perform quantum state tomography from the measurement statistics of a minimal number of yes/no measurements.

By definition, SIC-POVMs are symmetric in the sense that the magnitude of the inner product between any pair of vectors is constant. All known constructions are based on additional symmetries, mainly with respect to the Weyl-Heisenberg group. Analyzing solutions for small dimensions, Zauner has identified an additional symmetry of order three and conjectured that these symmetries can be used to construct SIC-POVMs for all dimensions. Appleby has confirmed that all numerical solutions of Renes et al. indeed have that additional symmetry. This leads to the main questions addressed in the talk: Do all SIC-POVMs necessarily possess these symmetries, or can we construct SIC-POVMs without or with other symmetries?