Perimeter Institute Quantum Discussions

A recent breakthrough in the condensed matter community is the identification and characterization of a rich set of ordered states, known as symmetry protected topological (SPT) phases. These phases are not only fascinating from the perspective of fundamental physics but have also found powerful applications in quantum computation. Very little is known about the thermal stability of SPT ordered systems, or whether their associated computational properties may survive at non-zero temperature. In this talk I will give a brief introduction to SPT phases of matter, and address the question of whether these phases can survive at non-zero temperature. In particular, I will focus on understanding the thermal stability and fault-tolerant properties of models studied in the theory of quantum computation.

We investigate the usefulness of ground states of quantum spin chains with symmetry-protected topological order (SPTO) for measurement-based quantum computation. We show that, in spatial dimension one, if an SPTO phase supports quantum wire, then, subject to an additional symmetry condition that is satisfied in all cases so far investigated, it can also be used for quantum computation. Joint work with Dongsheng Wang, Abhishodh Prakash, Tzu-Chieh Wei and David Stephen; See arXiv:1609.07549v1

Existing proposals for topological quantum computation have encountered
difficulties in recent years in the form of several ``obstructing'' results.
These are not actually no-go theorems but they do present some serious
obstacles. A further aggravation is the fact that the known topological
error correction codes only really work well in spatial dimensions higher
than three. In this talk I will present a method for modifying a higher
dimensional topological error correction code into one that can be embedded
into two (or three) dimensions. These projected codes retain at least some
of their higher-dimensional topological properties. The resulting subsystem
codes are not discrete analogs of TQFTs and as such they evade the usual
obstruction results. Instead they obey a discrete analog of a conformal
symmetry. Nevertheless, there are real systems which have these features,
and if time permits I'll discuss some of these. Many of them exhibit
strange low temperature behaviours that might even be helpful for
establishing finite temperature fault tolerance thresholds.

This research is still very much a work in progress... As such it has
numerous loose ends and open questions for further investigation. These
constructions could also be of interest to quantum condensed matter
theorists and may even be of interest to people who like weird-and-wonderful
spin models in general.

Given two sets X and Y, we consider synchronous correlations in a two-party nonlocal game with inputs X and outputs Y as a notion of generalized function between these sets (akin to a quantum graph homomorphism). We examine some structures in categories of synchronous classical, quantum, and nonsignalling strategies. We also provide analogues of Bell’s inequalities for such games when Y = {0,1}.

For a family of finite rate stabilizer codes, one can define two distinct error correction thresholds: the usual "block" threshold for the entire code, and the single-qubit threshold, where we only care about the stability of a single encoded qubit corresponding to a randomly chosen conjugate pair of logical X and Z operators.  Our main result is that in the case of erasures, for hyperbolic surface codes related to a {p,q} tiling of the hyperbolic plane, it is the latter threshold that coincides exactly with the infinite-graph edge percolation transition.  I will also discuss likely generalizations to more general codes and other error models. This is joint work with Nicolas Delfosse.

We prove that constant-depth quantum circuits are more powerful than their classical counterparts. We describe an explicit (i.e., non-oracular) computational problem which can be solved with certainty by a constant-depth quantum circuit composed of one- and two-qubit gates. In contrast, we prove that any classical probabilistic circuit composed of bounded fan-in gates that solves the problem with high probability must have depth logarithmic in the input size. This is joint work with Sergey Bravyi and Robert Koenig (arXiv:1704.00690).

As we get closer to build a quantum computer, the main remaining challenge is handling the noise that aflicts quantum systems.

Topological methods, in their various forms, have become the main contestants in the quest for succesfully overcoming noise. A good deal of their strength and versatility is due to their rather unique physical flavour, which keeps giving rise to surprising developments.

I will discuss the main driving forces behind my research on topological quantum error correction, as well as exciting recent directions, including unexpected connections with high energy physics.

Quantum Field Theories are interacting quantum systems described by an infinite number of degrees of freedom, necessarily living on an infinite-dimensional Hilbert space. Hence, many concepts from Quantum Information Theory have to be adapted before they can be applied to this setting. However, the task is worthwhile as we obtain new tools to understand the entanglement structure of theories describing the fundamental forces of nature. I will outline two approaches along this route, one bottom-down and one bottom-up strategy. First, general Lorentz invariant quantum fields are studied from a quantum information perspective. Second, I discuss the use of tensor networks to model the entanglement structure of quantum fields. The combination of both approaches yields new insights into Quantum Field Theory from an information theoretic point of view. I will end my talk by giving an outlook into future research directions.

It is commonly believed that quantum information is not lost in a black hole. Instead, it is encoded into non-local degrees of freedom in some clever way; like a quantum error-correcting code. In this talk, I will discuss recent attempts to resolve some paradoxes in quantum gravity by using the theory of quantum error-correction. First, I will introduce a simple toy model of the AdS/CFT correspondence based on tensor networks and demonstrate that the correspondence between the AdS gravity and CFT is indeed a realization of quantum codes. I will then show that the butterfly effect in black holes can be interpreted as non-local encoding of quantum information and can be quantitatively measured by out-of-time ordered correlations. Finally, I will discuss how out-of-time ordered correlations, measured outside the black hole horizon, may probe smoothness of the geometry across the horizon.

Demonstrating quantum supremacy, a complexity-guaranteed quantum advantage against over the best classical algorithms by using less universal quantum devices, is an important near-term milestone for quantum information processing. Here we develop a threshold theorem for quantum supremacy with noisy quantum circuits in the pre-threshold region, where quantum error correction does not work directly. By using the postselection argument, we show that the output sampled from the noisy quantum circuits cannot be simulated efficiently by classical computers based on a stable complexity theoretical conjecture, i.e., non-collapse of the polynomial hierarchy. By applying this to fault-tolerant quantum computation with the surface codes, we obtain the threshold value 2.84% for quantum supremacy, which is much higher than the standard threshold 0.75% for universal fault-tolerant quantum computation with the same circuit-level noise model. Moreover, contrast to the standard noise threshold, the origin of quantum supremacy in noisy quantum circuits is quite clear; the threshold is determined purely by the threshold of magic state distillation, which is essential to gain a quantum advantage.

A research line that has been very active recently in quantum information is that of recoverability theorems. These, roughly speaking, quantify how well can quantum information be restored after some general CPTP map, through particular 'recovery maps'. In this talk, I will outline what this line of work can teach us about quantum thermodynamics.

On one hand, dynamical semigroups describing thermalization, namely Davies maps, have the curious property of being their own recovery map, as a consequence of a condition named quantum detailed balance. For these maps, we derive a tight bound relating the entropy production at time t with the state of the system at time 2t, which puts a strong constraint on how systems reach thermal equilibrium. 
On the other hand, we also show how the Petz recovery map appears in the derivation of quantum fluctuation theorems, as the reversed work-extraction process. From this fact alone, we show how a number of useful expressions follow. These include a generalization of the majorization conditions that includes fluctuating work, Crooks and Jarzynski's theorems, and an integral fluctuation theorem that can be thought of as the second law as an equality.

Quantum tomography is an important tool for characterizing the parameters of unknown states, measurements, and gates.  Standard quantum tomography is the practice of estimating these parameters with known measurements, states, or both, respectively.  In recent years, it has become important to address the issue of working with systems where the ``devices'' used to prepare states and make measurements both have significant errors.  Of particular concern to me is whether such state-preparation and measurement errors are correlated with each other.  In this talk, I will share a solution to assessing such correlations with an object called a partial determinant.  Further, I will show how this technique suggests a perspective for such correlated quantum states and observables (over the space of device settings) is analogous to the non-holonomic perspectives of thermodynamic heat and work (over the macroscopic state space.)