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

arXiv:2212.00421 · Quantum Information Processing

Evolutionary-based searching method for quantum circuit architecture

Anqi Zhang, Shengmei Zhao

Published Jul 14, 2023• 24 citations
arXivHTMLPDF
DOI
10.1007/s11128-023-04033-x

Related papers

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

Yoshio Rubio, Cynthia Olvera, Oscar Montiel

Studies in computational intelligence•Jan 1, 2025•1 citation

A Brief Survey of Quantum Architecture Search

Weiwei Zhu, Jiangtao Pi, Qiuyuan Peng

With the rapid development of quantum computing, the variational quantum algorithms capitalize on the classical optimizer and parametrized quantum circuit to provide outperformance on specific tasks such as combinatorial optimization problems. However, the performance of these hybrid quantum-classical algorithms heavily relies on the design of quantum circuit architecture. Being restricted by the noise of the near-term quantum device, how to trade off the computational power of quantum circuits and the noise of quantum gates is a challenging task for design circuit architecture. In this paper, we give a brief view of the recently proposed methods for quantum architecture search including the differentiable circuit search method, deep reinforcement learning based method, and evolutionary based methods.

International Conference on Algorithms, Computing and Systems (ICACS)•Sep 16, 2022•11 citations

Evolutionary Algorithms for Quantum Computers

Daniel Johannsen, Piyush P. Kurur, Johannes Lengler

Algorithmica•Apr 19, 2013•2 citations

SPA-QNAS: Improving Search Efficiency and Stability in Evolutionary Quantum Neural Architecture Search

Linwei Shang, Hao Cao, Yang Jie Wu +2 more

Quantum neural architecture search (QNAS) has emerged as a promising approach for automatically designing parameterized quantum circuits (PQCs) for near-term quantum machine learning tasks. However, quantum evolutionary algorithm (QEA)-based QNAS methods often suffer from slow distribution concentration and insufficient update adaptivity in high-dimensional discrete search spaces, which limits both search efficiency and final model performance. To address these issues, this paper proposes Structural Probability Adaptive Quantum Neural Architecture Search (SPA-QNAS), a search-dynamics-enhanced QNAS method built upon the EQNAS benchmark framework. SPA-QNAS introduces two complementary mechanisms into the QPV-driven evolutionary search loop: Structural Probability Enhancement (SPE) and Adaptive Evolutionary Control (AEC). SPE reinforces elite structural decisions to accelerate the concentration of the structural sampling distribution toward high-fitness regions, while AEC adaptively regulates the rotation updates of non-elite individuals according to fitness feedback, thereby improving update stability and suppressing ineffective disturbances. Under the same search space, circuit template, and quantum resource budget as EQNAS, SPA-QNAS is evaluated on the MNIST and Warship benchmark datasets. Experimental results across multiple independent runs demonstrate that SPA-QNAS achieves higher classification accuracy and more stable performance compared with EQNAS. In representative experiments, SPA-QNAS achieves classification accuracies of 99.42% on MNIST and 85.33% on Warship under the same search space and quantum resource budget as EQNAS. These results indicate that improving QPV-based evolutionary update dynamics is an effective way to enhance the stability and robustness of QNAS under fixed quantum resource constraints.

Entropy•Jul 22, 2026•0 citations

Genetic algorithm for quantum circuit design

Taro YABUKI, Hitoshi Iba

IEICE technical report. Artificial intelligence and knowledge-based processing•May 19, 2000•4 citations

Continuous evolution for efficient quantum architecture search

QuanGong Ma, Chaolong Hao, XuKui Yang +5 more

Variational quantum algorithms (VQAs) have been successfully applied to quantum approximate optimization algorithms, variational quantum compiling, and quantum machine learning models. The performance of VQAs is significantly influenced by the architecture of parameterized quantum circuits (PQCs). Quantum architecture search aims to automatically discover high-performance quantum circuits for specific VQA tasks. Quantum architecture search algorithms that utilize both SuperCircuit training and a parameter-sharing approach can save computational resources. If we directly follow the parameter-sharing approach, the SuperCircuit has to be trained to compensate for the worse search space. To address the challenges posed by the worse search space, we introduce an optimization strategy known as the efficient continuous evolutionary approach using Non-dominated Sorting Genetic Algorithm-II (NSGA-II). Then, we leverage prior information (symmetric property) designing Structure Symmetric Pruning for removing redundant gates of the searched ansatz. Experiments show that the efficient continuous evolutionary approach can search for more quantum architectures with better performance; the number of high-performance ansatzes obtained by our method is 10% higher than that in the literature (Du et al. in npj Quantum Inf. 8:62, 2022 ). The application of Structure Symmetric Pruning effectively reduces the number of parameters in quantum circuits without compromising their performance significantly. In binary classification tasks, the pruned quantum circuits exhibit an average accuracy reduction of 0.044 compared to their unpruned counterparts.

EPJ Quantum Technology•Sep 6, 2024•12 citations
With the rapid development of quantum computing, the variational quantum algorithms capitalize on the classical optimizer and parametrized quantum circuit to provide outperformance on specific tasks such as combinatorial optimization problems. However, the performance of these hybrid quantum-classical algorithms heavily relies on the design of quantum circuit architecture. Being restricted by the noise of the near-term quantum device, how to trade off the computational power of quantum circuits and the noise of quantum gates is a challenging task for design circuit architecture. In this paper, we give a brief view of the recently proposed methods for quantum architecture search including the differentiable circuit search method, deep reinforcement learning based method, and evolutionary based methods.
Quantum neural architecture search (QNAS) has emerged as a promising approach for automatically designing parameterized quantum circuits (PQCs) for near-term quantum machine learning tasks. However, quantum evolutionary algorithm (QEA)-based QNAS methods often suffer from slow distribution concentration and insufficient update adaptivity in high-dimensional discrete search spaces, which limits both search efficiency and final model performance. To address these issues, this paper proposes Structural Probability Adaptive Quantum Neural Architecture Search (SPA-QNAS), a search-dynamics-enhanced QNAS method built upon the EQNAS benchmark framework. SPA-QNAS introduces two complementary mechanisms into the QPV-driven evolutionary search loop: Structural Probability Enhancement (SPE) and Adaptive Evolutionary Control (AEC). SPE reinforces elite structural decisions to accelerate the concentration of the structural sampling distribution toward high-fitness regions, while AEC adaptively regulates the rotation updates of non-elite individuals according to fitness feedback, thereby improving update stability and suppressing ineffective disturbances. Under the same search space, circuit template, and quantum resource budget as EQNAS, SPA-QNAS is evaluated on the MNIST and Warship benchmark datasets. Experimental results across multiple independent runs demonstrate that SPA-QNAS achieves higher classification accuracy and more stable performance compared with EQNAS. In representative experiments, SPA-QNAS achieves classification accuracies of 99.42% on MNIST and 85.33% on Warship under the same search space and quantum resource budget as EQNAS. These results indicate that improving QPV-based evolutionary update dynamics is an effective way to enhance the stability and robustness of QNAS under fixed quantum resource constraints.
Variational quantum algorithms (VQAs) have been successfully applied to quantum approximate optimization algorithms, variational quantum compiling, and quantum machine learning models. The performance of VQAs is significantly influenced by the architecture of parameterized quantum circuits (PQCs). Quantum architecture search aims to automatically discover high-performance quantum circuits for specific VQA tasks. Quantum architecture search algorithms that utilize both SuperCircuit training and a parameter-sharing approach can save computational resources. If we directly follow the parameter-sharing approach, the SuperCircuit has to be trained to compensate for the worse search space. To address the challenges posed by the worse search space, we introduce an optimization strategy known as the efficient continuous evolutionary approach using Non-dominated Sorting Genetic Algorithm-II (NSGA-II). Then, we leverage prior information (symmetric property) designing Structure Symmetric Pruning for removing redundant gates of the searched ansatz. Experiments show that the efficient continuous evolutionary approach can search for more quantum architectures with better performance; the number of high-performance ansatzes obtained by our method is 10% higher than that in the literature (Du et al. in npj Quantum Inf. 8:62, 2022 ). The application of Structure Symmetric Pruning effectively reduces the number of parameters in quantum circuits without compromising their performance significantly. In binary classification tasks, the pruned quantum circuits exhibit an average accuracy reduction of 0.044 compared to their unpruned counterparts.