Quantum Information

The Elitzur-Vaidman bomb tester allows the detection of a photon-triggered bomb with a photon, without setting the bomb off. This seemingly impossible task can be tackled using the quantum Zeno effect. Inspired by the EV bomb tester, we define the notion of "bomb query complexity". This model modifies the standard quantum query model by measuring each query immediately after its application, and ends the algorithm if a 1 is measured.

We show that the bomb query complexity is asymptotically the square of the quantum query complexity. Moreover, we will show how this characterization inspires a general theorem relating classical and quantum query complexity, and derive new algorithms from this theorem.

From Feynman diagrams via Penrose graphical notation to quantum circuits, graphical languages are widely used in quantum theory and other areas of theoretical physics. The category-theoretical approach to quantum mechanics yields a new set of graphical languages, which allow rigorous pictorial reasoning about quantum systems and processes. One such language is the ZX-calculus, which is built up of elements corresponding to maps in the computational and the Hadamard basis. This calculus is universal for pure state qubit quantum mechanics, meaning any pure state, unitary operation, and post-selected pure projective measurement can be represented. It is also sound, meaning any graphical rewrite corresponds to a valid equality when translated into matrices.

While the calculus is not complete for general quantum mechanics, I show that it is complete for stabilizer quantum mechanics and for the single-qubit Clifford+T group. This means that within those subtheories, any equality that can be derived using matrices can also be derived graphically.

The ZX-calculus can thus be applied to a wide range of problems in quantum information and quantum foundations, from the analysis of quantum non-locality to the verification of measurement-based quantum computation and error-correcting codes. I also show how to construct a ZX-like graphical calculus for Spekkens' toy bit theory and give its associated completeness proof.

Quantum Adiabatic Optimization proposes to solve discrete optimization problems by mapping them onto quantum spin systems in such a way that the optimal solution corresponds to the ground state of the quantum system. The standard method of preparing these ground states is using the adiabatic theorem, which tells us that quantum systems tend to remain in the ground state of a time-dependent Hamiltonian which transforms sufficiently slowly. In this talk I'll show that alternative strategies using non-adiabatic effects can in some cases be dramatically faster for instances which are hard for the traditional adiabatic method.

I will also discuss Simulated Quantum Annealing (SQA), which is a classical simulation of adiabatic optimization at non-zero temperature based on Path-Integral Quantum Monte Carlo. SQA is widely used in practice to study adiabatic optimization, but relatively little is known about the rate of convergence of the markov chain that underlies the algorithm. By focusing on a family of instances which adiabatic optimization solves in polynomial time, but require exponential time to solve using classical (thermal) simulated annealing, I will present numerical evidence as well as a work-in-progress proof that SQA can be exponentially faster than classical simulated annealing.

The study of ground spaces of local Hamiltonians is a fundamental task in condensed matter physics. In terms of computational complexity theory, a common focus in this area has been to estimate a given Hamiltonian’s ground state energy. However, from a physics perspective, it is sometimes more relevant to understand the structure of the ground space itself. In this talk, we pursue the latter direction by introducing the notion of “ground state connectivity” of local Hamiltonians. In particular, we show that determining how “connected” the ground space of a local Hamiltonian is can range from QCMA-complete to NEXP-complete. (Here, QCMA is the same as QMA, but with a classical witness.) As a result, we obtain a natural QCMA-complete problem, a task which has generally proven difficult since the conception of QCMA over a decade ago. 

In unidirectional communication theory, two of the most prominent problems are those of compressing a source of information and of transmitting data noiselessly over a noisy channel. In 1948, Shannon introduced information theory as a tool to address both of these problems. Since then, information theory has flourished into an important field of its own. It has also been successfully extended to the quantum setting, where it has also served to address questions about quantum source compression and transmission of classical and quantum data over noisy quantum channels.

However, in interactive communication theory, more specifically communication complexity, it is much more recently that tools from information theory have been successfully applied. Indeed, the interactive nature of communication protocols in this setting imposes new constraints and tools specific to this setting need to be developed, both for the interactive analogue of source compression and that of coding for noisy channels. The exciting field of classical interactive information theory has been very active in recent years.

We discuss recent works for its quantum counterpart. In particular, we discuss joint work showing that a constant factor overhead is sufficient for robustly implementing interactive quantum communication over noisy channels [1]. We also discuss work introducing a new notion of quantum information complexity that exactly captures the amortized cost per copy for implementing many copies of a communication task in parallel, such that compressing to this information complexity leads to a bounded-round direct sum theorem [2].

For both of these, we further discuss many interesting potential research directions that follow.

[1] joint work with Gilles Brassard, Ashwin Nayak, Alain Tapp, Falk Unger, QIP’14, FOCS’14 [2] Merge of arXiv:1404.3733 and arXiv:1409.4391, to appear at QIP’15

Quantum many-body systems ranging from a many-electron atom to a solid material are described by effective Hamiltonians which are obtained from more accurate Hamiltonians by neglecting or treating weak interactions perturbatively. Quantum complexity theory asks about the quantum computational power of such quantum many-body models for both practical as well as fundamental purposes. Three distinct computational classes have emerged within this framework: namely (1) classical Hamiltonians such as the Ising model, (2) sign-free or stoquastic Hamiltonians such as the transverse field Ising model, and (3) fully quantum Hamiltonians such as the Heisenberg model. Each class can be characterized by certain prototype universal Hamiltonians which can encode the physics of any other Hamiltonian in that class. We will show how this encoding is established through the use of perturbation theory via perturbative gadgets. We will discuss the technical expression of this classification in terms of the complexity classes NP, Stoquastic MA and QMA and the power of these Hamiltonians for performing quantum adiabatic computation.

Quantum information theory has taught us that quantum theory is just one possible probabilistic theory among many others. In the talk, I will argue that this "bird's-eye" perspective does not only allow us to derive the quantum formalism from simple physical principles, but also reveals surprising connections between the structures of spacetime and probability which can be phrased as mathematical theorems about information-theoretic scenarios.