Quantum Information

Despite considerable effort, magic state distillation remains one of the leading candidates to achieve universal fault-tolerant quantum computation. However, when analyzing magic state distillation schemes, it is often assumed that gates belonging to the Clifford group can be implemented perfectly. In many current quantum technologies, two-qubit Cliffords gates are amongst the noisiest components of quantum computers. In this talk I will present a new scheme for preparing magic states with very low overhead that uses flag qubits. I will then compare our scheme to leading magic state distillation methods and show that the overhead can be reduced by orders of magnitude.

I will present a method for the implementation of a universal set of fault-tolerant logical gates using homological product codes. In particular, I will show how one can fault-tolerantly map between different encoded representations of a given logical state, enabling the application of different classes of transversal gates belonging to the underlying quantum codes. This allows for the circumvention of no-go results pertaining to universal sets of transversal gates and provides a general scheme for fault-tolerant computation while keeping the stabilizer generators of the code sparse.

Performing a quantum adiabatic optimization (AO) algorithm with the time-dependent Hamiltonian H(t) requires one to have some idea of the spectral gap γ(t) of H(t) at all times t. With only a promise on the size of the minimal gap γmin, a typical statement of the adiabatic theorem promises a runtime of either O(γmin-2) or worse. In this talk, I provide an explicit algorithm that, with access to an oracle that returns the spectral gap γ(t) to within some multiplicative constant, reliably performs QAO in time Õ(γmin-1) with at most O(log(γmin-1)) oracle queries. I then construct such an oracle using only computational basis measurements for the toy problem of a complete graph driving Hamiltonian on V vertices and arbitrary cost function. I explain why one cannot simply perform adiabatic Grover search and prove that one can still perform QAO in time Õ(V2/3)  without any a priori knowledge of γ(t). This work was done in collaboration with Brad Lackey, Aike Liu, and Kianna Wan.

In quanum physics, the von Neumann entropy usually arises in i.i.d settings, while single-shot settings are commonly characterized by smoothed min- or max-entropies. In this talk, I will discuss new results that give single-shot interpretations to the von Neumann entropy under appropriate conditions. I first present new results that give a single-shot interpretation to the Area Law of entanglement entropy in many-body physics in terms of compression of quantum information on the boundary of a region of space. Then I show that the von Neumann entropy governs single-shot transitions whenever one has access to arbitrary auxiliary systems, which have to remain invariant in a state-transition ("catalysts"), as well as a decohering environment. Getting rid of the decohering environment yields the "catalytic entropy conjecture", for which I present some supporting arguments.

If time permits, I also discuss some applications of these result to thermodynamics and speculate about consequences for quantum information theory and holography.

The role of coherence in quantum thermodynamics has been extensively studied in the recent years and it is now well-understood that coherence between different energy eigenstates is a resource independent of other thermodynamics resources, such as work. A fundamental remaining open question is whether the laws of quantum mechanics and thermodynamics allow the existence a "coherence distillation machine", i.e. a machine that, by possibly consuming work, obtains pure coherent states from mixed states, at a nonzero rate. This question is related to another fundamental question: Starting from many copies of noisy quantum clocks which are (approximately) synchronized with a reference clock, can we distill synchronized clocks in pure states, at a non-zero rate? In this paper we study quantities called "coherence cost" and "distillable coherence", which determine the rate of conversion of coherence in a standard pure state to general mixed states, and vice versa, in the context of quantum thermodynamics. We find that the coherence cost of any state (pure or mixed) is determined by its Quantum Fisher Information (QFI), thereby revealing a novel operational interpretation of this central quantity of quantum metrology. On the other hand, we show that, surprisingly, distillable coherence is zero for typical (full-rank) mixed states. Hence, we establish the impossibility of coherence distillation machines in quantum thermodynamics, which can be compared with the impossibility of perpetual motion machines or cloning machines. To establish this result, we introduce a new additive quantifier of coherence, called the "purity of coherence", and argue that its relation with QFI is analogous to the relation between the free and total energies in thermodynamics.

I’ll describe a novel application for near-term quantum computers with 50-70 qubits: namely, generating cryptographic random bits, whose randomness can be certified even if the quantum computer is untrusted (e.g., has been backdoored by an adversary).  Unlike schemes based on Bell inequality violation, ours requires only a single device able to solve classically hard sampling problems.  Our protocol harvests the outputs of the sampling process and feeds them into a randomness extractor, while occasionally verifying the outputs using exponential classical time.  I’ll also compare to the beautiful independent work of Brakerski et al., who proposed a scheme for the same problem that has much more efficient verification, but that probably can’t be implemented on near-term devices.  Paper still in preparation.

For many optimal measurement problems of interest, the problem may be re-cast as a semi-definite program, for which efficient numerical techniques are available. Nevertheless, numerical solutions give limited insight into more general instances of the problem, and further, analytical solutions may be desirable when an optimised measurement appears as a sub-problem in a larger problem of interest. I will discuss analytical techniques for finding optimal measurements for state discrimination with minimum error and present applications to studying the gap between the theoretically optimal measurement and simpler, experimentally achievable schemes for bi-partite measurement problems.

When a particle is accelerated, as in a scattering event, it will radiate gravitons and, if electrically charged, photons. The infrared tail of the spectrum of this radiation has a divergence: an arbitrarily small amount of total energy is divided into an arbitrarily large number of radiated bosons. Each of these in turn carries a momentum and a helicity degree of freedom, and thus this radiation carries significant amounts of quantum information. I will demonstrate that the infrared bosonic radiation causes nearly complete decoherence of the final state of the hard particles into the momentum basis. When applied to radiation coming from the incoming state, it appears that the entire dynamical history of the process will be distinguishable by the radiation, thus causing a loss of any interference effects between branches of an incoming momentum superposition, such as in a wavepacket. I will explain how infrared dressed states, in the framework of Fadeev and Kulish, evade this issue. Finally, I'll conclude with some remarks on the potential relevance of these issues to black hole information loss

[joint work with: Victor Albert, John Preskill (Caltech), Sepehr Nezami, Grant Salton, Patrick Hayden (Stanford University), and Fernando Pastawski (Freie Universität Berlin)]

Quantum error correction and symmetries are concepts that are relevant in many physical systems, such as in condensed matter physics and in holographic quantum gravity, and play a central role in error correction of reference frames [Hayden et al., arXiv:1709.04471]. I will show that codes that are covariant with respect to a continuous local symmetry necessarily have a limit to their ability to serve as approximate error-correcting codes against erasures at known locations. This is because the environment necessarily gets information about the global logical charge of the encoded state due to the covariance of the code. Our bound vanishes either in the limit of large individual subsystems, or in the limit of a large number of subsystems; in either case there exist codes which approximately achieve the scaling of our bound and become good covariant error-correcting codes. Our results can be interpreted as an approximate version of the Eastin-Knill theorem, quantifying to which extent it is not possible to carry out universal computation approximately on encoded states. In the context of holographic AdS/CFT, our approach provides some insight on time evolution in the bulk versus time evolution on the boundary. We expect further implications for symmetries in holography and in condensed matter physics.

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