Complexity of simulating quantum systems on classical computers

20
omplexity of simulating quantum system on classical computers Barbara Terhal IBM Research

description

Complexity of simulating quantum systems on classical computers. Barbara Terhal IBM Research. Computational Quantum Physics. - PowerPoint PPT Presentation

Transcript of Complexity of simulating quantum systems on classical computers

Page 1: Complexity of simulating quantum systems  on classical computers

Complexity of simulating quantum systems on classical computers

Barbara TerhalIBM Research

Page 2: Complexity of simulating quantum systems  on classical computers

Computational Quantum Physics

Computational quantum physicists (in condensed-matter physics, quantum chemistry etc.) have been in the business of showing how to simulate and understand properties of many-body quantum systems using a classical computer.

Heuristic and ad-hoc methods dominate, but the claim has been that these methods often work well in practice.

Quantum information science has and will contribute to computational quantum physics in several ways:

• Come up with better simulation algorithms

• Make rigorous what is done heuristically/approximately in computational physics.

• Delineate the boundary between what is possible and what is not. That is: show that certain problems are hard for classical (or even quantum) computers in a complexity sense.

Page 3: Complexity of simulating quantum systems  on classical computers

Physically-Relevant Quantum States

local interactions are between O(1) degrees of freedom (e.g. qubits)

Page 4: Complexity of simulating quantum systems  on classical computers

Efficient Classical Descriptions

Page 5: Complexity of simulating quantum systems  on classical computers

Matrix Product States

Page 6: Complexity of simulating quantum systems  on classical computers

1st Generalization: Tree Tensor Product States

Page 7: Complexity of simulating quantum systems  on classical computers

2nd Generalization: Tensor Product States or PEPS

Page 8: Complexity of simulating quantum systems  on classical computers

Properties of MPS and Tree-TPS

Page 9: Complexity of simulating quantum systems  on classical computers

Properties of tensor product states

PEPS and TPS perhaps too general for classical simulation purposes

Page 10: Complexity of simulating quantum systems  on classical computers

Quantum Circuit Point of View

Past Light ConeMax width

Page 11: Complexity of simulating quantum systems  on classical computers

Quantum Circuit Point of View

Page 12: Complexity of simulating quantum systems  on classical computers

Quantum Circuit Point of View

Page 13: Complexity of simulating quantum systems  on classical computers

Area Law

Page 14: Complexity of simulating quantum systems  on classical computers

Classical Simulations of Dynamics

Page 15: Complexity of simulating quantum systems  on classical computers

Lieb-Robinson Bounds

Bulk Past Light Cone B

ALieb-Robinson Bound: Commutator of operator A with backwards propagated B decays exponentially with distance betweenA and B, when A is outside B’s effective past light-cone.

Page 16: Complexity of simulating quantum systems  on classical computers

Stoquastic Hamiltonians

Page 17: Complexity of simulating quantum systems  on classical computers

Examples of Stoquastic Hamiltonians

Particles in a potential; Hamiltonian is a sum of a diagonal potential term in position |x> and off-diagonal negative kinetic terms (-d2/dx2).All of classical and quantum mechanics.Quantum transverse Ising model Ferromagnetic Heisenberg models (modeling interacting spins on lattices)Jaynes-Cummings Hamiltonian (describing atom-laser interaction), spin-boson model, bosonic Hubbard models, Bose-Einstein condensates etc. D-Wave’s Orion quantum computer…Non-stoquastic are typically fermionic systems, charged particles in a magnetic field.

Stoquastic Hamiltonians are ubiquitous in nature.

Note that we only consider ground-state properties of these Hamiltonians.

Page 18: Complexity of simulating quantum systems  on classical computers

Stoquastic Hamiltonians

Page 19: Complexity of simulating quantum systems  on classical computers

Frustration-Free Stoquastic Hamiltonians

Page 20: Complexity of simulating quantum systems  on classical computers

Conclusion