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

Studies in computational intelligence

Towards a Fully Quantum Learning System: Quantum Architecture Search with Quantum Evolutionary Algorithms

Yoshio Rubio, Cynthia Olvera, Oscar Montiel

Published Jan 1, 2025• 1 citation
Publisher
DOI
10.1007/978-3-031-85614-3_20

Related papers

Evolutionary-based searching method for quantum circuit architecture

Anqi Zhang, Shengmei Zhao

arXiv:2212.00421•Quantum Information Processing•Jul 14, 2023•24 citations

Enhanced Machine Learning Applications using Automated Quantum Architecture Search: Employing Meta-Learning and Evolutionary Algorithms

Kalaipriya Omprakash, Ola Khresat, V Praveena +3 more

Quantum computing combined with machine learning, is a promising emerging field for tackling problems that are extremely expensive or fundamentally infeasible for classical computers. Nonetheless, design of the optimal quantum circuit for machine learning is a major challenge, which can be attributed to the exponential search space of the quantum gate arrangement and unmatched structured design methods. To resolve this, our work introduces a novel automated framework for quantum architecture search (AQAS) that adopts both meta-learning and evolutionary algorithms to automatically learn, transfer, and optimize quantum circuit architectures to suit different machine learning tasks. Our strategy relies on meta-learning to introduce a learning scheme, i.e. it allows the AQAS system to generalize across distributions by learning from a shared structural and functional prior from the distribution of machine learning problems. This enables the approach to quickly home in effective quantum circuit implementations for new tasks with low data or retraining. At the same time, we use evolutionary algorithms– mimicking natural selection– to breed populations of quantum circuit architectures. These circuits are represented in genotypes, are varied under mutation and crossover, and are selected according to a fitness function that blends quantum resource utilization (e.g., depth, qubits) with task-specific performance (e.g., classification accuracy or loss). The architecture is realized in a mixed quantum-classical environment, with quantum circuits simulated on quantum simulators and/or Noisy-Intermediate-Scale-Quantum (NISQ) devices. We verify the effectiveness of our approach on a number of benchmarked datasets and tasks which range from quantum-aided image recognition, time series prediction to medical diagnostics. We demonstrate that AQAS can discover compact, high-performing quantum models, which generalize better and are computationally more efficient than the custom-built quantum models.

International Conference on Computing and Communications (COMPUTINGCON)•Sep 1, 2025•3 citations

A Comprehensive Learning Quantum-Inspired Evolutionary Algorithm

Yanhui Qin, Gexiang Zhang, Yuquan Li +1 more

Communications in computer and information science•Jan 1, 2012•8 citations

Evolutionary Algorithms for Quantum Computers

Daniel Johannsen, Piyush P. Kurur, Johannes Lengler

Algorithmica•Apr 19, 2013•2 citations

Evolutionary quantum architecture search for parametrized quantum circuits

Li Ding, Lee C. Spector

Recent advancements in quantum computing have shown promising computational advantages in many problem areas. As one of those areas with increasing attention, hybrid quantum-classical machine learning systems have demonstrated the capability to solve various data-driven learning tasks. Recent works show that parameterized quantum circuits (PQCs) can be used to solve challenging reinforcement learning (RL) tasks with provable learning advantages. While existing works yield potentials of PQC-based methods, the design choices of PQC architectures and their influences on the learning tasks are generally underexplored. In this work, we introduce EQAS-PQC, an evolutionary quantum architecture search framework for PQC-based models, which uses a population-based genetic algorithm to evolve PQC architectures by exploring the search space of quantum operations. Experimental results show that our method can significantly improve the performance of hybrid quantum-classical models in solving benchmark reinforcement problems. We also model the probability distributions of quantum operations in top-performing architectures to identify essential design choices that are critical to the performance.

Genetic and Evolutionary Computation Conference Companion (GECCO Companion)•Jul 9, 2022•35 citations

Qubit-Wise Architecture Search Method for Variational Quantum Circuits

Jialin Chen, Zhiqiang Cai, Ke Xu +2 more

Considering the noise level limit, one crucial aspect for quantum machine learning is to design a high-performing variational quantum circuit architecture with small number of quantum gates. As the classical neural architecture search (NAS), quantum architecture search methods (QAS) employ methods like reinforcement learning, evolutionary algorithms and supernet optimiza-tion to improve the search efficiency. In this paper, we propose a novel qubit-wise architec-ture search (QWAS) method, which progres-sively search one-qubit configuration per stage, and combine with Monte Carlo Tree Search al-gorithm to find good quantum architectures by partitioning the search space into several good and bad subregions. The numerical experimental results indicate that our proposed method can balance the exploration and exploitation of cir-cuit performance and size in some real-world tasks, such as MNIST, Fashion and MOSI. As far as we know, QWAS achieves the state-of-art re-sults of all tasks in the terms of accuracy and circuit size.

arXiv:2403.04268•Mar 7, 2024•5 citations
Quantum computing combined with machine learning, is a promising emerging field for tackling problems that are extremely expensive or fundamentally infeasible for classical computers. Nonetheless, design of the optimal quantum circuit for machine learning is a major challenge, which can be attributed to the exponential search space of the quantum gate arrangement and unmatched structured design methods. To resolve this, our work introduces a novel automated framework for quantum architecture search (AQAS) that adopts both meta-learning and evolutionary algorithms to automatically learn, transfer, and optimize quantum circuit architectures to suit different machine learning tasks. Our strategy relies on meta-learning to introduce a learning scheme, i.e. it allows the AQAS system to generalize across distributions by learning from a shared structural and functional prior from the distribution of machine learning problems. This enables the approach to quickly home in effective quantum circuit implementations for new tasks with low data or retraining. At the same time, we use evolutionary algorithms– mimicking natural selection– to breed populations of quantum circuit architectures. These circuits are represented in genotypes, are varied under mutation and crossover, and are selected according to a fitness function that blends quantum resource utilization (e.g., depth, qubits) with task-specific performance (e.g., classification accuracy or loss). The architecture is realized in a mixed quantum-classical environment, with quantum circuits simulated on quantum simulators and/or Noisy-Intermediate-Scale-Quantum (NISQ) devices. We verify the effectiveness of our approach on a number of benchmarked datasets and tasks which range from quantum-aided image recognition, time series prediction to medical diagnostics. We demonstrate that AQAS can discover compact, high-performing quantum models, which generalize better and are computationally more efficient than the custom-built quantum models.
Recent advancements in quantum computing have shown promising computational advantages in many problem areas. As one of those areas with increasing attention, hybrid quantum-classical machine learning systems have demonstrated the capability to solve various data-driven learning tasks. Recent works show that parameterized quantum circuits (PQCs) can be used to solve challenging reinforcement learning (RL) tasks with provable learning advantages. While existing works yield potentials of PQC-based methods, the design choices of PQC architectures and their influences on the learning tasks are generally underexplored. In this work, we introduce EQAS-PQC, an evolutionary quantum architecture search framework for PQC-based models, which uses a population-based genetic algorithm to evolve PQC architectures by exploring the search space of quantum operations. Experimental results show that our method can significantly improve the performance of hybrid quantum-classical models in solving benchmark reinforcement problems. We also model the probability distributions of quantum operations in top-performing architectures to identify essential design choices that are critical to the performance.
Considering the noise level limit, one crucial aspect for quantum machine learning is to design a high-performing variational quantum circuit architecture with small number of quantum gates. As the classical neural architecture search (NAS), quantum architecture search methods (QAS) employ methods like reinforcement learning, evolutionary algorithms and supernet optimiza-tion to improve the search efficiency. In this paper, we propose a novel qubit-wise architec-ture search (QWAS) method, which progres-sively search one-qubit configuration per stage, and combine with Monte Carlo Tree Search al-gorithm to find good quantum architectures by partitioning the search space into several good and bad subregions. The numerical experimental results indicate that our proposed method can balance the exploration and exploitation of cir-cuit performance and size in some real-world tasks, such as MNIST, Fashion and MOSI. As far as we know, QWAS achieves the state-of-art re-sults of all tasks in the terms of accuracy and circuit size.