EUVIMEDEUVIMED entdecken
Crossref

Quantum Hamiltonian Complexity

Sevag Gharibian, Yichen Huang, Zeph Landau, Seung Woo Shin

Foundations and Trends® in Theoretical Computer Science · 13.10.2015 · 10 (3) · 159-282

DOI: 10.1561/0400000066 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Foundations and Trends® in Theoretical Computer Science, online erschienen am 13.10.2015. Verfasst von Sevag Gharibian und 3 weiteren Autor:innen. Die Arbeit wurde bisher 108-mal zitiert (Crossref) und nennt 180 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Constraint satisfaction problems are a central pillar of modern computational complexity theory. This survey provides an introduction to the rapidly growing field of Quantum Hamiltonian Complexity, which includes the study of quantum constraint satisfaction problems. Over the past decade and a half, this field has witnessed fundamental breakthroughs, ranging from the establishment of a “Quantum Cook-Levin Theorem” to deep insights into the structure of 1D low-temperature quantum systems via so-called area laws. Our aim here is to provide a computer science-oriented introduction to the subject in order to help bridge the language barrier between computer scientists and physicists in the field. As such, we include the following in this survey: (1) The motivations and history of the field, (2) a glossary of condensed matter physics terms explained in computer-science friendly language, (3) overviews of central ideas from condensed matter physics, such as indistinguishable particles, mean field theory, tensor networks, and area laws, and (4) brief expositions of selected computer science-based results in the area. For example, as part of the latter, we provide a novel information theoretic presentation of Bravyi’s polynomial time algorithm for Quantum 2-SAT.

Zitieren

APA

Gharibian, S., Huang, Y., Landau, Z., & Shin, S. W. (2015). Quantum Hamiltonian Complexity. Foundations and Trends® in Theoretical Computer Science, 10(3), 159-282. https://doi.org/10.1561/0400000066

Vancouver

Gharibian S, Huang Y, Landau Z, Shin SW. Quantum Hamiltonian Complexity. Foundations and Trends® in Theoretical Computer Science. 2015;10(3):159-282. doi:10.1561/0400000066

BibTeX
@article{Gharibian2015,
  author = {Gharibian, Sevag and Huang, Yichen and Landau, Zeph and Shin, Seung Woo},
  title = {Quantum Hamiltonian Complexity},
  journal = {Foundations and Trends® in Theoretical Computer Science},
  year = {2015},
  volume = {10},
  number = {3},
  pages = {159--282},
  doi = {10.1561/0400000066}
}
Kostenlos starten →