• 検索結果がありません。

: Studies on Design Methods for Topological Quantum Computation Abstract of Doctoral Thesis Title

N/A
N/A
Protected

Academic year: 2021

シェア ": Studies on Design Methods for Topological Quantum Computation Abstract of Doctoral Thesis Title"

Copied!
1
0
0

読み込み中.... (全文を見る)

全文

(1)

[様式-学 5]

Abstract of Doctoral Thesis

TitleStudies on Design Methods for Topological Quantum

Computation

Doctoral Program in Advanced Information Science and Engineering Graduate School of Information Science and Engineering Ritsumeikan University

ヌルル アイン ビンティ アドゥナン NURUL AIN BINTI ADNAN

Quantum computers are expected to outperform conventional computers by utilizing some known quantum algorithms; these quantum algorithms are designed to solve important problems such as database search and factorization. However, in practice, to realize a quantum computer that performs quantum computation is still a big challenge for the researchers due to the occurrence of many errors. Nowadays, topological quantum computation is considered as one of the most promising methods to realize quantum computation. The circuit for topological quantum computation is significantly different from the conventional model even in the logic level; in topological quantum computation, the logical primitive is called braiding. Accordingly, the design strategy should also be different from the quantum circuit design.

To understand the above-mentioned features of topological quantum computation, this thesis starts with chapter 1 that gives a summary of the current interests in topological quantum computation and the urge of finding a reliable design method to support this kind of circuit structure, and the required background necessary is explained in chapter 2. In chapter 3, this thesis introduces an efficient design method needed for topological quantum computer. The proposed design method can adapt with a high level of circuit description; in which design framework starts from the quantum algorithm level and ends at physical hardware level. An optimization method to reduce the quantum cost for quantum circuit is introduced in chapter 4. The proposed method is likely to produce better quantum cost reduction than the existing methods, and indeed the experimental results confirm this expectation. Chapter 5 describes a method to synthesis an optimal quantum circuit by arranging quantum bits in two dimensions and swaps the order of qubit to the appropriate order. Experimental result shows that the number of computational steps of the circuit can be reduced drastically compared with the existing method by arranging qubit in two dimensions.

参照

関連したドキュメント

(54) Further, in order to apply the Poisson summation formula and the saddle point method later, we consider to restrict ∆ ′′ 0 to ∆ ′ 0 of the following lemma; we will use

In this section we look at spectral sequences for calculating the homology of the bar and cobar constructions on operads and cooperads in based spaces or spectra.. It turns out that

Graev obtained in that paper (Theorem 9 of § 11) a complete isomorphical classification of free topological groups of countable compact spaces (of course two topological groups are

Theorem 0.4 implies the existence of strong connections [H-PM96] for free actions of compact quantum groups on unital C ∗ -algebras (connections on compact quantum principal

Equivalent conditions are obtained for weak convergence of iterates of positive contrac- tions in the L 1 -spaces for general von Neumann algebra and general JBW algebras, as well

The purpose of this paper is to use topological methods to construct continuous and smooth noninvertible maps of surfaces that exhibit a variety of measure theoretic behavior

Kashiwara and Nakashima [17] described the crystal structure of all classical highest weight crystals B() of highest weight explicitly. No configuration of the form n−1 n.

Ogawa, Quantum hypothesis testing and the operational interpretation of the quantum R ´enyi relative entropies,