Machine Learning by Adiabatic Evolutionary Quantum System

• URL: http://arxiv.org/abs/2511.18496v1
• Date: Sun, 23 Nov 2025 15:27:09 GMT
• Title: Machine Learning by Adiabatic Evolutionary Quantum System
• Authors: Tomoyuki Yamakami,
• Abstract summary: We study an efficient way to accomplish certain machine learning tasks by training these AEQSs quantumly.<n>We develop a basic idea of approximately utilizing well-known quantum algorithms for quantum counting, quantum amplitude estimation, and quantum approximation.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Artificial intelligence for representing and characterizing quantum systems [49.29080693498154]
  Efficient characterization of large-scale quantum systems is a central challenge in quantum science.<n>Recent advances in artificial intelligence (AI) have emerged as a powerful tool to address this challenge.<n>This review discusses how each of these AI paradigms contributes to two core tasks in quantum systems characterization.
  arXiv  Detail & Related papers  (2025-09-05T08:41:24Z)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• ADAPT-QSCI: Adaptive Construction of an Input State for Quantum-Selected Configuration Interaction [0.0]
  We present a quantum-classical hybrid algorithm for calculating the ground state and its energy of the quantum many-body Hamiltonian.<n>We numerically illustrate that our method, dubbed ADAPT-QSCI, can yield accurate ground-state energies for small molecules.
  arXiv  Detail & Related papers  (2023-11-02T09:15:50Z)
• Expressive Quantum Supervised Machine Learning using Kerr-nonlinear Parametric Oscillators [0.0]
  Quantum machine learning with variational quantum algorithms (VQA) has been actively investigated as a practical algorithm in the noisy intermediate-scale quantum (NISQ) era. Recent researches reveal that the data reuploading, which repeatedly encode classical data into quantum circuit, is necessary for obtaining the expressive quantum machine learning model. We propose quantum machine learning with Kerrnon Parametric Hilberts (KPOs) as another promising quantum computing device.
  arXiv  Detail & Related papers  (2023-05-01T07:01:45Z)
• Quantum Imitation Learning [74.15588381240795]
  We propose quantum imitation learning (QIL) with a hope to utilize quantum advantage to speed up IL. We develop two QIL algorithms, quantum behavioural cloning (Q-BC) and quantum generative adversarial imitation learning (Q-GAIL) Experiment results demonstrate that both Q-BC and Q-GAIL can achieve comparable performance compared to classical counterparts.
  arXiv  Detail & Related papers  (2023-04-04T12:47:35Z)
• Assisted quantum simulation of open quantum systems [0.0]
  We introduce the quantum-assisted quantum algorithm, which reduces the circuit depth of UQA via NISQ technology. We present two quantum-assisted quantum algorithms for simulating open quantum systems.
  arXiv  Detail & Related papers  (2023-02-26T11:41:02Z)
• Quantum Machine Learning: from physics to software engineering [58.720142291102135]
  We show how classical machine learning approach can help improve the facilities of quantum computers. We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
  arXiv  Detail & Related papers  (2023-01-04T23:37:45Z)
• Recent Advances for Quantum Neural Networks in Generative Learning [98.88205308106778]
  Quantum generative learning models (QGLMs) may surpass their classical counterparts. We review the current progress of QGLMs from the perspective of machine learning. We discuss the potential applications of QGLMs in both conventional machine learning tasks and quantum physics.
  arXiv  Detail & Related papers  (2022-06-07T07:32:57Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• On exploring the potential of quantum auto-encoder for learning quantum systems [60.909817434753315]
  We devise three effective QAE-based learning protocols to address three classically computational hard learning problems. Our work sheds new light on developing advanced quantum learning algorithms to accomplish hard quantum physics and quantum information processing tasks.
  arXiv  Detail & Related papers  (2021-06-29T14:01:40Z)
• Variational quantum compiling with double Q-learning [0.37798600249187286]
  We propose a variational quantum compiling (VQC) algorithm based on reinforcement learning (RL) An agent is trained to sequentially select quantum gates from the native gate alphabet and the qubits they act on by double Q-learning. It can reduce the errors of quantum algorithms due to decoherence process and gate noise in NISQ devices.
  arXiv  Detail & Related papers  (2021-03-22T06:46:35Z)
• How Does Adiabatic Quantum Computation Fit into Quantum Automata Theory? [0.0]
  Adiabatic evolution of quantum systems have been studied as a potential means that physically realizes quantum computation. This paper asks a bold question of how to make adiabatic quantum computation fit into the rapidly progressing framework of quantum automata theory.
  arXiv  Detail & Related papers  (2020-01-15T11:29:59Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.