Picture 1 of 1
Stock photo
Picture 1 of 1
Stock photo
Foundations and Trends in Theoretical Computer Science Ser.: Quantum Hamiltonian Complexity by Seung Woo Shin, Zeph Landau, Yichen Huang and Sevag Gharibian (2015, Trade Paperback)
Rarewaves (643511)
98.2% positive feedback
Price:
US $139.96
ApproximatelyPHP 7,863.09
+ $3.99 shipping
Returns:
30 days return. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.
Condition:
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
About this product
Product Identifiers
PublisherNow Publishers
ISBN-101680830066
ISBN-139781680830064
eBay Product ID (ePID)222723207
Product Key Features
Number of Pages140 Pages
LanguageEnglish
Publication NameQuantum Hamiltonian Complexity
Publication Year2015
SubjectComputer Science
TypeTextbook
AuthorSeung Woo Shin, Zeph Landau, Yichen Huang, Sevag Gharibian
Subject AreaComputers
SeriesFoundations and Trends in Theoretical Computer Science Ser.
FormatTrade Paperback
Dimensions
Item Height0.3 in
Item Weight7.3 Oz
Item Length9.2 in
Item Width6.1 in
Additional Product Features
Intended AudienceScholarly & Professional
Series Volume NumberVol. 29
IllustratedYes
Table Of Content1: Introduction 2: Preliminaries 3: Roadmap and Organization 4: A Brief History 5: Motivations From Physics 6: Physics Concepts in Greater Depth 7: Reviews of Selected Results. Acknowledgements. References
SynopsisThis monograph provides an introduction to the rapidly growing field of Quantum Hamiltonian Complexity, which includes the study of quantum constraint satisfaction problems. It provides a computer science-oriented introduction to the subject in order to help bridge the language barrier between computer scientists and physicists in the field., Constraint satisfaction problems are a central pillar of modern computational complexity theory. This monograph provides an introduction to the rapidly growing field of Quantum Hamiltonian Complexity (QHC), 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. Quantum Hamiltonian Complexity provides the reader with 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, it includes the following: (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, it provides a novel information theoretic presentation of Bravyi's polynomial time algorithm for Quantum 2-SAT. Quantum Hamiltonian Complexity reviews some of the most fundamental results in QHC and is an ideal reference for computer scientists with little or no background in quantum information.
Be the first to write a review
