David Gosset: Complexity of quantum impurity problems

Subscribers:
351,000
Published on ● Video Link: https://www.youtube.com/watch?v=kdXD975Tnog



Duration: 32:35
603 views
3


"We give a quasi-polynomial time classical algorithm for estimating the ground state energy and for computing low energy states of quantum impurity models. Such models describe a bath of free fermions coupled to a small interacting subsystem called an impurity. The full system consists of $n$ fermionic modes and has a Hamiltonian $H=H_0+H_{imp}$,where $H_0$ is quadratic in creation-annihilation operators and
$H_{imp}$ is an arbitrary Hamiltonian acting on a subset of $O(1)$ modes.
We show that the ground energy of $H$ can be approximated with an additive error $2^{-b}$ in time $n^3 \exp{[O(b^3)]}$. Our algorithm also finds a low energy state that achieves this approximation. The low energy state is represented as a superposition of $\exp{[O(b^3)]}$ fermionic Gaussian states. To arrive at this result we prove several theorems concerning exact ground states of impurity models.
In particular, we show that eigenvalues of the ground state covariance matrix decay
exponentially with the exponent depending very mildly on the spectral gap of $H_0$.
A key ingredient of our proof is Zolotarev's rational approximation to the $\sqrt{x}$ function. We anticipate that our algorithms may be used in hybrid quantum-classical simulations of strongly correlated materials
based on dynamical mean field theory. We implemented a simplified practical version of our algorithm and benchmarked it using the single impurity Anderson model."




Other Videos By Microsoft Research


2017-01-31Li Gao: Capacity estimates for TRO channels
2017-01-31Anna Vershynina: Geometric inequalities and contractivity of bosonic semigroups
2017-01-31Rotem Arnon-Friedman: Entropy accumulation in device-independent protocols
2017-01-31Giacomo De Palma: Gaussian optimizers in quantum information
2017-01-31Sergey Bravyi: Improved classical simulation of quantum circuits dominated by Clifford gates
2017-01-31William Slofstra:Tsirelson’s problem & an embedding theorem for groups arising from non-local games
2017-01-31Keisuke Fujii: Threshold theorem for quantum supremacy
2017-01-31Kai-Min Chung: General randomness amplification with non-signaling security
2017-01-31Anand Natarajan: Robust self-testing of many qubit states
2017-01-31Andras Gilyen: On preparing ground states of gapped Hamiltonians
2017-01-31David Gosset: Complexity of quantum impurity problems
2017-01-31Thomas Vidick: Rigorous RG algorithms and area laws for low energy eigenstates in 1D
2017-01-31Giulio Chiribella: Optimal compression for identically prepared qubit states
2017-01-31James Lee: Spectrahedral lifts and quantum learning
2017-01-31Optimal Hamiltonian simulation by quantum signal processing
2017-01-31Shalev Ben-David: Sculpting quantum speedups
2017-01-31David Sutter: Multivariate trace inequalities
2017-01-31Mischa Woods: Applications of recoverability in quantum information
2017-01-31Anand Natarajan: Limitations of semidefinite programs for separable states and entangled games
2017-01-31A parallel repetition theorem for all entangled games
2017-01-31Guillaume Dauphinais: Fault-tolerant error correction for non-abelian anyons



Tags:
microsoft research