Monday, June 26, 2017 — 2:30 PM EDT

Complexity of quantum impurity models

Sergey Bravyi, IBM Research

I will discuss classical and quantum algorithms for simulation of quantum impurity models. Such models describe a bath of free fermions coupled to a small interacting subsystem called an impurity. Hamiltonians of this form were famously studied by Anderson, Kondo, Wilson and others in 1960s.

More recently, impurity models found applications in DMFT simulations of strongly correlated fermionic systems. In this talk I will show that under very mild technical conditions ground states of impurity models can be efficiently prepared on a quantum computer. I will also describe a classical algorithm for approximating the ground energy of impurity models. The running time of our algorithm is polynomial in the system size and quasi-polynomial in the inverse approximation error. To arrive at these results we prove a general theorem characterizing correlations in the ground states of impurity models.

Based on a joint work with David Gosset

Location 
QNC - Quantum Nano Centre
1501
200 University Avenue West

Waterloo, ON N2L 3G1
Canada

S M T W T F S
30
31
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
1
2
3
  1. 2020 (21)
    1. October (1)
    2. September (3)
    3. August (2)
    4. June (4)
    5. April (1)
    6. March (3)
    7. February (5)
    8. January (2)
  2. 2019 (139)
    1. December (7)
    2. November (10)
    3. October (7)
    4. September (5)
    5. August (10)
    6. July (16)
    7. June (13)
    8. May (15)
    9. April (15)
    10. March (11)
    11. February (20)
    12. January (12)
  3. 2018 (144)
  4. 2017 (131)
  5. 2016 (88)
  6. 2015 (82)
  7. 2014 (94)
  8. 2013 (91)
  9. 2012 (122)
  10. 2011 (117)
  11. 2010 (41)
  12. 2009 (4)
  13. 2008 (1)
  14. 2005 (1)
  15. 2004 (3)