Search Talks

I'll ask whether the knowledge of a single eigenstate of a local lattice Hamiltonian is sufficient to uniquely determine the Hamiltonian. I’ll present evidence that the answer is yes for generic local Hamiltonians, given either the ground state or an excited state. In fact, knowing only the correlation functions of local observables with respect to the eigenstate appears generically sufficient to exactly recover both the eigenstate and the Hamiltonian, with efficient numerical algorithms. I may also comment on the extension of these ideas to the continuum, pose questions about the behavior of generic local spin systems, or discuss the question of what happens if you don't know a preferred factorization of the Hilbert space.

The distillation of quantum resources such as entanglement and coherence forms one of the most fundamental protocols in quantum information and is of outstanding operational significance, but it is often characterized in the idealized asymptotic limit where an unbounded number of independent and identically distributed copies of a quantum system are available. Physical considerations necessarily limit the number of copies available as well as restrict our ability to perform coherent state manipulations over a large numbers of systems, which makes it crucial to be able to characterize how well we can distill resources in realistic, non-asymptotic settings.

We introduce a framework for the non-asymptotic characterization of two related operational tasks, the distillation as well as environment-assisted distillation of quantum coherence. We establish a complete description of the achievable rates of distillation in the one-shot setting under several different classes of free operations, which we show to correspond to the optimization of smoothed entropic quantities as semidefinite programs. We introduce a class of coherence measures which quantify the best achievable fidelity of distillation, and use them to obtain an explicit analytical characterization of coherence distillation for all pure states. Further, we provide insight into the distillation of entanglement, revealing new operational similarities and differences between the resource theories of coherence and entanglement.

This talk is based on joint work with Kun Fang, Xin Wang, and Gerardo Adesso (arxiv:1711.10512) as well as with Ludovico Lami and Alexander Streltsov (in preparation).

Quantum computers can only offer a computational advantage when they have sufficiently many qubits operating with sufficiently small error rates. In this talk, I will show how both these requirements can be practically characterized by variants of randomized benchmarking protocols. I will first show that a simple modification to protocols based on randomized benchmarking allows multiplicative-precision estimates of error rates.  I will then outline a new protocol for estimating the fidelity of arbitrarily large quantum systems using only single-qubit randomizing gates.