Quantum Information

Suppose the eigenvalue distributions of two matrices $M_1$ and $M_2$ are known. What is the eigenvalue distribution of the sum $M_1+M_2$? This problem has a rich pure mathematics history dating back to H. Weyl (1912) with many applications in various fields. Free probability theory (FPT) answers this question under certain conditions, which often involves some degree of randomness (disorder). We will describe FPT and show examples of its powers for the qualitative understanding (often approximations) of physical quantities such as density of states, and gapped vs. gapless phases of some Floquet systems. These physical quantities are often hard to compute exactly. Nevertheless, using FPT and other ideas from random matrix theory excellent approximations can be obtained. Besides the applications presented, we believe the techniques will find new applications in new contexts.

When a system interacts with an environment with which it is initially uncorrelated, its evolution is described by a completely positive map.  The common wisdom in the field of quantum information theory, however, is that when the system is initially correlated with the environment, the map describing its evolution may fail to be completely positive. This has motivated many researchers to try and characterize this putatively more general sort of dynamics, and even the textbook of Nielsen and Chuang suggests that "It is an interesting problem for further research to study quantum information processing beyond the quantum operations formalism."  This talk will demonstrate that this common wisdom is mistaken.  The error can be traced to the standard argument for how the evolution map ought to be defined in such circumstances.  One can show that anomolous dynamics would arise even in completely classical examples if one were to follow the prescription of the standard argument.  The framework of classical causal models specifies how dynamics ought to be defined in such circumstances, and

the quantum analogue of this framework provides the correct definition of the quantum evolution map, which is found to be always completely positive.

Joint work with David Schmid

Port-based teleportation (PBT) is a variant of the well-known task of quantum teleportation in which Alice and Bob share multiple entangled states called "ports". While in the standard teleportation protocol using a single entangled state the receiver Bob has to apply a non-trivial correction unitary, in PBT he merely has to pick up the right quantum system at a port specified by the classical message he received from Alice. PBT has applications in instantaneous non-local computation and can be used to attack position-based quantum cryptography. Since perfect PBT protocols are impossible, there is a trade-off between error and entanglement consumption (or the number of ports), which can be analyzed using representation theory of the symmetric and unitary groups. In particular, without loss of generality the resource state can be assumed to have a “purified" Schur-Weyl duality symmetry. I will give an introduction to the task of PBT and its symmetries, and show how the asymptotics of existing formulas for the optimal performance for a given number of ports can be derived using a connection between representation theory and the Gaussian unitary ensemble.

Joint work with M. Christandl, C. Majenz, G. Smith, F. Speelman & M. Walter

Several equivalent formulations of quantum error correction condition will be introduced. Subtleties arise

when the error correction conditions hold only approximately. We will discuss an equivalent formulation that is 

robust to the approximation error. One can leverage this tool to derive the existence of approximate quantum

error correcting code at low energy subspace of CFT that reproduces aspects of the holographic quantum error

correcting code. Using the same tool, we observe that two operators with greatly differing complexity approximately

commute in an appropriate code subspace. This leads to a notion of bulk locality in the entanglement shadow,

but the precise definition of complexity seems to play an important role in determining how well these operators commute

in the subspace.

Randomness is an essential tool in many disciplines of modern sciences, such as cryptography, black hole physics, random matrix theory, and Monte Carlo sampling. In quantum systems, random operations can be obtained via random circuits thanks to so-called q-designs and play a central role in condensed-matter physics and in the fast scrambling conjecture for black holes. Here, we consider a more physically motivated way of generating random evolutions by exploiting the many-body dynamics of a quantum system driven with stochastic external pulses. We combine techniques from quantum control, open quantum systems, and exactly solvable models (via the Bethe ansatz) to generate Haar-uniform random operations in driven many-body systems. We show that any fully controllable system converges to a unitary q-design in the long-time limit. Moreover, we study the convergence time of a driven spin chain by mapping its random evolution into a semigroup with an integrable Liouvillian and finding its gap. Remarkably, we find via Bethe-ansatz techniques that the gap is independent of q. We use mean-field techniques to argue that this property may be typical for other controllable systems, although we explicitly construct counterexamples via symmetry-breaking arguments to show that this is not always the case. Our findings open up new physical methods to transform classical randomness into quantum randomness, via a combination of quantum many-body dynamics and random driving.

Reference: L. Banchi, D. Burgarth, M. J. Kastoryano, Phys. Rev. X 7, 041015 (2017)