Study on Discrete Quantum Adiabatic Computation in Combinatorial Search problems

Material type: 博士論文

Author: Mohamed Ahmed Saber El-Fiky

Publisher: 鹿児島大学

Publication date: -

Material Format: Digital

Capacity, size, etc.: -

Name of awarding university/degree: 鹿児島大学,博士(工学),Doctor of Philosophy in Engineering

View All

Notes on use

Note (General)：: 学位論文の要旨, 学位論文本文The model of adiabatic quantum computation is a new paradigm for designing quantum algorithms. This model is based on the quantum adiab...

Search by Bookstore

Holdings of Libraries in Japan

This page shows libraries in Japan other than the National Diet Library that hold the material.

List of Cooperating Institutions and Databases

Please contact your local library for information on how to use materials or whether it is possible to request materials from the holding libraries.

other

Kagoshima University Repository
Digital
You can check the holdings of institutions and databases with which Institutional Repositories DataBase(IRDB)(Institutional Repository) is linked at the site of Institutional Repositories DataBase(IRDB)(Institutional Repository).
Kagoshima University Repository

Search by Bookstore

Bibliographic Record

You can check the details of this material, its authority (keywords that refer to materials on the same subject, author's name, etc.), etc.

Digital

Material Type: 博士論文
Title: Study on Discrete Quantum Adiabatic Computation in Combinatorial Search problems
Author/Editor: Mohamed Ahmed Saber El-Fiky
Author Heading: Mohamed Ahmed Saber El-Fiky
Publication, Distribution, etc.: 鹿児島大学
Degree grantor/type: 鹿児島大学
Date Granted: 2012-03-23
Dissertation Number: 甲理工研第363号
Degree Type: 博士(工学)
Doctor of Philosophy in Engineering
Text Language Code: eng
Target Audience: 一般
Note (General): 学位論文の要旨, 学位論文本文
The model of adiabatic quantum computation is a new paradigm for designing quantum algorithms. This model is based on the quantum adiabatic theorem, where a quantum computer 　evolves the quantum system slowly to switch gradually from an initial Hamiltonian with a ground state which is easy to construct, to a final Hamiltonian whose ground state encodes the solution of the problem to be solved. This dissertation presents an experimental study on the discrete quantum adiabatic computation in combinatorial search problems, we take k-Satisfiability problem as target problem to be examined. For k ? 3, k-SAT is NP-complete, i.e., among the most difficult NP problems in the worst case. Here we proposes a new monotonic variation method for the phase shift and mixing functions in the adiabatic quantum algorithm called the Quadric variation method, in order to speed up the algorithm search and decrease the overall resulting search cost. In addition, we present a better parameter configuration for the algorithm to be used with quadric variation as well as the previously proposed methods. The experiment are carried out in solving random instances of 3-SAT problems. The results indicate that the proposed method of using monotonic quadric variation in the phase functions of the adiabatic algorithm greatly improve the search behavior of the adiabatic algorithm and reduces the resulting search cost, also the results indicate that the better configuration of the algorithm parameters could greatly enhance the search behavior for the proposed method as well as the previously proposed methods.
理工学研究科博士論文 (工学) ; 学位取得日: 平成24年3月23日
Format (IMT): application/pdf
Source: Diss_Mohamed_El-Fiky_2012.pdf （fulltext）
https://ir.kagoshima-u.ac.jp/record/12808/files/Diss_Mohamed_El-Fiky_2012.pdf
Access Restrictions: インターネット公開
Data Provider (Database): 国立情報学研究所 : 学術機関リポジトリデータベース（IRDB）（機関リポジトリ）
https://irdb.nii.ac.jp
Original Data Provider (Database): 鹿児島大学 : 鹿児島大学リポジトリ