Study on Quantum Parallel Processing by Adiabatic Quantum Computation in Bernstein-Vazirani Problem

Author

Nakayama, Shoji ; Peng Gang ; Iimura, Ichiro

Author_Institution

Dept. of Inf. Sci. & Bio. Eng., Kagoshima Univ., Kagoshima, Japan

fYear

2012

fDate

14-16 Dec. 2012

Firstpage

678

Lastpage

682

Abstract

Adiabatic quantum computation has been proposed as quantum parallel processing with adiabatic evolution by using a superposition state to solve combinatorial optimization problem, then it has been applied to many problems like satisfiability problem. Among them, Deutsch and Deutsch-Jozsa problems have been tried to be solved by using adiabatic quantum computation. In this paper, we modify the adiabatic quantum computation and propose to solve Bernstein-Vazirani problem more efficiently by a method with higher observation probability.

Keywords

combinatorial mathematics; computability; optimisation; parallel processing; probability; quantum computing; Bernstein-Vazirani problem; adiabatic evolution; adiabatic quantum computation; combinatorial optimization problem; observation probability; quantum parallel processing; satisfiability problem; superposition state; Energy states; Hafnium; Optimization; Parallel processing; Quantum computing; Transforms; Vectors; quantum parallel processing; quantum algorithm; adiabatic quantum computation; Bernstein-Vazirani problem; combinatorial optimization problem;;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel and Distributed Computing, Applications and Technologies (PDCAT), 2012 13th International Conference on

Conference_Location

Beijing

Print_ISBN

978-0-7695-4879-1

Type

conf

DOI

10.1109/PDCAT.2012.140

Filename

6589359