Back to Results
First PageMeta Content
Applied mathematics / Adiabatic quantum computation / QMA / Quantum computer / Quantum annealing / Perturbation theory / Quantum field theory / Continuous quantum computation / Theoretical computer science / Physics / Quantum mechanics


On complexity of the quantum Ising model Sergey Bravyi∗ Matthew Hastings† Abstract
Add to Reading List

Document Date: 2014-11-28 23:30:58


Open Document

File Size: 198,99 KB

Share Result on Facebook

Company

Suzuki / Cambridge University Press / Sandvik / /

IndustryTerm

area law / quantum annealing algorithms / high-energy simulator / chemical potential / adiabatic quantum computing / lowest energy scale / low-energy target / spin systems / Polynomial-time approximation algorithms / quantum spin systems / energy scale / quantum manybody systems / ground state energy / low-energy / simulation algorithms / adiabatic algorithms / quantum many-body systems / free energy / ground state energy problem / quantum adiabatic evolution algorithm / quantum adiabatic algorithm / /

Organization

Cambridge University / /

Person

Sergey Bravyi∗ Matthew Hastings / /

Position

RT / quantum Ising model / /

ProgrammingLanguage

J / T / /

Technology

quantum annealing algorithms / Polynomial-time approximation algorithms / classical Monte Carlo simulation algorithms / Quantum adiabatic algorithms / simulation / quantum adiabatic evolution algorithm / quantum adiabatic algorithm / /

SocialTag