Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

SCIS & ISIS SCIS & ISIS 2008

Neuromorphic Adiabatic Quantum Computation with Quantum Hebb Learning and its Capability

Mitsunaga Kinjo, Shigeo Sato

Published Jan 1, 2008• 0 citations
Publisher
DOI
10.14864/softscis.2008.0.804.0

Related papers

Study on the computational power of neuromorphic adiabatic quantum computation

Aiko Ono, Sato Shigeo, Kinjo Mitsunaga +1 more

IEICE Technical Report; IEICE Tech. Rep.•Oct 7, 2008•0 citations

Neuromorphic quantum computing: A survey and future directions in evolutionary and gradient-based learning strategies for quantum spiking neural networks

Yingchao Cheng, Meijia Wang, Zhifeng Hao +1 more

Neurocomputing•Jul 24, 2026•0 citations

Neuromorphic-Quantum Hybrid Learning: The Next Evolution Beyond Deep Learning

Soham Khadse

•Jan 1, 2025•0 citations

Neuromorphic-Quantum Hybrid Learning: The Next Evolution Beyond Deep Learning

Soham Khadse

•Jan 1, 2025•0 citations

A Study on Learning with a Quantum Neural Network

M. Kinjo, Shigeo Sato, Kiyotaka Nakajima

A quantum neural network based on the adiabatic quantum computation is one of candidates to overcome the difficulty for developing a quantum computation algorithm. In this paper, we propose a new learning method for a quantum neural network inspired by Hebb learning. Preliminary but successful results by numerical simulations have been shown. The results indicate that a quantum learning like Hebb rule can be implemented.

International Joint Conference on Neural Networks (IJCNN)•Jan 1, 2006•5 citations

Study on the performance of neuromorphic adiabatic quantum computation algorithms

Aiko Ono, Shigeo Sato, Mitsunaga Kinjo +1 more

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. [2], [3] 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.

International Joint Conference on Neural Networks (IJCNN)•Jun 1, 2008•1 citation
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. [2], [3] 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.