Quantum Information

Stabilizer states are a rich class of quantum states which can be efficiently classically represented and manipulated. In this talk I will describe some ways in which they can help us to represent and manipulate more general quantum states. I will discuss classical simulation algorithms for quantum circuits which are based on expressing a quantum state as a superposition of (as few as possible) stabilizer states.

Based on arXiv:1601.07601 (with Sergey Bravyi) and work in progress with Sergey Bravyi, Dan Browne, Padraic Calpin, Earl Campbell and Mark Howard.

Adiabatic quantum computation (AQC) is a method for performing universal quantum computation in the ground state of a slowly evolving local Hamiltonian, and in an ideal setting AQC is known to capture all of the computational power of the  quantum circuit model.  However, despite having an inherent robustness to noise as a result of the adiabatic theorem and the spectral gap of the Hamiltonian, it has been a longstanding theoretical challenge to show that fault-tolerant AQC can in principle be performed below some fixed noise threshold.  There are many aspects to this challenge, including the difficulty of adapting known ideas from circuit model fault-tolerance as well as the need to develop an error model that is appropriately tailored for open system AQC.  In this talk I will introduce a scheme for combining Feynman-Kitaev history state Hamiltonians with topological quantum error correction, in order to show that universal quantum computation can be encoded not only in the ground state but also in the finite temperature Gibbs state of a local Hamiltonian.  Using only local interactions with bounded strength and a polynomial overhead in the number of qubits, the scheme is intended to serve as a proof of principle that universal AQC can be performed at non-zero temperature, and also to further our understanding of the complexity of highly entangled quantum systems in thermal equilibrium.

The entanglement properties of random quantum states or dynamics are important to the study of a broad spectrum of disciplines of physics, ranging from quantum information to high energy and many-body physics. This work investigates the interplay between the degrees of entanglement and randomness in pure states and unitary channels, by employing tools from random matrix theory, representation theory, combinatorics, Weingarten calculus etc. We reveal strong connections between designs (distributions of states or unitaries that match certain moments of the uniform Haar measure) and generalized entropies (entropic functions that depend on certain powers of the density operator), by showing that Renyi entanglement entropies averaged over designs of the same order are almost maximal. This strengthens the celebrated Page's theorem. Moreover, we find that designs of an order that is logarithmic in the dimension maximize all Renyi entanglement entropies, and so are completely random in terms of the entanglement spectrum. Our results relate the behaviors of Renyi entanglement entropies to the complexity beyond scrambling/thermalization/chaos in terms of the degree of randomness, and suggest a generalization of the fast scrambling conjecture.  (Refs: 1703.08104, 1709.04313)

(1) Entanglement-enhanced quantum sensing: parameter estimation and hypothesis testing.
(2) Security from entanglement: quantum key distribution.
(3) Entanglement enhanced communication: channel capacity and additivity issues.
(4) Some open problems.

We discuss some applications of a result on the convex combination of the quantum states (that we refer to as convex-split technique) and its variants. In the framework of Quantum Resource theory, we provide an operational way of characterizing the amount of resource in a given quantum state, for a large class of resource theories. Our results use the convex-split technique in the achievability proof, with a matching converse in the one-shot setting.  Building upon the ideas involved in this achievability proof, we show how the technique (and its close counterpart of position-based decoding) can lead to a large family of entanglement-assisted protocols for quantum communication. We sketch close connections between these protocols and the port-based teleportation scheme of Ishizaka and Hiroshima [Phys. Rev. Lett. 101, 240501]. We exploit these connections to obtain a new protocol for entanglement assisted point to point quantum channel coding in the asymptotic and i.i.d. setting, with the rate of entanglement cost and achievable communication matching that of Bennett et. al. [IEEE Trans. Inf. Theory, 48, 2002].  Based on the works arXiv:1410.3031,  arXiv:1708.00381,   arXiv:1702.01940.