Search Talks

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)

In quantum Shannon theory, the way information is encoded and decoded takes advantage of the laws of quantum mechanics, while the way communication channels are interlinked is assumed to be classical. In this talk, I will relax the assumption that quantum channels are combined classically, and I will show that, in certain situations, combining quantum channels in an indefinite causal order allows us to achieve tasks that are impossible in conventional quantum Shannon theory. Specifically, I will show a phenomenon of causal activation, whereby two identical copies of a completely depolarizing channel become able to transmit information when they are combined in a quantum superposition of two alternative orders. This finding runs counter to the intuition that if two communication channels are identical, using them in different orders should not make any difference.

In this talk, I will discuss two important cryptographic tasks in a post-quantum world. I will discuss the impossibility of bit-commitment and the possibility of physically unforgeable money in the framework of Generalized Probabilistic Theories. Our proofs rely crucially on cone programming, a natural generalization of semidefinite programming. This is based on work with John Selby, arXiv:1803.10279 and arXiv:1711.02662.