TOP
英國出版界指標大獎肯定!A.F. Steadman 獲年度作家,《史坎德》系列帶你踏上熱血奇幻旅程
縮小範圍
商品類型
商品定價
出版日期
裝訂方式
搜尋結果 /

Hanmeng

共 1 筆
第1 / 1 頁
Discrete Quantum Walks on Graphs and Digraphs
95 折
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.
優惠價: 95 3705
無庫存
  • 共 1筆
    第 1 頁

暢銷榜

客服中心

收藏

會員專區