Campusbibliothek
Normale Ansicht MARC ISBD

Discrete quantum walks on graphs and digraphs C. Godsil (University of Waterloo), H. Zhan (Simon Fraser University)

Von: Mitwirkende(r): Materialtyp: TextTextSprache: Englisch Reihen: ; 484 | London Mathematical Society Lecture note series / London Mathematical Society ; 484 | Verlag: Cambridge, United Kingdom New York, NY, USA Port Melbourne, Australia New Delhi, India Singapore Cambridge University Press 2023Beschreibung: xii, 138 Seiten IllustrationenInhaltstyp:
  • Text
Medientyp:
  • ohne Hilfsmittel zu benutzen
Datenträgertyp:
  • Band
ISBN:
  • 9781009261685
Schlagwörter: Andere physische Formen: Kein Titel; Erscheint auch als: Discrete quantum walks on graphs and digraphsLOC-Klassifikation:
  • QA166
Andere Klassifikation:
  • 05-01
  • 05C80
  • 60-01
  • 31.12
  • 31.76
Online-Ressourcen:
Inhalte:
Zusammenfassung: "Discrete quantum walks are quantum analogues of classical random walks. They are an important tool in quantum computing and a number of algorithms can be viewed as discrete quantum walks, in particular Grover's search algorithm. These walks are constructed on an underlying graph, and so there is a relation between properties of walks and properties of the graph. This book studies the mathematical problems that arise from this connection, and the different classes of walks that arise. Written at a level suitable for graduate students in mathematics, the only prerequisites are linear algebra and basic graph theory; no prior knowledge of physics is required. The text serves as an introduction to this important and rapidly developing area for mathematicians and as a detailed reference for computer scientists and physicists working on quantum information theory"--Andere Ausgaben: Erscheint auch als (Online-Ausgabe): / Godsil, C. D., - 1949-: Discrete quantum walks on graphs and digraphs
Exemplare
Medientyp Aktuelle Bibliothek Sammlung Standort Signatur Status Fälligkeitsdatum Barcode
Buch Buch Gebäude E2 3 (UdS Campusbibliothek für Informatik und Mathematik) Campusbibliothek für Informatik und Mathematik (E2 3) Series (B) LMS 484 (Regal durchstöbern(Öffnet sich unterhalb)) Verfügbar 9781009261685

Auf dem Umschlag: Chris Godsil and Hanmeng Zhan

Includes bibliographical references and index

Grover Search -- Two Reflections -- Applications -- Averaging -- Covers and Embeddings -- Vertex-Face Walks -- Shunts -- 1-Dimensional Walks.

"Discrete quantum walks are quantum analogues of classical random walks. They are an important tool in quantum computing and a number of algorithms can be viewed as discrete quantum walks, in particular Grover's search algorithm. These walks are constructed on an underlying graph, and so there is a relation between properties of walks and properties of the graph. This book studies the mathematical problems that arise from this connection, and the different classes of walks that arise. Written at a level suitable for graduate students in mathematics, the only prerequisites are linear algebra and basic graph theory; no prior knowledge of physics is required. The text serves as an introduction to this important and rapidly developing area for mathematicians and as a detailed reference for computer scientists and physicists working on quantum information theory"--

Godsil, C. D., - 1949-: Discrete quantum walks on graphs and digraphs

Impressum

Datenschutzhinweise

© 2023 Campusbibliothek für Informatik und Mathematik | GWDG

Powered by Koha