Название: Discrete Quantum Walks on Graphs and Digraphs Автор: Godsil C., Zhan H. Издательство: Cambridge University Press Год: 2023 Формат: PDF Страниц:151 Размер: 10,1 МБ Язык: English
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.
Quantum Computing Fundamentals Название: Quantum Computing Fundamentals: From Basic Linear Algebra to Quantum Programming Автор: Chuck Easttom II Издательство: Pearson...
A Primer on Quantum Computing Название: A Primer on Quantum Computing Автор: Franklin De Lima Marquezino, Renato Portugal, Издательство: Springer Год: 2019 Страниц: 114 Язык:...
Introduction to Quantum Information Science Название: Introduction to Quantum Information Science Автор: Masahito Hayashi and Satoshi Ishizaka Издательство: Springer Год: 2014 Формат: AZW3,...
Информация
Посетители, находящиеся в группе Гости, не могут оставлять комментарии к данной публикации.
Навигация
Вход на сайт
Реклама
Discrete Quantum Walks on Graphs and Digraphs 
