Verwandte Artikel zu Quantum Hamiltonian Complexity: 29 (Foundations and...
Quantum Hamiltonian Complexity: 29 (Foundations and Trends® in Theoretical Computer Science) - Softcover
Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Reseña del editor
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.
Reseña del editor
This book surveys the growing field of Quantum Hamiltonian Complexity, which includes the study of Quantum Constraint Satisfaction. In particular, the aim 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, it includes the following: The motivations and history of the field, a glossary of condensed matter physics terms explained in computer-science friendly language, overviews of central ideas from condensed matter physics, such as indistinguishable particles, mean field theory, tensor networks, and area laws, and brief expositions of selected computer science-based results in the area. For example, as part of the latter, the book provides a novel information theoretic presentation of Bravyi's polynomial time algorithm for Quantum 2-SAT.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
EUR 93,14
EUR 17,35 für den Versand von Vereinigtes Königreich nach Deutschland
Versandziele, Kosten & DauerNeu kaufen
Diesen Artikel anzeigen
EUR 94,61
Gratis für den Versand innerhalb von/der Deutschland
Versandziele, Kosten & DauerSuchergebnisse für Quantum Hamiltonian Complexity: 29 (Foundations and...
Foto des Verkäufers
Quantum Hamiltonian Complexity
Anbieter: moluna, Greven, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. KlappentextrnrnConstraint 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 stud. Bestandsnummer des Verkäufers 448249661
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Quantum Hamiltonian Complexity
Verlag:
now publishers Inc, 2015
ISBN 10: 1680830066
ISBN 13: 9781680830064
Neu
Paperback / softback
Anbieter: THE SAINT BOOKSTORE, Southport, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Paperback / softback. Zustand: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 239. Bestandsnummer des Verkäufers C9781680830064
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Quantum Hamiltonian Complexity
Anbieter: Rarewaves USA, OSWEGO, IL, USA
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: New. 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.This book 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. Bestandsnummer des Verkäufers LU-9781680830064
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Quantum Hamiltonian Complexity
Anbieter: Rarewaves USA United, OSWEGO, IL, USA
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: New. 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.This book 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. Bestandsnummer des Verkäufers LU-9781680830064
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Quantum Hamiltonian Complexity
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: As New. Unread book in perfect condition. Bestandsnummer des Verkäufers 24809270
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Quantum Hamiltonian Complexity
Anbieter: Rarewaves.com UK, London, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: New. 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.This book 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. Bestandsnummer des Verkäufers LU-9781680830064
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Quantum Hamiltonian Complexity
Print-on-DemandAnbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. Bestandsnummer des Verkäufers 9781680830064
Anzahl: 1 verfügbar
Foto des Verkäufers
Quantum Hamiltonian Complexity
Anbieter: Rarewaves.com USA, London, LONDO, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: New. 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.This book 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. Bestandsnummer des Verkäufers LU-9781680830064
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Quantum Hamiltonian Complexity (Foundations and Trends in Theoretical Computer Science)
Anbieter: Books Puddle, New York, NY, USA
Verkäuferbewertung 4 von 5 Sternen
Zustand: New. pp. 90. Bestandsnummer des Verkäufers 26373310668
Anzahl: 4 verfügbar
Beispielbild für diese ISBN
Quantum Hamiltonian Complexity (Foundations and Trends in Theoretical Computer Science)
Print-on-DemandAnbieter: Biblios, Frankfurt am main, HESSE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. PRINT ON DEMAND pp. 90. Bestandsnummer des Verkäufers 18373310662
Anzahl: 4 verfügbar