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 Symposium on Advances in Electrical, Electronics and Computer Engineering (ISAEECE)

Quantum computing control system configuration optimizer with adaptive genetic algorithm

Shucheng Huang, Junchao Wang, Jianmin Pang, Zheng Shan

Published Oct 16, 2024• 0 citations
Publisher

Abstract

As quantum computing continues to advance, the complexity of control systems for superconducting qubits also increases. This paper presents a genetic algorithm (GA) approach for optimizing the control systems in quantum computing. Focusing on minimizing costs, maximizing resource utilization, and reducing device count, the study demonstrates the algorithm's effectiveness in configuring control systems efficiently. Experimental results from five quantum chips, ranging from 64 to 1024 bits, demonstrate significant improvements in cost efficiency and device management after 500 generations of optimization. The findings highlight the algorithm's adaptability to different quantum system scales and its potential in enhancing the scalability and efficiency of quantum computing architectures.

DOI
10.1117/12.3033478

Related papers

Adaptive Quantum Inspired Genetic Algorithm for Combinatorial Optimization Problems

Jyoti Chaturvedi

The development in the field of quantum computing gives us a significant edge over classical computing in terms of time and efficiency.This is particularly useful for NP-hard problems such as graph layout problems.Since many real world problems are effectively solved by genetic algorithm (GA) and the performance of GA highly depends upon the setting of its parameters, therefore this paper focuses on a Quantum Inspired Genetic Algorithm (QIGA) and develops and evaluates adaptive strategies for the same.QIGA adapts ideas of Q-bits, superposition of Q-bits from quantum computing.The effectiveness and the applicability of adaptive QIGA is demonstrated by experimental results on the benchmark Knapsack, Maxcut and Onemax combinatorial optimization problems.The results show that adaptive QIGA is superior to QIGAs.

International Journal of Computer Applications•Dec 18, 2014•3 citations

Based on Genetic Algorithm for Quantum Circuit Optimization

Jincheng Zhang

This paper explores the application of genetic algorithms (GAs) to optimize quantum circuits. The core claim is that GA can effectively improve the efficiency and accuracy of quantum computation by strategically modifying the topology and control parameters of quantum circuits. The proposed mechanism treats a quantum circuit as a genetic individual, leveraging the principles of genetic algorithms – including crossover, mutation, and selection – to iteratively enhance circuit performance. This approach represents a novel method for quantum circuit optimization, offering a potentially robust and adaptable solution compared to traditional optimization techniques. We present a framework for implementing this approach, focusing on the algorithmic steps and considerations for successful application. The exploration will cover the challenges and potential benefits of integrating evolutionary algorithms with the unique characteristics of quantum computation. ---

•Sep 5, 2026•0 citations

Benchmarking Adaptive Genetic Pulse-Level Optimization on Standard Quantum Algorithms

William Aguilar-Calvo, Santiago Núñez-Corrales

Noise in current quantum hardware (NISQ devices) poses a major obstacle by degrading gate operations and overall circuit fidelity toward FTQC. Traditional quantum error correction (QEC) is effective but resource-intensive, requiring several extra qubits and operations beyond the reach of near-term devices. Quantum error mitigation (QEM) offers a complementary path by reducing the impact of error prior to full correction. We present an adaptive pulse-level QEM using genetic algorithms to dynamically adjust control pulses in real-time, improving algorithm fidelity without modifying the logic structure of a quantum circuit. By targeting pulse parameters directly, this method reduces the impact of various noise sources, improving algorithm resilience in quantum circuits. To demonstrate the effectiveness of our methodology, we apply our protocol to five key quantum algorithms, including Bernstein-Vazirani, DeutschJozsa, Grover's search, Quantum Fourier Transform (QFT), and its inverse (IQFT). Experimental results show that our pulse-level optimization strategy provides a flexible and efficient solution for increasing fidelity during the noisy execution of quantum circuits. Our work contributes to advance error mitigation techniques, essential for robust quantum computing, which will increasingly require HPC infrastructure as quantum systems scale.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•0 citations

Evaluating Mutation Techniques in Genetic-Algorithm-Based Quantum Circuit Synthesis

Michael Kölle, Tom Bintener, Maximilian Zorn +4 more

Quantum computing leverages the unique properties of qubits and quantum parallelism to solve problems intractable for classical systems, offering unparalleled computational potential. However, optimization of quantum circuits remains critical, especially for noisy intermediate-scale quantum (NISQ) devices with limited qubits and high error rates. Genetic algorithms (GAs) provide a promising approach for efficient quantum circuit synthesis by automating optimization tasks. This work examines the impact of various mutation strategies within a GA framework for quantum circuit synthesis. By analyzing how different mutations transform circuits, it identifies strategies that enhance efficiency and performance. Experiments utilized a fitness function emphasizing fidelity, while accounting for circuit depth and T-operations, to optimize circuits with four to six qubits. Our analysis revealed that, while the "swap, addition" strategy achieved the highest fidelity scores, it consistently increased circuit depth. In contrast, combining "swap, addition, delete" strategies offers a more balanced approach, delivering near-optimal results while also having the potential of reducing circuit depth.

arXiv:2504.06413•Genetic and Evolutionary Computation Conference (GECCO)•Jul 8, 2025•9 citations

Quantum-Enhanced Genetic Algorithms for Complex Optimization

Jincheng Zhang

This paper presents a novel approach to complex optimization problems utilizing a hybrid Genetic Algorithm (GA) enhanced with quantum computing techniques. Classical GAs often struggle with slow convergence rates in high-dimensional search spaces. This research addresses this limitation by integrating quantum superposition and interference into the core operations of the GA, specifically crossover and mutation. The proposed method, termed Quantum-Enhanced Genetic Algorithm (Q-GA), aims to significantly accelerate the optimization process by exploring the solution space more efficiently. The core idea is to represent potential solutions within a quantum state, allowing for parallel exploration facilitated by superposition. We detail the architecture of the Q-GA, outlining the integration of classical GA components with quantum algorithms. The performance of the Q-GA is theoretically analyzed, focusing on the potential speedup achievable through quantum computation. The results presented demonstrate the promise of this hybrid approach for tackling computationally intensive optimization problems where classical GAs fall short.

•Sep 6, 2026•0 citations

Quantum Channel Optimization: Integrating Quantum-Inspired Machine Learning With Genetic Adaptive Strategies

R. Vijay Anand, G. Magesh, I. Alagiri +3 more

There is an ever-growing need for optimizing efficient nano and quantum communication systems and this demand calls for more advanced optimization techniques than those that have been around for quite some time. The conventional genetic algorithms (GAs) proved to be quite helpful in general but proved to be poor when it comes to fast convergence and adaptability to the changing communication environment. Moreover, fault tolerance and resource efficiency in these communication channels are poorly addressed, giving rise to a huge roadblock to practical implementations in a number of different use cases. This research presents a set of novel hybrid optimization methods aimed at addressing the issues previously mentioned. In the first place, a Quantum-inspired Genetic Algorithm (QIGA) with Simulated Annealing (SA) Initialization is proposed through augmenting traditional genetic operations with the quantum computing paradigm. In the first instance, the hybrid approach works by utilizing the parameters derived from SA while initializing the GA population, hence effective exploration of solution space. Additionally, the Adaptive Genetic Algorithm with Reinforcement Learning (AGA-RL) is presented, which uses real-time feedback from the current environment to modify the GA parameters. This way, the system will be much more adaptive and hence be able to adjust the GA so that it can match the rapidly changing channel conditions. Simultaneously, the Fault-Tolerant Genetic Algorithm with Error-Correcting Codes (FTGA-ECC) is developed to ensure reliable data transmission, especially in an error-prone environment. To make up for resource constraints, the Energy-Aware Genetic Algorithm with Dynamic Resource Allocation (EAGA-DRA) strategy ensures that resources are well-managed by dynamically changing allocation based on the optimization process and the particular needs of the channel, hence reducing energy overhead and spatial overhead without compromising channel quality. A great leap is in the integration of Machine Learning through the Deep Reinforcement Learning-guided Genetic Algorithm (DRL-GA). The above approach exploits deep reinforcement learning to fine-tune the exploration and exploitation strategies of the GA, hence providing faster convergence and improved solution quality. All of these methods are validated by the Quantum-inspired Benchmarking Framework (QIBF), which forms a systematized comparative platform to evaluate different optimization techniques from the perspective of QCA-based communication systems. The above approaches not only provide the improvement in efficiency and reliability but also contribute to enhancing the adaptability of communication systems and provide a very good base for future research and development in the field of quantum communications and beyond, with potential applications extending to secure communication, quantum computing, and nanotechnology-based devices & scenarios. This work is multifold, promising significant advancements in the field of quantum communication and beyond. The empirical findings showed that the suggested algorithms perform significantly better than traditional approaches in several important performance metrics, such as robustness to channel errors, adaptability to changing signal-to-noise ratios, convergence speed under dynamic conditions, and solution quality in highly variable environments.INDEX TERMS Quantum-inspired genetic algorithm, adaptive genetic algorithm, fault-tolerance, energy-efficient optimization, deep reinforcement learning.

IEEE Access•Jan 1, 2024•24 citations
As quantum computing continues to advance, the complexity of control systems for superconducting qubits also increases. This paper presents a genetic algorithm (GA) approach for optimizing the control systems in quantum computing. Focusing on minimizing costs, maximizing resource utilization, and reducing device count, the study demonstrates the algorithm's effectiveness in configuring control systems efficiently. Experimental results from five quantum chips, ranging from 64 to 1024 bits, demonstrate significant improvements in cost efficiency and device management after 500 generations of optimization. The findings highlight the algorithm's adaptability to different quantum system scales and its potential in enhancing the scalability and efficiency of quantum computing architectures.
The development in the field of quantum computing gives us a significant edge over classical computing in terms of time and efficiency.This is particularly useful for NP-hard problems such as graph layout problems.Since many real world problems are effectively solved by genetic algorithm (GA) and the performance of GA highly depends upon the setting of its parameters, therefore this paper focuses on a Quantum Inspired Genetic Algorithm (QIGA) and develops and evaluates adaptive strategies for the same.QIGA adapts ideas of Q-bits, superposition of Q-bits from quantum computing.The effectiveness and the applicability of adaptive QIGA is demonstrated by experimental results on the benchmark Knapsack, Maxcut and Onemax combinatorial optimization problems.The results show that adaptive QIGA is superior to QIGAs.
This paper explores the application of genetic algorithms (GAs) to optimize quantum circuits. The core claim is that GA can effectively improve the efficiency and accuracy of quantum computation by strategically modifying the topology and control parameters of quantum circuits. The proposed mechanism treats a quantum circuit as a genetic individual, leveraging the principles of genetic algorithms – including crossover, mutation, and selection – to iteratively enhance circuit performance. This approach represents a novel method for quantum circuit optimization, offering a potentially robust and adaptable solution compared to traditional optimization techniques. We present a framework for implementing this approach, focusing on the algorithmic steps and considerations for successful application. The exploration will cover the challenges and potential benefits of integrating evolutionary algorithms with the unique characteristics of quantum computation. ---
Noise in current quantum hardware (NISQ devices) poses a major obstacle by degrading gate operations and overall circuit fidelity toward FTQC. Traditional quantum error correction (QEC) is effective but resource-intensive, requiring several extra qubits and operations beyond the reach of near-term devices. Quantum error mitigation (QEM) offers a complementary path by reducing the impact of error prior to full correction. We present an adaptive pulse-level QEM using genetic algorithms to dynamically adjust control pulses in real-time, improving algorithm fidelity without modifying the logic structure of a quantum circuit. By targeting pulse parameters directly, this method reduces the impact of various noise sources, improving algorithm resilience in quantum circuits. To demonstrate the effectiveness of our methodology, we apply our protocol to five key quantum algorithms, including Bernstein-Vazirani, DeutschJozsa, Grover's search, Quantum Fourier Transform (QFT), and its inverse (IQFT). Experimental results show that our pulse-level optimization strategy provides a flexible and efficient solution for increasing fidelity during the noisy execution of quantum circuits. Our work contributes to advance error mitigation techniques, essential for robust quantum computing, which will increasingly require HPC infrastructure as quantum systems scale.
Quantum computing leverages the unique properties of qubits and quantum parallelism to solve problems intractable for classical systems, offering unparalleled computational potential. However, optimization of quantum circuits remains critical, especially for noisy intermediate-scale quantum (NISQ) devices with limited qubits and high error rates. Genetic algorithms (GAs) provide a promising approach for efficient quantum circuit synthesis by automating optimization tasks. This work examines the impact of various mutation strategies within a GA framework for quantum circuit synthesis. By analyzing how different mutations transform circuits, it identifies strategies that enhance efficiency and performance. Experiments utilized a fitness function emphasizing fidelity, while accounting for circuit depth and T-operations, to optimize circuits with four to six qubits. Our analysis revealed that, while the "swap, addition" strategy achieved the highest fidelity scores, it consistently increased circuit depth. In contrast, combining "swap, addition, delete" strategies offers a more balanced approach, delivering near-optimal results while also having the potential of reducing circuit depth.
This paper presents a novel approach to complex optimization problems utilizing a hybrid Genetic Algorithm (GA) enhanced with quantum computing techniques. Classical GAs often struggle with slow convergence rates in high-dimensional search spaces. This research addresses this limitation by integrating quantum superposition and interference into the core operations of the GA, specifically crossover and mutation. The proposed method, termed Quantum-Enhanced Genetic Algorithm (Q-GA), aims to significantly accelerate the optimization process by exploring the solution space more efficiently. The core idea is to represent potential solutions within a quantum state, allowing for parallel exploration facilitated by superposition. We detail the architecture of the Q-GA, outlining the integration of classical GA components with quantum algorithms. The performance of the Q-GA is theoretically analyzed, focusing on the potential speedup achievable through quantum computation. The results presented demonstrate the promise of this hybrid approach for tackling computationally intensive optimization problems where classical GAs fall short.
There is an ever-growing need for optimizing efficient nano and quantum communication systems and this demand calls for more advanced optimization techniques than those that have been around for quite some time. The conventional genetic algorithms (GAs) proved to be quite helpful in general but proved to be poor when it comes to fast convergence and adaptability to the changing communication environment. Moreover, fault tolerance and resource efficiency in these communication channels are poorly addressed, giving rise to a huge roadblock to practical implementations in a number of different use cases. This research presents a set of novel hybrid optimization methods aimed at addressing the issues previously mentioned. In the first place, a Quantum-inspired Genetic Algorithm (QIGA) with Simulated Annealing (SA) Initialization is proposed through augmenting traditional genetic operations with the quantum computing paradigm. In the first instance, the hybrid approach works by utilizing the parameters derived from SA while initializing the GA population, hence effective exploration of solution space. Additionally, the Adaptive Genetic Algorithm with Reinforcement Learning (AGA-RL) is presented, which uses real-time feedback from the current environment to modify the GA parameters. This way, the system will be much more adaptive and hence be able to adjust the GA so that it can match the rapidly changing channel conditions. Simultaneously, the Fault-Tolerant Genetic Algorithm with Error-Correcting Codes (FTGA-ECC) is developed to ensure reliable data transmission, especially in an error-prone environment. To make up for resource constraints, the Energy-Aware Genetic Algorithm with Dynamic Resource Allocation (EAGA-DRA) strategy ensures that resources are well-managed by dynamically changing allocation based on the optimization process and the particular needs of the channel, hence reducing energy overhead and spatial overhead without compromising channel quality. A great leap is in the integration of Machine Learning through the Deep Reinforcement Learning-guided Genetic Algorithm (DRL-GA). The above approach exploits deep reinforcement learning to fine-tune the exploration and exploitation strategies of the GA, hence providing faster convergence and improved solution quality. All of these methods are validated by the Quantum-inspired Benchmarking Framework (QIBF), which forms a systematized comparative platform to evaluate different optimization techniques from the perspective of QCA-based communication systems. The above approaches not only provide the improvement in efficiency and reliability but also contribute to enhancing the adaptability of communication systems and provide a very good base for future research and development in the field of quantum communications and beyond, with potential applications extending to secure communication, quantum computing, and nanotechnology-based devices & scenarios. This work is multifold, promising significant advancements in the field of quantum communication and beyond. The empirical findings showed that the suggested algorithms perform significantly better than traditional approaches in several important performance metrics, such as robustness to channel errors, adaptability to changing signal-to-noise ratios, convergence speed under dynamic conditions, and solution quality in highly variable environments.INDEX TERMS Quantum-inspired genetic algorithm, adaptive genetic algorithm, fault-tolerance, energy-efficient optimization, deep reinforcement learning.