Scientific Series

Key notions from statistical physics, such as "phase transitions" and "critical phenomena", are providing important insights in fields ranging from computer science to probability theory to epidemiology. Underlying many of the advances is the study of phase transitions on models of networks. Starting from the classic ideas of Erdos and Renyi, recent attempts to control and manipulate the nature of the phase transition in network connectivity will be discussed. Next, the influence of self-organization on phase transitions will be presented, as well as connections between the jamming transition in models of granular materials and constraint satisfaction problems in computer science. Finally, turning to network growth, I will show that local optimization can play a fundamental role leading to the mechanism of Preferential Attachment, which previously had been assumed as a basic axiom and, furthermore, resolves a long standing controversy between Herb Simon and Benoit Mandelbrot.

Gauge theories with deformed products of fields in the lagrangian constitute an interesting generalization of the gauge/string duality. We review a systematic procedure to find the string duals of such theories, called the TsT transformation, and illustrate its properties by means of a few examples.

In my talk I will provide an overview of the applications of Wilson's modern renormalization group (RG) to problems in quantum gravity. I will first discuss the development of the RG for continuum gravity within the framework of Feynman's covariant path integral approach. Then I will discuss a number of issues that arise when implementing the path integral approach with an explicit lattice UV regulator, and later how non-perturbative RG flows and universal non-trivial scaling dimensions can in principle be extracted from these calculations. Towards the end I will discuss recent attempts at formulating RG flows for gravitational couplings within the framework of a set of manifestly covariant, but non-local, effective field equations suitable for quantum cosmology.

It is well known that new physics at the electroweak scale could solve important puzzles in cosmology, such as the nature of dark matter and the origin of the cosmic baryon asymmetry. In this talk, I discuss some of the simplest, non-supersymmetric possibilities, their collider signatures, and the prospects for their discovery and identification at the LHC.

Quantum random walks have received much interest due to their non- intuitive dynamics, which may hold a key to radically new quantum algorithms. What remains a major challenge is a physical realization that is experimentally viable, readily scalable, and not limited to specific connectivity criteria. In this seminar, I will present an implementation scheme for quantum walking on arbitrarily complex graphs. This scheme is particularly elegant since the walker is not required to physically step between the nodes; only flipping coins is sufficient. In addition, by taking advantage of the inherent structure of the CS decomposition of unitary matrices, we are able to implement all coin operations necessary for each step of the walk simultaneously. This scheme can be physically realized using a variety of quantum systems, such as cold atoms trapped inside an optical lattice or electrons inside coupled quantum dots.

Recently methods of integrability were shown to be useful for solving gauge theories in various dimensions. I will make an introduction into integrability in two dimensions and demonstrate how the integrability works also for some three and four dimensional gauge theories.

Researchers in quantum foundations claim (D'Ariano, Fuchs, ...): Quantum = probability theory + x and hence: x = Quantum - probability theory Guided by the metaphorical analogy: probability theory / x = flesh / bones we introduce a notion of quantum measurement within x, which, when flesing it with Hilbert spaces, provides orthodox quantum mechanical probability calculus.

A modified version of PQCD considered in previous works is further investigated in the case of a vanishing gluon condensate, by retaining only the quark one. In this case the Green functions generating functional is expressed in a simple form in which Dirac’s delta functions are now absent from the free propagators. The new expansion implements the dimensional transmutation effect through a single interaction vertex in addition to the standard ones in mass less QCD. The results of an ongoing two loop evaluation of the vacuum energy will be presented. The potential is parameterized as a function of the quark mass (defined by the pole of the first corrections to the quark propagator), the assumed finite zero momentum limit of the coupling constant g and the dimensional regularization parameter. The first condensate dependent corrections to the gluon and quark self-energies and propagators are evaluated. Assuming the possibility of fixing a minimum of the potential at the experimental value of the top quark mass =173 GeV, we evaluate the pole of the simplest correction to the propagator of the composite operator describing the quark condensate. Then, alter adopting the idea from the former top condensate models, in which the Higgs field corresponds to the quark condensate, the obtained pole gave a first rough estimate for the Higgs mass =168.2 GeV. Although being inside of the recently experimentally excluded region: 160-170 GeV, this mass value has the chance of being modified by a better approximation being currently considered for the gluon propagator entering its evaluation.

Solving linear systems of equations is a common problem that arises both on its own and as a subroutine in more complex problems: given a matrix A and a vector b, find a vector x such that Ax=b. Often, one does not need to know the solution x itself, but rather an approximation of the expectation value of some operator associated with x, e.g., x'Mx for some matrix M. In this case, when A is sparse and well-conditioned, with largest dimension N, the best known classical algorithms can find x and estimate x'Mx in O(N * poly(log(N))) time. In this talk I'll describe a quantum algorithm for solving linear sets of equations that runs in poly(log N) time, an exponential improvement over the best classical algorithm. This talk is based on my paper arXiv:0811.3171v2, which was written with Avinatan Hassidim and Seth Lloyd.

Yes, that's indeed where it happens. These pictures are not ordinary pictures but come with category-theoretic algebraic semantics, support automated reasoning and design of protocols, and match perfectly the developments in important areas of mathematics such as representation theory, proof theory, TQFT & GR, knot theory etc. More concretely, we report on the progress in a research program that aims to capture logical structures within quantum phenomena and quantum informatic tasks in purely diagrammatic terms. These picture calculi are faithful representations of certain kinds of monoidal categories, and structures therein. However, the goal of this program is partly to `release' these intuitive languages (or calculi) from their category-theoretic underpinning, and conceiving these pictures as mathematical entities in their own right. In this new language one is able to model and reason about things such a complementary observables, phase data, quantum circuits and algorithms, a variety of different quantum computational models, hidden-variable models, aspects of non-locality, and reason about all of these in terms of intuitive diagram transformations. Some recent benchmarks are the diagraamatic computation of quantum Fourier transform due to Duncan and myself, a purely diagrammatic proof of the no-cloning theorem due to Abramsky, and a categorical characterisation of GHZ-type non-locality due to Edwards, Spekkens and myself. For informal introductions we refer to: [1] Kindergarten quantum mechanics. http://arxiv.org/abs/quant-ph/0510032 [2] Introducing categories to the practicing physicist. http://arxiv.org/abs/0808.1032 For recent more advanced developments we suggest: [3] Selinger: Dagger compact closed categories and completely positive maps QPL\'05 http://www.mathstat.dal.ca/~selinger/papers.html#dagger [4] Coecke, Pavlovic, Vicary: A new description of orthogonal bases. http://arxiv.org/abs/0810.0812 [5] Coecke, Paquette, Perdrix: Bases in diagrammatic quantum protocols http://arxiv.org/abs/0808.1029 [6] Coecke, Duncan: Interacting quantum observables. ICALP\'08. http://www.springerlink.com/content/y443214116h76122/ [7] Coecke, Edwards: Toy quantum categories. QPL\'08. http://arxiv.org/abs/0808.1037