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

International Joint Conference on Neural Networks (IJCNN)

A study on neuromorphic quantum computation

Shigeo Sato, M. Kinjo, Osamu Takahashi, Yuuki Nakamiya, Kiyotaka Nakajima

Published Feb 28, 2005• 7 citations
Publisher

Abstract

A quantum computer employing a single quantum as a qubit executes real parallel computation. Several algorithms have been proposed for quantum computation. However, these algorithms are applicable only to a limited number of applications. Therefore, a general purpose algorithm should be studied and developed for practical use in the near future. We focus on the adiabatic evolution algorithm in order to incorporate an artificial neural network(ANN)-like method and discuss how to use this algorithm for solving an optimization problem.

DOI
10.1109/ijcnn.2004.1381200

Related papers

An Approach for Quantum Computing using Adiabatic Evolution Algorithm

Shigeo Sato, Mitsunaga Kinjo, Koji Nakajima

A quantum computer employing a single quantum as a qubit executes real parallel computation and has various applications. Several algorithms have been proposed for quantum computation. However, these algorithms are applicable only to a limited number of applications. Therefore, a general purpose algorithm should be studied and developed for practical use in the near future. In this paper, we focus on the adiabatic evolution algorithm for general purpose quantum computation and discuss how to use this algorithm for solving an optimization problem. We show a new algorithm incorporating an artificial neural network (ANN)-like method in order to compose another Hamiltonian. The new algorithm is helpful for reducing computation cost and is easy to implement. Successful simulation results are shown.

Japanese Journal of Applied Physics•Nov 10, 2003•16 citations

Neuromorphic quantum computation with energy dissipation

Mitsunaga Kinjo, Shigeo Sato, Yuuki Nakamiya +1 more

Real parallel computing with a quantum computer attracts vast interest due to its extreme high potential. We propose a neuromorphic quantum computation algorithm based on an adiabatic Hamiltonian evolution with energy dissipation. This algorithm can be applied to problems if a cost function can be expressed in a quadratic form. This requirement results from the fact that our Hamiltonian is designed by following a method similar to an artificial neural network (ANN). The state of an ANN is often trapped at local minima, and the network outputs an error. Since the state of a quantum system with the proposed algorithm is always in the ground state according to the adiabatic theorem, it is not necessary to be concerned that the quantum state is trapped at local minima. However, there is no guarantee that a quantum algorithm based on an adiabatic Hamiltonian evolution with degeneration or level crossing is successfully executed. We show successful numerical simulation results with the proposed algorithm by introducing energy dissipation to keep the quantum state staying in the ground state, and then we show an application to the $n$-queen problem, which is one of the combinatorial optimization problems.

Physical Review A•Nov 23, 2005•15 citations

Neuromorphic Adiabatic Quantum Computation

Shigeo Sato, Mitsunaga Kinjo

The advantage of quantum mechanical dynamics in information processing has attracted much interest, and dedicated studies on quantum computation algorithms indicate that a quantum computer has remarkable computational power in certain tasks. Quantum properties such as quantum superposition and quantum tunneling are worth studying because they may overcome the weakness of gradient descent method in classical neural networks. Also, the technique established for neural networks can be useful for developing a quantum algorithm. In this chapter, first the authors show the effectiveness of incorporating quantum dynamics and then propose neuromorphic adiabatic quantum computation algorithm based on the adiabatic change of Hamiltonian. The proposed method can be viewed as one of complex-valued neural networks because a qubit operates like a neuron. Next, the performance of the proposed algorithm is studied by applying it to a combinatorial optimization problem. Finally, they discuss the learning ability and hardware implementation.

IGI Global eBooks•Jan 1, 2009•0 citations

Neuromorphic Adiabatic Quantum Computation

Shigeo Sato, Mitsunaga Kinjo

The advantage of quantum mechanical dynamics in information processing has attracted much interest, and dedicated studies on quantum computation algorithms indicate that a quantum computer has remarkable computational power in certain tasks. Quantum properties such as quantum superposition and quantum tunneling are worth studying because they may overcome the weakness of gradient descent method in classical neural networks. Also, the technique established for neural networks can be useful for developing a quantum algorithm. In this chapter, first the authors show the effectiveness of incorporating quantum dynamics and then propose neuromorphic adiabatic quantum computation algorithm based on the adiabatic change of Hamiltonian. The proposed method can be viewed as one of complex-valued neural networks because a qubit operates like a neuron. Next, the performance of the proposed algorithm is studied by applying it to a combinatorial optimization problem. Finally, they discuss the learning ability and hardware implementation.Request access from your librarian to read this chapter's full text.

IGI Global eBooks•Jan 18, 2011•0 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

A Neuromorphic Computing-Based Accelerator for Quantum Algorithm Acceleration

Jincheng Zhang

This paper explores the design and potential of a neuromorphic computing-based accelerator for quantum algorithms. The core idea is to leverage the inherent parallelism of neuromorphic hardware to significantly speed up the computationally intensive aspects of quantum algorithms. We propose a methodology for decomposing complex quantum algorithms into a set of parallelizable tasks, which are then mapped onto a neuromorphic architecture. The architecture utilizes the key characteristics of neuromorphic systems—namely, synaptic plasticity and dynamic connection adjustment—to optimize the execution of these quantum tasks. This approach aims to address the significant computational bottleneck currently limiting the practical application of many quantum algorithms. The design incorporates key mathematical concepts from quantum mechanics and neuromorphic computing, providing a framework for future research and development in this emerging field. The paper outlines the architectural considerations, the mapping strategies, and discusses the potential for achieving substantial performance gains. ---

•Sep 7, 2026•0 citations
A quantum computer employing a single quantum as a qubit executes real parallel computation. Several algorithms have been proposed for quantum computation. However, these algorithms are applicable only to a limited number of applications. Therefore, a general purpose algorithm should be studied and developed for practical use in the near future. We focus on the adiabatic evolution algorithm in order to incorporate an artificial neural network(ANN)-like method and discuss how to use this algorithm for solving an optimization problem.
A quantum computer employing a single quantum as a qubit executes real parallel computation and has various applications. Several algorithms have been proposed for quantum computation. However, these algorithms are applicable only to a limited number of applications. Therefore, a general purpose algorithm should be studied and developed for practical use in the near future. In this paper, we focus on the adiabatic evolution algorithm for general purpose quantum computation and discuss how to use this algorithm for solving an optimization problem. We show a new algorithm incorporating an artificial neural network (ANN)-like method in order to compose another Hamiltonian. The new algorithm is helpful for reducing computation cost and is easy to implement. Successful simulation results are shown.
Real parallel computing with a quantum computer attracts vast interest due to its extreme high potential. We propose a neuromorphic quantum computation algorithm based on an adiabatic Hamiltonian evolution with energy dissipation. This algorithm can be applied to problems if a cost function can be expressed in a quadratic form. This requirement results from the fact that our Hamiltonian is designed by following a method similar to an artificial neural network (ANN). The state of an ANN is often trapped at local minima, and the network outputs an error. Since the state of a quantum system with the proposed algorithm is always in the ground state according to the adiabatic theorem, it is not necessary to be concerned that the quantum state is trapped at local minima. However, there is no guarantee that a quantum algorithm based on an adiabatic Hamiltonian evolution with degeneration or level crossing is successfully executed. We show successful numerical simulation results with the proposed algorithm by introducing energy dissipation to keep the quantum state staying in the ground state, and then we show an application to the nnn-queen problem, which is one of the combinatorial optimization problems.
The advantage of quantum mechanical dynamics in information processing has attracted much interest, and dedicated studies on quantum computation algorithms indicate that a quantum computer has remarkable computational power in certain tasks. Quantum properties such as quantum superposition and quantum tunneling are worth studying because they may overcome the weakness of gradient descent method in classical neural networks. Also, the technique established for neural networks can be useful for developing a quantum algorithm. In this chapter, first the authors show the effectiveness of incorporating quantum dynamics and then propose neuromorphic adiabatic quantum computation algorithm based on the adiabatic change of Hamiltonian. The proposed method can be viewed as one of complex-valued neural networks because a qubit operates like a neuron. Next, the performance of the proposed algorithm is studied by applying it to a combinatorial optimization problem. Finally, they discuss the learning ability and hardware implementation.
The advantage of quantum mechanical dynamics in information processing has attracted much interest, and dedicated studies on quantum computation algorithms indicate that a quantum computer has remarkable computational power in certain tasks. Quantum properties such as quantum superposition and quantum tunneling are worth studying because they may overcome the weakness of gradient descent method in classical neural networks. Also, the technique established for neural networks can be useful for developing a quantum algorithm. In this chapter, first the authors show the effectiveness of incorporating quantum dynamics and then propose neuromorphic adiabatic quantum computation algorithm based on the adiabatic change of Hamiltonian. The proposed method can be viewed as one of complex-valued neural networks because a qubit operates like a neuron. Next, the performance of the proposed algorithm is studied by applying it to a combinatorial optimization problem. Finally, they discuss the learning ability and hardware implementation.Request access from your librarian to read this chapter's full text.
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.
This paper explores the design and potential of a neuromorphic computing-based accelerator for quantum algorithms. The core idea is to leverage the inherent parallelism of neuromorphic hardware to significantly speed up the computationally intensive aspects of quantum algorithms. We propose a methodology for decomposing complex quantum algorithms into a set of parallelizable tasks, which are then mapped onto a neuromorphic architecture. The architecture utilizes the key characteristics of neuromorphic systems—namely, synaptic plasticity and dynamic connection adjustment—to optimize the execution of these quantum tasks. This approach aims to address the significant computational bottleneck currently limiting the practical application of many quantum algorithms. The design incorporates key mathematical concepts from quantum mechanics and neuromorphic computing, providing a framework for future research and development in this emerging field. The paper outlines the architectural considerations, the mapping strategies, and discusses the potential for achieving substantial performance gains. ---