By Topic

Study on the performance of neuromorphic adiabatic quantum computation algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Aiko Ono ; Laboratory for Brainware / Laboratory for Nanoelectronics and Spintronics, Research Institute of Electrical Communication, Tohoku University, Katahira 2-1-1, Aoba-ku, Sendai, 980-8577 Japan ; Shigeo Sato ; Mitsunaga Kinjo ; Koji Nakajima

Quantum computation algorithms indicate possibility that non-deterministic polynomial time (NP-time) problems can be solved much faster than by classical methods. Farhi et al., have proposed an adiabatic quantum computation (AQC) for solving the three-satisfiability problem (3-SAT). We have proposed a neuromorphic quantum computation algorithm based on AQC, in which an analogy to an artificial neural network (ANN) is considered in order to design a Hamiltonian. However, in the neuromorphic AQC, the relation between its computation time and the probability of correct answers is not clear yet. In this paper, we study both of residual energy and the probability of finding solution as a function of computation time. The results show that the performance of the neuromorphic AQC depends on the characteristic of Hamiltonians.

Published in:

2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence)

Date of Conference:

1-8 June 2008