Talks

I will review the construction of lattice theories which maintain one or more exact supersymmetries for non zero lattice spacing concentrating in particular on the case of N=4 super Yang-Mills. Such lattice theories may be studied using Monte Carlo techniques borrowed from lattice QCD and can be used to explore issues in holography. In three dimensions the same constructions can be used to formulate a topological theory of gravity which we argue is equivalent to Witten's Chern Simons theory.

The ground state phase of spin-1/2 J1-J2 antiferromagnetic Heisenberg model on square lattice in the maximally frustrated regime (J2 ~ 0.5J1) has been debated for decades. Here we study this model by using a recently proposed novel numerical method - the cluster update algorithm for tensor product states (TPSs). The ground state energies at finite sizes and in the thermodynamic limit (with finite size scaling) are in good agreement with the state of art exact diagonalization study, and
the energy differences between these two studies are of the order of 0.001 J1 per site. At the largest bond dimension available D (D = 9), we find a paramagnetic ground state without any valence bond solid order in the thermodynamic limit in the range of 0.5 <= J2/J1 <= 0.6, which implies the emergence of a spin-liquid phase. Furthermore, we investigate the topologically ordered nature of such a spin-liquid phase by measuring a nonzero topological entanglement entropy.

There has been some significant recent progress on the long-standing problem of identifying the conditions under which equilibrium statistical mechanics can arise from an exact quantum mechanical treatment of the dynamics. I will give an overview of this progress, describing in particular how random matrix models and the associated concentration of measure phenomena imply that equilibration is generic even for the closed system evolution of pure quantum states. I will then discuss the relevance of these models to clarifying the conditions for quantum-classical correspondence of few-body chaotic systems. In particular, I will show that the Newtonian description of the dynamics of chaotic macroscopic bodies, remarkably, does not emerge from the underlying quantum mechanical description. These results suggest, under reasonable assumptions, that pure quantum states require a statistical interpretation.

The IceCube neutrino observatory is the world's largest high-energy neutrino telescope, utilizing the deep Antarctic ice as the Cherenkov detector medium.  In December 2010 the last of the observatory's 86 strings of optical detectors was deployed, completing the approximate cubic-kilometer array.   With the addition of a low-energy extension, called DeepCore, the observatory has very high neutrino detection efficiency for energies ranging from ~10 GeV to a few EeV.  The low-energy threshold establishes the first steps towards precision neutrino measurements in the Antarctic. Discussed will be early results from this emerging particle physics program as well as initial expectations from studies of potential future detector upgrades towards creating a multi-megaton neutrino detector with O(10 MeV) energy threshold.

The curvaton scenario provides a simple explanation for the generation of the cosmological perturbations, however most works have focused on cases with rather trivial curvaton energy potentials, e.g. quadratic ones. In this talk I will present the rich phenomenology of curvatons by showing that non-quadratic curvatons exhibit new behaviors, leading to interesting signals in the resulting density perturbations. A string theory realization of the curvaton scenario will also be discussed, where D-branes located in a warped throat region of the internal space play the role of curvatons.

We propose a form of parallel computing on classical computers that is based on matrix product states. The virtual parallelization is accomplished by evolving all possible results for multiple inputs, with bits represented by matrices. The action by classical probabilistic 1-bit and deterministic 2-bit gates such as NAND are implemented in terms of matrix operations and, as opposed to quantum computing, it is possible to copy bits. We present a way to explore this method of computation to solve search problems and count the number of solutions. We argue that if the classical computational cost of testing solutions (witnesses) requires less than O(n^2) local two-bit gates acting on n bits, the search problem can be fully solved in subexponential time. Therefore, for this restricted type of search problem, the virtual parallelization scheme is faster than Grover’s quantum algorithm.