國立虎尾科技大學 |

登入

回首頁

Quantum Walks and Structured Searche...

Temple University.

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.
面頁冊數:	1 online resource (57 pages)
附註:	Source: Dissertation Abstracts International, Volume: 78-10(E), Section: B.
Contained By:	Dissertation Abstracts International78-10B(E).
標題:	Mathematics. -
電子資源:	click for full text (PQDT)
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. - 1 online resource (57 pages)

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

Thesis (Ph.D.)

Includes bibliographical references

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.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2018

Mode of access: World Wide Web

ISBN: 9781369794090Subjects--Topical Terms:

527692
Mathematics.
Index Terms--Genre/Form:

554714
Electronic books.

Quantum Walks and Structured Searches on Free Groups and Networks.
LDR:01847ntm a2200361Ki 4500 001 910914
005 20180517120324.5
006 m o u
007 cr mn||||a|a||
008 190606s2017 xx obm 000 0 eng d
020 $a 9781369794090
035 $a (MiAaPQ)AAI10272859
035 $a (MiAaPQ)temple:12934
035 $a AAI10272859
040 $a MiAaPQ $b eng $c MiAaPQ
099 $a TUL $f hyy $c available through World Wide Web
100 1 $a Ratner, Michael C. $3 1182435
245 1 0 $a Quantum Walks and Structured Searches on Free Groups and Networks.
264 0 $c 2017
300 $a 1 online resource (57 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertation Abstracts International, Volume: 78-10(E), Section: B.
500 $a Adviser: Wei-Shih Yang.
502 $a Thesis (Ph.D.) $c Temple University $d 2017.
504 $a Includes bibliographical references
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.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2018
538 $a Mode of access: World Wide Web
650 4 $a Mathematics. $3 527692
650 4 $a Computer science. $3 573171
650 4 $a Quantum physics. $3 1179090
655 7 $a Electronic books. $2 local $3 554714
690 $a 0405
690 $a 0984
690 $a 0599
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a Temple University. $b Mathematics. $3 1182436
773 0 $t Dissertation Abstracts International $g 78-10B(E).
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10272859 $z click for full text (PQDT)

筆 0 讀者評論

多媒體

評論

新增評論分享你的心得

Export

取書館別