| 書目名稱 | Quantum Walks and Search Algorithms |
| 編輯 | Renato Portugal |
| 視頻video | http://file.papertrans.cn/782/781541/781541.mp4 |
| 概述 | Serves as the first textbook on Quantum Walks, which is an active area of research with growing interest.Features exercises and guidelines in each chapter to use or develop computer programs for simul |
| 叢書名稱 | Quantum Science and Technology |
| 圖書封面 |  |
| 描述 | .This book addresses an interesting area of quantum computation called quantum walks, which play an important role in building quantum algorithms, in particular search algorithms. Quantum walks are the quantum analogue of classical random walks..It is known that quantum computers have great power for searching unsorted databases. This power extends to many kinds of searches, particularly to the problem of finding a specific location in a spatial layout, which can be modeled by a graph. The goal is to find a specific node knowing that the particle uses the edges to jump from one node to the next..This book is self-contained with main topics that include:.Grover‘s algorithm, describing its geometrical interpretation and evolution by means of the spectral decomposition of the evolution operator.Analytical solutions of quantum walks on important graphs like line, cycles, two-dimensional lattices, and hypercubes using Fourier transforms.Quantum walks on generic graphs, describing methods to calculate the limiting distribution and mixing time.Spatial search algorithms, with emphasis on the abstract search algorithm (the two-dimensional lattice is used as an example).Szedgedy‘s quantum-wa |
| 出版日期 | Textbook 20131st edition |
| 關鍵詞 | Abstract Search Algorithms; Continuous-time Algorithms; Discrete-time Quantum Walks; Grover’s Algorithm |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-1-4614-6336-8 |
| isbn_ebook | 978-1-4614-6336-8Series ISSN 2364-9054 Series E-ISSN 2364-9062 |
| issn_series | 2364-9054 |
| copyright | Springer Science+Business Media New York 2013 |
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-6 12:51
發(fā)表于 2025-3-21 19:23:10
