This series consists of talks in the area of Quantum Information Theory.
In the closed system setting I will show how to obtain extremely accurate adiabatic QC by proper choice of the interpolation between the initial and final Hamiltonians. Namely, given an analytic interpolation whose first N initial and final time derivatives vanish, the error can be made to be smaller than 1/N^N, with an evolution time which scales as N and the square of the norm of the time-derivative of the Hamiltonian, divided by the cube of the gap (joint work with Ali Rezakhani and Alioscia Hamma).
There are many results showing that the probability of entanglement is high for large dimensions. Recently, Arveson showed that the probability of entanglement is zero when the rank of a bipartite state is no larger than half the dimension of the smaller space. We show that that the probability of entanglement is zero when the rank of a bipartite state is no larger than half the maximum of the rank of its two reduced density matrices. Our approach is quite different from that of Arveson and uses a different measure.
A recent breakthrough in quantum computing has been the realization that quantum computation can proceed solely through single-qubit measurements on an appropriate quantum state - for example, the ground state of an interacting many-body system. It would be unfortunate, however, if the usefulness of a ground state for quantum computation was critically dependent on the details of the system\'s Hamiltonian; a much more powerful result would be the existence of a robust ordered phase which is characterized by the ability to perform measurement-based quantum computation (MBQC).
This is a talk in two parts. The first part is on evolution of a system under a Hamiltonian. First, a general method for implementing evolution under a Hamiltonian using entanglement and classical communication is presented. This method improves on previous methods by requiring less entanglement and communication, as well as allowing more general Hamiltonians to be implemented. Next, a method for simulating evolution under a sparse Hamiltonian using a quantum computer is presented.
We define a measure of the quantumness of correlations, based on the operative task of local broadcasting of a bipartite state. Such a task is feasible for a state if and only if it corresponds to a joint classical probability distribution, or, in other terms, it is strictly classically correlated. A gap, defined in terms of quantum mutual information, can quantify the degree of failure in fulfilling such a task, therefore providing a measure of how non-classical a given state is.
I will present an efficient quantum algorithm for an additive
approximation of the famous Tutte polynomial of any planar graph at
any point. The Tutte polynomial captures an extremely wide range of
interesting combinatorial properties of graphs, including the
partition function of the q-state Potts model. This provides a new
class of quantum complete problems.
Thermodynamics places surprisingly few fundamental constraints on
information processing. In fact, most people would argue that it imposes
only one, known as Landauer's Principle: a process erasing one bit of
information must release an amount kT ln 2 of heat. It is this simple
observation that finally led to the exorcism of Maxwell's Demon from
statistical mechanics, more than a century after he first appeared.
Ignoring the lesson implicit in this early advance, however, quantum
In this talk I will expose different results concerning the properties of quantum many-body systems: on the one hand, I will introduce the concept of fine-grained entanglement loss together with its relation with majorization relations along parameter flows and Renormalization Group flows. The machinery of Conformal Field Theory will allow us to derive very general analytical properties, and some examples -like the XY quantum spin chain- will also be considered.
I will discuss the design of degenerate quantum error correcting codes for an arbitrary Pauli channel. At noise levels slightly beyond those for which a random stabilizer code does not allow high fidelity transmission with a nonzero rate, our codes usually have a rate which is strictly positive. In fact, there exist Pauli channels for which our codes outperform a random stabilizer code whenever the random coding rate is less than 0.04, which is a couple of orders of magnitude larger than the previous examples of this effect.