Quantum Information

Quantum error correcting codes and topological quantum order (TQO) are inter-connected fields that study non-local correlations in highly entangled many-body quantum states. In this talk I will argue that each of these fields offers valuable techniques for solving problems posed in the other one. First, we will discuss the zero-temperature stability of TQO and derive simple conditions that guarantee stability of the spectral gap and the ground state degeneracy under generic local perturbations. These conditions thus can be regarded as a rigorous definition of TQO. Our results apply to any quantum spin Hamiltonian that can be written as a sum of geometrically local commuting projectors on a D-dimensional lattice. This large class of Hamiltonians includes Levin-Wen string-net models and Kitaev's quantum double models. Secondly, we derive upper bounds on the parameters of quantum codes with local check operators and discuss the implications for feasibility of a quantum self-correcting memory.

I'll describe a connection between uncertainty relations, information locking and low-distortion embeddings of L2 into L1. Exploiting this connection leads to the first explicit construction of entropic uncertainty relations for a number of measurements that is polylogarithmic in the dimension d while achieving an average measurement entropy of (1-e) log d for arbitrarily small e. From there, it is straightforward to obtain the first strong information locking scheme that is efficiently computable using a quantum computer. This locking scheme can be interpreted as a method for encrypting classical messages using a key of size much smaller than the message length. Other applications include efficient encodings for amortized quantum identification over classical channels and new string commitment protocols.

Quantum computers have emerged as the natural architecture to study the physics of strongly correlated many-body quantum systems, thus providing a major new impetus to the field of many-body quantum physics. While the method of choice for simulating classical many-body systems has long since been the ubiquitous Monte Carlo method, the formulation of a generalization of this method to the quantum regime has been impeded by the fundamental peculiarities of quantum mechanics, including, interference effects and the no-cloning theorem. We overcome those difficulties by constructing a quantum algorithm to sample from the Gibbs distribution of a quantum Hamiltonian at arbitrary temperatures, both for bosonic and fermionic systems. This is a further step in validating the quantum computer as a full quantum simulator, with a wealth of possible applications to quantum chemistry, condensed matter physics and high energy physics.

Even though the security of quantum key distribution has been rigorously proven, most practical schemes can be attacked and broken. These attacks make use of imperfections of the physical devices used for their implementation. Since current security proofs assume that the physical devices' exact and complete specification is known, they do not hold for this scenario. The goal of device-independent quantum key distribution is to show security without making any assumptions about the internal working of the devices. In this talk, I will first explain the assumptions 'traditional' security proofs make and why they are problematic. Then, I will discuss how the violation of Bell inequalities can be used to show security even when a large part of the physical devices is untrusted.

A system of spins with complicated interactions between them can have many possible configurations. Many configurations will be local minima of the energy, and to get from one local minimum to another requires changing the state of very many spins. A system like this is called a spin glass, and at low temperatures tends to get caught for very long times at a local minimum of energy, rather than reaching its true ground state. Indeed, in many cases, finding the ground state energy of a spin glass is a computationally hard problem, too hard to be solved on a classical computer or even a quantum computer in any reasonable amount of time. Which types of interactions give us computationally hard problems and spin glasses? I will survey what is known as we close in on finding the simplest complex spin systems.

We introduce a family of variational ansatz states for chains of anyons which optimally exploits the structure of the anyonic Hilbert space. This ansatz is the natural analog of the multi-scale entanglement renormalization ansatz for spin chains. In particular, it has the same interpretation as a coarse-graining procedure and is expected to accurately describe critical systems with algebraically decaying correlations. We numerically investigate the validity of this ansatz using the anyonic golden chain and its relatives as a testbed. This demonstrates the power of entanglement renormalization in a setting with non-abelian exchange statistics, extending previous work on qudits, bosons and fermions in two dimensions. This is joint work with Ersen Bilgin.

Over the last twenty years, quantum information and quantum computing have profoundly shaped our thinking about the basic concepts of quantum physics. But can these insights also shape the way we /teach/ quantum mechanics to undergraduate physics students? A recent adventure in textbook-writing suggests some strategies and dilemmas.

In this talk we will explore a "toy model" of quantum theory that is similar to actual quantum theory, but uses scalars drawn from a finite field. The set of possible states of a system is discrete and finite. Our theory does not have a quantitative notion of probability, but only makes the "modal" distinction between possible and impossible measurement results. Despite its very simple structure, our toy model nevertheless includes many of the key phenomena of actual quantum systems: interference, complementarity, entanglement, nonlocality, and the impossibility of cloning.

We study a Hamiltonian system describing a three-spin 1/2 cluster like interaction competing with an Ising-like exchange. We show that a cluster state, the ground state of the Hamiltonian in the absence of the Ising term, is provided by a hidden order of topological nature. In the presence of the cluster and Ising couplings, a continuous quantum phase transition occurs in the system, directly connecting a local broken symmetry phase to a cluster phase with the hidden order. At the critical point the Hamiltonian is self-dual. We analyze the geometric entanglement and demonstrate that it can capture the transition, as a single parameter.

A lattice gauge theory is described by a redundantly large vector space that is subject to local constraints, and it can be regarded as the low energy limit of a lattice model with a local symmetry. I will describe a coarse-graining scheme capable of exactly preserving local symmetries. The approach results in a variational ansatz for the ground state(s) and low energy excitations of a lattice gauge theory. This ansatz has built-in local symmetries, which are exploited to significantly reduce simulation costs. I will describe benchmark results in the context of Kitaev’s toric code with a magnetic field or, equivalently, Z2 lattice gauge theory, for lattices with up to 16 x 16 sites (16^2 x 2 = 512 spins) on a torus.