東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Geometric methods in quantum computa...

Zhang, Jun.

FindBook

Google Book

Amazon

博客來

Geometric methods in quantum computation.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Geometric methods in quantum computation./
作者:	Zhang, Jun.
面頁冊數:	117 p.
附註:	Source: Dissertation Abstracts International, Volume: 65-02, Section: B, page: 0952.
Contained By:	Dissertation Abstracts International65-02B.
標題:	Engineering, Electronics and Electrical. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3121775
ISBN:	0496691260

Geometric methods in quantum computation.
Zhang, Jun.

Geometric methods in quantum computation. - 117 p.

Source: Dissertation Abstracts International, Volume: 65-02, Section: B, page: 0952.

Thesis (Ph.D.)--University of California, Berkeley, 2003.

Recent advances in the physical sciences and engineering have created great hopes for new computational paradigms and substrates. One such new approach is the quantum computer, which holds the promise of enhanced computational power. Analogous to the way a classical computer is built from electrical circuits containing wires and logic gates, a quantum computer is built from quantum circuits containing quantum wires and elementary quantum gates to transport and manipulate quantum information. Therefore, design of quantum gates and quantum circuits is a prerequisite for any real application of quantum computation.

ISBN: 0496691260Subjects--Topical Terms:

626636
Engineering, Electronics and Electrical.

Geometric methods in quantum computation.
LDR:03759nmm 2200301 4500 001 1813797
005 20060503081251.5
008 130610s2003 eng d
020 $a 0496691260
035 $a (UnM)AAI3121775
035 $a AAI3121775
040 $a UnM $c UnM
100 1 $a Zhang, Jun. $3 1029811
245 1 0 $a Geometric methods in quantum computation.
300 $a 117 p.
500 $a Source: Dissertation Abstracts International, Volume: 65-02, Section: B, page: 0952.
500 $a Chair: Shankar Sastry.
502 $a Thesis (Ph.D.)--University of California, Berkeley, 2003.
520 $a Recent advances in the physical sciences and engineering have created great hopes for new computational paradigms and substrates. One such new approach is the quantum computer, which holds the promise of enhanced computational power. Analogous to the way a classical computer is built from electrical circuits containing wires and logic gates, a quantum computer is built from quantum circuits containing quantum wires and elementary quantum gates to transport and manipulate quantum information. Therefore, design of quantum gates and quantum circuits is a prerequisite for any real application of quantum computation.
520 $a In this dissertation we apply geometric control methods from differential geometry and Lie group representation theory to analyze the properties of quantum gates and to design optimal quantum circuits. Using the Cartan decomposition and the Weyl group, we show that the geometric structure of nonlocal two-qubit gates is a 3-Torus. After further reducing the symmetry, the geometric representation of nonlocal gates is seen to be conveniently visualized as a tetrahedron. Each point in this tetrahedron except on the base corresponds to a different equivalent class of nonlocal gates. This geometric representation is one of the cornerstones for the discussion on quantum computation in this dissertation.
520 $a We investigate the properties of those two-qubit operations that can generate maximal entanglement. It is an astonishing finding that if we randomly choose a two-qubit operation, the probability that we obtain a perfect entangler is exactly one half. We prove that given a two-body interaction Hamiltonian, it is always possible to explicitly construct a quantum circuit for exact simulation of any arbitrary nonlocal two-qubit gate by turning on the two-body interaction for at most three times, together with at most four local gates. We also provide an analytic approach to construct a universal quantum circuit from any entangling gate supplemented with local gates. Closed form solutions have been derived for each step in this explicit construction procedure. Moreover, the minimum upper bound is found to construct a universal quantum circuit from any Controlled-Unitary gate. A near optimal explicit construction of universal quantum circuits from a given Controlled-Unitary is provided. For the Controlled-NOT and Double-CNOT gate, we then develop simple analytic ways to construct universal quantum circuits with exactly three applications, which is the least possible for these gates. We further discover a new quantum gate (named B gate) that achieves the desired universality with minimal number of gates. Optimal implementation of single-qubit quantum gates is also investigated. Finally, as a real physical application, a constructive way to implement any arbitrary two-qubit operation on a spin electronics system is discussed.
590 $a School code: 0028.
650 4 $a Engineering, Electronics and Electrical. $3 626636
650 4 $a Physics, Condensed Matter. $3 1018743
690 $a 0544
690 $a 0611
710 2 0 $a University of California, Berkeley. $3 687832
773 0 $t Dissertation Abstracts International $g 65-02B.
790 1 0 $a Sastry, Shankar, $e advisor
790 $a 0028
791 $a Ph.D.
792 $a 2003
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3121775