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

Lecture notes in computer science

Machine Learning by Adiabatic Evolutionary Quantum Systems

Tomoyuki Yamakami

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.1007/978-3-032-15641-9_16

Related papers

Quantum adiabatic machine learning

Kristen L. Pudenz, Daniel A. Lidar

arXiv:1109.0325•Quantum Information Processing•Nov 21, 2012•139 citations

Machine Learning by Adiabatic Evolutionary Quantum System

Tomoyuki Yamakami

A computational model of adiabatic evolutionary quantum system (or AEQS, pronounced "eeh-ks") was introduced in [Yamakami,2022] as a sort of quantum annealing and its underlying input-driven Hamiltonians are generated quantum-algorithmically by various forms of quantum automata families (including 1qqaf's). We study an efficient way to accomplish certain machine learning tasks by training these AEQSs quantumly. When AEQSs are controlled by 1qqaf's, it suffices in essence to find an optimal 1qqaf that approximately solves a target relational problem. For this purpose, we develop a basic idea of approximately utilizing well-known quantum algorithms for quantum counting, quantum amplitude estimation, and quantum approximation. We then provide a rough estimation of the efficiency of our quantum learning algorithms for AEQSs.

quant-pharXiv:2511.18496•Nov 25, 2025•0 citations

Adiabatic Quantum Anomaly Detection and Machine Learning

Kristen L. Pudenz, Daniel A. Lidar

Bulletin of the American Physical Society•Feb 29, 2012•0 citations

Mixed continuous/binary quantum-inspired learning system with non-negative least square optimisation for automated design of regularised ensemble extreme learning machines

Ahmad Mozaffari, Nasser L. Azad, Mahdi Emami +1 more

In this paper, a hybrid quantum-inspired evolutionary algorithm (QIEA) is proposed to automatically design regularised ensemble extreme learning machines (EELMs). Quantum evolutionary computing is a relatively recent spot-lighted concept which takes advantage from both the evolutionary and quantum computing laws. In general, QIEAs have been proven to be really powerful for optimising complex engineering tasks. The fascinating trait of observation operator in QIEA enables us to transform the quantum bits to both the binary and continuous spaces. Here, the authors present a mix continuous/binary version of QIEA, to find out whether it is suited for designing regularised EELMs. Indeed, the design process of EELM is conducted at two different levels, i.e. hyper and low levels. At the low level, some novel criteria are presented in the form of penalty functions to enable the optimiser searching for parsimonious, compact and accurate regularised extreme learning machines, as individual components of the ensemble. At the hyper-level, the non-negative least square error optimisation technique is utilised to deterministically find the most eligible components for designing the ensemble. Through extensive numerical experiments, the authors demonstrate that the proposed method is really efficient for the automated design of EELM identifiers.

Journal of Experimental & Theoretical Artificial Intelligence•Mar 17, 2015•4 citations

Machine Learning Quantum Emergence

Eun-Ah Kim

Bulletin of the American Physical Society•Mar 4, 2020•0 citations

Quantum Adiabatic Evolution Algorithm for a Quantum Neural Network

Mitsunaga Kinjo, Shigeo Sato, Koji Nakajima

Lecture notes in computer science•Jan 1, 2003•6 citations
A computational model of adiabatic evolutionary quantum system (or AEQS, pronounced "eeh-ks") was introduced in [Yamakami,2022] as a sort of quantum annealing and its underlying input-driven Hamiltonians are generated quantum-algorithmically by various forms of quantum automata families (including 1qqaf's). We study an efficient way to accomplish certain machine learning tasks by training these AEQSs quantumly. When AEQSs are controlled by 1qqaf's, it suffices in essence to find an optimal 1qqaf that approximately solves a target relational problem. For this purpose, we develop a basic idea of approximately utilizing well-known quantum algorithms for quantum counting, quantum amplitude estimation, and quantum approximation. We then provide a rough estimation of the efficiency of our quantum learning algorithms for AEQSs.
In this paper, a hybrid quantum-inspired evolutionary algorithm (QIEA) is proposed to automatically design regularised ensemble extreme learning machines (EELMs). Quantum evolutionary computing is a relatively recent spot-lighted concept which takes advantage from both the evolutionary and quantum computing laws. In general, QIEAs have been proven to be really powerful for optimising complex engineering tasks. The fascinating trait of observation operator in QIEA enables us to transform the quantum bits to both the binary and continuous spaces. Here, the authors present a mix continuous/binary version of QIEA, to find out whether it is suited for designing regularised EELMs. Indeed, the design process of EELM is conducted at two different levels, i.e. hyper and low levels. At the low level, some novel criteria are presented in the form of penalty functions to enable the optimiser searching for parsimonious, compact and accurate regularised extreme learning machines, as individual components of the ensemble. At the hyper-level, the non-negative least square error optimisation technique is utilised to deterministically find the most eligible components for designing the ensemble. Through extensive numerical experiments, the authors demonstrate that the proposed method is really efficient for the automated design of EELM identifiers.