國立高雄大學圖資館 |

登入

回首頁

Quantum logic gate construction and quantum algorithms.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Quantum logic gate construction and quantum algorithms.
作者:	Zhou, Xinlan.
面頁冊數:	155 p.
附註:	Adviser: James Harris.
附註:	Source: Dissertation Abstracts International, Volume: 64-03, Section: B, page: 1284.
Contained By:	Dissertation Abstracts International64-03B.
標題:	Physics, General.
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3085382
ISBN:	0496331892

Quantum logic gate construction and quantum algorithms.
Zhou, Xinlan.

Quantum logic gate construction and quantum algorithms. [electronic resource] - 155 p.

Adviser: James Harris.

Thesis (Ph.D.)--Stanford University, 2003.

Quantum computations can be carried out in parallel on superpositions of exponentially many computational basis states. However, controlling operational errors and decoherence makes experimental realization of quantum computations extremely challenging. In this thesis work, we present a methodology for fault-tolerant gate construction with a simple primitive. The method leads to straightforward and systematic construction of many fault-tolerant encoded operations that are important for reliable universal quantum computation in the presence of noise.

ISBN: 0496331892Subjects--Topical Terms:

227017
Physics, General.

Quantum logic gate construction and quantum algorithms.
LDR:02347nmm _2200265 _450 001 161923
005 20051017073352.5
008 230606s2003 eng d
020 $a 0496331892
035 $a 00148424
035 $a 161923
040 $a UnM $c UnM
100 0 $a Zhou, Xinlan. $3 227016
245 1 0 $a Quantum logic gate construction and quantum algorithms. $h [electronic resource]
300 $a 155 p.
500 $a Adviser: James Harris.
500 $a Source: Dissertation Abstracts International, Volume: 64-03, Section: B, page: 1284.
502 $a Thesis (Ph.D.)--Stanford University, 2003.
520 # $a Quantum computations can be carried out in parallel on superpositions of exponentially many computational basis states. However, controlling operational errors and decoherence makes experimental realization of quantum computations extremely challenging. In this thesis work, we present a methodology for fault-tolerant gate construction with a simple primitive. The method leads to straightforward and systematic construction of many fault-tolerant encoded operations that are important for reliable universal quantum computation in the presence of noise.
520 # $a Quantum computer algorithms are designed to exploit the properties of quantum physics. We review and clarify most of the known quantum algorithms for standard models of quantum computers, and provide generalization and simplification of a quantum algorithm for distributed data comparison. Further, the ensemble quantum computer model with NMR is discussed. We present modified quantum algorithms for this non-standard quantum computer model and show that the ensemble quantum computer is polynomially equivalent to the standard single quantum computer in running most of the known quantum algorithms. We also describe some of the first experimental simulations of quantum computation with NMR. Lastly we discuss the effect of the initial state noise and propose a class of efficient quantum algorithms for room temperature NMR quantum computation.
590 $a School code: 0212.
650 # 0 $a Physics, General. $3 227017
650 # 0 $a Computer Science. $3 212513
710 0 # $a Stanford University. $3 212607
773 0 # $g 64-03B. $t Dissertation Abstracts International
790 $a 0212
790 1 0 $a Harris, James, $e advisor
791 $a Ph.D.
792 $a 2003
856 4 0 $u http://libsw.nuk.edu.tw/login?url=http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3085382 $z http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3085382