東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Quantum Walks and Structured Searche...

Ratner, Michael C.

FindBook

Google Book

Amazon

博客來

Quantum Walks and Structured Searches on Free Groups and Networks.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Quantum Walks and Structured Searches on Free Groups and Networks./
作者:	Ratner, Michael C.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2017,
面頁冊數:	57 p.
附註:	Source: Dissertation Abstracts International, Volume: 78-10(E), Section: B.
Contained By:	Dissertation Abstracts International78-10B(E).
標題:	Mathematics. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10272859
ISBN:	9781369794090

Quantum Walks and Structured Searches on Free Groups and Networks.
Ratner, Michael C.

Quantum Walks and Structured Searches on Free Groups and Networks. - Ann Arbor : ProQuest Dissertations & Theses, 2017 - 57 p.

Source: Dissertation Abstracts International, Volume: 78-10(E), Section: B.

Thesis (Ph.D.)--Temple University, 2017.

Quantum walks have been utilized by many quantum algorithms which provide improved performance over their classical counterparts. Quantum search algorithms, the quantum analogues of spatial search algorithms, have been studied on a wide variety of structures. We study quantum walks and searches on the Cayley graphs of finitely-generated free groups. Return properties are analyzed via Green's functions, and quantum searches are examined. Additionally, the stopping times and success rates of quantum searches on random networks are experimentally estimated.

ISBN: 9781369794090Subjects--Topical Terms:

515831
Mathematics.

Quantum Walks and Structured Searches on Free Groups and Networks.
LDR:01510nmm a2200313 4500 001 2156553
005 20180517120324.5
008 190424s2017 ||||||||||||||||| ||eng d
020 $a 9781369794090
035 $a (MiAaPQ)AAI10272859
035 $a (MiAaPQ)temple:12934
035 $a AAI10272859
040 $a MiAaPQ $c MiAaPQ
100 1 $a Ratner, Michael C. $3 3344312
245 1 0 $a Quantum Walks and Structured Searches on Free Groups and Networks.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2017
300 $a 57 p.
500 $a Source: Dissertation Abstracts International, Volume: 78-10(E), Section: B.
500 $a Adviser: Wei-Shih Yang.
502 $a Thesis (Ph.D.)--Temple University, 2017.
520 $a Quantum walks have been utilized by many quantum algorithms which provide improved performance over their classical counterparts. Quantum search algorithms, the quantum analogues of spatial search algorithms, have been studied on a wide variety of structures. We study quantum walks and searches on the Cayley graphs of finitely-generated free groups. Return properties are analyzed via Green's functions, and quantum searches are examined. Additionally, the stopping times and success rates of quantum searches on random networks are experimentally estimated.
590 $a School code: 0225.
650 4 $a Mathematics. $3 515831
650 4 $a Computer science. $3 523869
650 4 $a Quantum physics. $3 726746
690 $a 0405
690 $a 0984
690 $a 0599
710 2 $a Temple University. $b Mathematics. $3 1683490
773 0 $t Dissertation Abstracts International $g 78-10B(E).
790 $a 0225
791 $a Ph.D.
792 $a 2017
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10272859