Discrete quantum walks on graphs and digraphs:
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 i...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Cambridge ; New York, NY
Cambridge University Press
2023
|
| Series: | London Mathematical Society lecture note series
484 |
| Subjects: | |
| Online Access: | DE-12 DE-634 DE-92 Volltext |
| Summary: | 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 |
| Item Description: | Title from publisher's bibliographic system (viewed on 10 Jan 2023) Grover Search -- Two Reflections -- Applications -- Averaging -- Covers and Embeddings -- Vertex-Face Walks -- Shunts -- 1-Dimensional Walks |
| Physical Description: | 1 Online-Ressource (xii, 136 Seiten) |
| ISBN: | 9781009261692 |
| DOI: | 10.1017/9781009261692 |
Staff View
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV048691149 | ||
| 003 | DE-604 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 230203s2022 xx o|||| 00||| eng d | ||
| 020 | |a 9781009261692 |c Online |9 978-1-00-926169-2 | ||
| 024 | 7 | |a 10.1017/9781009261692 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9781009261692 | ||
| 035 | |a (OCoLC)1369557838 | ||
| 035 | |a (DE-599)BVBBV048691149 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 |a DE-634 | ||
| 082 | 0 | |a 511/.5 | |
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 100 | 1 | |a Godsil, Chris |d 1949- |0 (DE-588)122991893 |4 aut | |
| 245 | 1 | 0 | |a Discrete quantum walks on graphs and digraphs |c C. Godsil, H. Zhan |
| 264 | 1 | |a Cambridge ; New York, NY |b Cambridge University Press |c 2023 | |
| 300 | |a 1 Online-Ressource (xii, 136 Seiten) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a London Mathematical Society lecture note series | |
| 490 | 0 | |a 484 | |
| 500 | |a Title from publisher's bibliographic system (viewed on 10 Jan 2023) | ||
| 500 | |a Grover Search -- Two Reflections -- Applications -- Averaging -- Covers and Embeddings -- Vertex-Face Walks -- Shunts -- 1-Dimensional Walks | ||
| 520 | |a 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 | ||
| 650 | 4 | |a Graph theory | |
| 650 | 4 | |a Matrices | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Quantum computing | |
| 650 | 4 | |a Discrete mathematics | |
| 700 | 1 | |a Zhan, Hanmeng |d ca. 20./21. Jh. |0 (DE-588)1279977949 |4 aut | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-1-00-926168-5 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/9781009261692 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-034065356 | |
| 966 | e | |u https://doi.org/10.1017/9781009261692 |l DE-12 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/9781009261692 |l DE-634 |p ZDB-20-CBO |q BTU_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/9781009261692 |l DE-92 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
Record in the Search Index
| _version_ | 1820882863175761920 |
|---|---|
| adam_text | |
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Godsil, Chris 1949- Zhan, Hanmeng ca. 20./21. Jh |
| author_GND | (DE-588)122991893 (DE-588)1279977949 |
| author_facet | Godsil, Chris 1949- Zhan, Hanmeng ca. 20./21. Jh |
| author_role | aut aut |
| author_sort | Godsil, Chris 1949- |
| author_variant | c g cg h z hz |
| building | Verbundindex |
| bvnumber | BV048691149 |
| classification_rvk | SK 890 |
| collection | ZDB-20-CBO |
| ctrlnum | (ZDB-20-CBO)CR9781009261692 (OCoLC)1369557838 (DE-599)BVBBV048691149 |
| dewey-full | 511/.5 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511/.5 |
| dewey-search | 511/.5 |
| dewey-sort | 3511 15 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| discipline_str_mv | Mathematik |
| doi_str_mv | 10.1017/9781009261692 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000zc 4500</leader><controlfield tag="001">BV048691149</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">230203s2022 xx o|||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781009261692</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-00-926169-2</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/9781009261692</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9781009261692</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1369557838</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV048691149</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.5</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Godsil, Chris</subfield><subfield code="d">1949-</subfield><subfield code="0">(DE-588)122991893</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Discrete quantum walks on graphs and digraphs</subfield><subfield code="c">C. Godsil, H. Zhan</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge ; New York, NY</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2023</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xii, 136 Seiten)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">London Mathematical Society lecture note series</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">484</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 10 Jan 2023)</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Grover Search -- Two Reflections -- Applications -- Averaging -- Covers and Embeddings -- Vertex-Face Walks -- Shunts -- 1-Dimensional Walks</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Matrices</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Quantum computing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Discrete mathematics</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhan, Hanmeng</subfield><subfield code="d">ca. 20./21. Jh.</subfield><subfield code="0">(DE-588)1279977949</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">978-1-00-926168-5</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/9781009261692</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-034065356</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/9781009261692</subfield><subfield code="l">DE-12</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/9781009261692</subfield><subfield code="l">DE-634</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BTU_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/9781009261692</subfield><subfield code="l">DE-92</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV048691149 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T21:27:29Z |
| indexdate | 2025-01-10T17:13:39Z |
| institution | BVB |
| isbn | 9781009261692 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-034065356 |
| oclc_num | 1369557838 |
| open_access_boolean | |
| owner | DE-12 DE-92 DE-634 |
| owner_facet | DE-12 DE-92 DE-634 |
| physical | 1 Online-Ressource (xii, 136 Seiten) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO BTU_PDA_CBO ZDB-20-CBO FHN_PDA_CBO |
| publishDate | 2023 |
| publishDateSearch | 2022 |
| publishDateSort | 2022 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | London Mathematical Society lecture note series 484 |
| spelling | Godsil, Chris 1949- (DE-588)122991893 aut Discrete quantum walks on graphs and digraphs C. Godsil, H. Zhan Cambridge ; New York, NY Cambridge University Press 2023 1 Online-Ressource (xii, 136 Seiten) txt rdacontent c rdamedia cr rdacarrier London Mathematical Society lecture note series 484 Title from publisher's bibliographic system (viewed on 10 Jan 2023) 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 Graph theory Matrices Algorithms Quantum computing Discrete mathematics Zhan, Hanmeng ca. 20./21. Jh. (DE-588)1279977949 aut Erscheint auch als Druck-Ausgabe 978-1-00-926168-5 https://doi.org/10.1017/9781009261692 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Godsil, Chris 1949- Zhan, Hanmeng ca. 20./21. Jh Discrete quantum walks on graphs and digraphs Graph theory Matrices Algorithms Quantum computing Discrete mathematics |
| title | Discrete quantum walks on graphs and digraphs |
| title_auth | Discrete quantum walks on graphs and digraphs |
| title_exact_search | Discrete quantum walks on graphs and digraphs |
| title_exact_search_txtP | Discrete quantum walks on graphs and digraphs |
| title_full | Discrete quantum walks on graphs and digraphs C. Godsil, H. Zhan |
| title_fullStr | Discrete quantum walks on graphs and digraphs C. Godsil, H. Zhan |
| title_full_unstemmed | Discrete quantum walks on graphs and digraphs C. Godsil, H. Zhan |
| title_short | Discrete quantum walks on graphs and digraphs |
| title_sort | discrete quantum walks on graphs and digraphs |
| topic | Graph theory Matrices Algorithms Quantum computing Discrete mathematics |
| topic_facet | Graph theory Matrices Algorithms Quantum computing Discrete mathematics |
| url | https://doi.org/10.1017/9781009261692 |
| work_keys_str_mv | AT godsilchris discretequantumwalksongraphsanddigraphs AT zhanhanmeng discretequantumwalksongraphsanddigraphs |