Talks

Many string theorists and cosmologists have recently turned their attention to building and testing string theory models of inflation. One of the main goals is to find novel features that could distinguish stringy models from their field theoretic counterparts. This is difficult because, in most examples, string theory is used to derived an effective theory operating at energies well below the string scale. However, since string theory provides a complete description of dynamics also at higher energies, it may be interesting to construct inflationary models which take advantage of this distinctive feature. I will discuss recent progress in this direction using p-adic string theory - a toy model of the bosonic string for which the full series of higher dimensional operators is known explicitly - as a playground for studying string cosmology to all order in $alpha\'$. The p-adic string is a nonlocal theory containing derivatives of all orders and this structure is also ubiquitous in string field theory. After discussing the difficulties (such as ghosts and classical instabilities) that arise in working with higher derivative theories I will show how to construct generic inflationary models with infinitely many derivatives. Novel features include the possibility of realizing slow roll inflation with a steep potential and large nongaussian signatures in the CMB.

Recently a simple but perhaps profound connection has been observed between the unitary solutions of the Yang-Baxter Equations (YBE) and the entangled Bell states and their higher dimensional (or more-qubit) extensions, the generalized GHZ states. We have shown that this connection can be made more explicit by exploring the relation between the solutions of the YBE and the representations of the extra-special two-groups. This relationship brings certain topological-like features to quantum information theory, and makes a connection to the well-known Jones polynomials which are topological invariants of knots and links. This emerging connection may deepen our understanding, through new representations of extra-special two-groups, of quantum error correction and topological quantum computation. This work is a collaboration with Eric Rowell, Zhenghan Wang, Molin Ge, and Yong-Zhang.

A comprehensive graph theoretical and finite geometrical study of the commutation relations between the generalized Pauli operators of N-qudits is performed in which vertices/points correspond to the operators and edges/lines join commuting pairs of them. As per two-qubits, all basic properties and partitionings of the corresponding Pauli graph are embodied in the geometry of the generalized quadrangle of order two. Here, one identifies the operators with the points of the quadrangle and groups of maximally commuting subsets of the operators with the lines of the quadrangle. The three basic partitionings are (a) a pencil of lines and a cube, (b) a Mermin\'s array and a bipartite-part and (c) a maximum independent set and the Petersen graph. These factorizations stem naturally from the existence of three distinct geometric hyperplanes of the quadrangle, namely a set of points collinear with a given point, a grid and an ovoid, which answer to three distinguished subsets of the Pauli graph, namely a set of six operators commuting with a given one, a Mermin\'s square, and set of five mutually non-commuting operators, respectively. The generalized Pauli graph for multiple qubits is found to follow from symplectic polar spaces of order two, where maximal totally isotropic subspaces stand for maximal subsets of mutually commuting operators. The substructure of the (strongly regular) N-qubit Pauli graph is shown to be pseudo-geometric, i. e., isomorphic to a graph of a partial geometry. Finally, the (not strongly regular) Pauli graph of a two-qutrit system is introduced; here it turns out more convenient to deal with its dual in order to see all the parallels with the two-qubit case and its surmised relation with the generalized quadrangle Q(4, 3), the dual ofW(3). Joint work with Metod Saniga. Based on arXiv:quant-ph/0701211.

We find that the overlapping of a topological quantum color code state, representing a quantum memory, with a factorized state of qubits can be written as the partition function of a 3-body classical Ising model on triangular or Union Jack lattices. This mapping allows us to test that different computational capabilities of color codes correspond to qualitatively different universality classes of their associated classical spin models. By generalizing these statistical mechanical models for arbitrary inhomogeneous and complex couplings, it is possible to study a measurement-based quantum computation with a color code state and we find that their classical simulatability remains an open problem. We complement the meaurement-based computation with the construction of a cluster state that yields the topological color code and this also gives the possibility to represent statistical models with external magnetic fields. Joint work with M.A. Martin-Delgado.

A fundamental theorem of quantum field theory states that the generating functionals of connected graphs and one-particle irreducible graphs are related by Legendre transformation. An equivalent statement is that the tree level Feynman graphs yield the solution to the classical equations of motion. Existing proofs of either fact are either lengthy or are short but less rigorous. Here we give a short transparent rigorous proof. On the practical level, our methods could help make the calculation of Feynman graphs more efficient. On the conceptual level, our methods yield a new, unifying view of the structure of perturbative quantum field theory, and they reveal the fundamental role played by the Euler characteristic of graphs. This is joint work with D.M. Jackson (UW) and A. Morales (MIT)

Some years ago Valiant introduced a notion of \'matchgate\' and \'holographic algorithm\', based on properties of counting perfect matchings in graphs. This provided some new poly-time classical algorithms and embedded in this formalism, he recognised a remarkable class of quantum circuits (arising when matchgates happen to be unitary) that can be classically efficiently simulated. Subsequently various workers (including Knill, Terhal and DiVincenzo, Bravyi) showed that these results can be naturally interpreted in terms of the formalism of fermionic quantum computation. In this talk I will outline how unitary matchgates and their simulability arise from considering a Clifford algebra of anticommuting symbols, and then I\'ll discuss some avenues for further generalisation and interesting properties of matchgate circuits. In collaboration with Akimasa Miyake, University of Innsbruck.

We give an overview of several connections between topics in quantum information theory, graph theory, and statistical mechanics. The central concepts are mappings from statistical mechanical models defined on graphs, to entangled states of multi-party quantum systems. We present a selection of such mappings, and illustrate how they can be used to obtain a cross-fertilization between different research areas. For example, we show how width parameters in graph theory such as \'tree-width\' and \'rank-width\', which may be used to assess the computational hardness of evaluating partition functions, are intimately related with the entanglement measure \'entanglement width\', which is used to asses to computational power of resource states in quantum information. Furthermore, using our mappings we provide simple techniques to relate different statistical mechanical models with each other via basic graph transformations. These techniques can be used to prove that that there exist models which are \'complete\' in the sense that every other model can be viewed as a special instance of such a complete model via a polynomial reduction. Examples of such complete models include the 2D Ising model in an external field, as well as the zero-field 3D Ising model. Joint work with W. Duer, G. de las Cuevas, R. Huebener and H. Briegel

The idea of pseudo-randomness is to use little or no randomness to simulate a random object such as a random number, permutation, graph, quantum state, etc... The simulation should then have some superficial resemblance to a truly random object; for example, the first few moments of a random variable should be nearly the same. This concept has been enormously useful in classical computer science. In my talk, I\'ll review some quantum analogues of pseudo-randomness: unitary k-designs, quantum expanders (and their new cousin, quantum tensor product expanders), extractors. I\'ll talk about relations between them, efficient constructions, and possible applications. Some of the material is joint work with Matt Hastings and Richard Low.

Certain structures arising in Physics (mub\'s and sic-povm\'s) can be viewed as sets of lines in complex space that are as large as possible, given some simple constraints on the angles between distinct lines. The analogous problems in real space have long been of interest in Combinatorics, because of their relation to classical combinatorial structures. In the complex case there seems no reason for any combinatorial connection to exist. will discuss some of the history of the real problems, and describe some recent work that relates the complex problems to some very interesting classes of graphs.