A Gate-Based Quantum Genetic Algorithm for Real-Valued Global Optimization

• URL: http://arxiv.org/abs/2511.05254v1
• Date: Fri, 07 Nov 2025 14:14:53 GMT
• Title: A Gate-Based Quantum Genetic Algorithm for Real-Valued Global Optimization
• Authors: Leandro C. Souza, Laurent E. Dardenne, Renato Portugal,
• Abstract summary: We propose a gate-based Quantum Genetic Algorithm (QGA) for real-valued global optimization.<n>Individuals are represented by quantum circuits whose measurement outcomes are decoded into real-valued vectors.<n>We show that both superposition and entanglement enhance the search dynamics of evolutionary quantum algorithms.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We propose a gate-based Quantum Genetic Algorithm (QGA) for real-valued global optimization. In this model, individuals are represented by quantum circuits whose measurement outcomes are decoded into real-valued vectors through binary discretization. Evolutionary operators act directly on circuit structures, allowing mutation and crossover to explore the space of gate-based encodings. Both fixed-depth and variable-depth variants are introduced, enabling either uniform circuit complexity or adaptive structural evolution. Fitness is evaluated through quantum sampling, using the mean decoded output of measurement outcomes as the argument of the objective function. To isolate the impact of quantum resources, we compare gate sets with and without the Hadamard gate, showing that superposition consistently improves convergence and robustness across benchmark functions such as the Rastrigin function. Furthermore, we demonstrate that introducing pairwise inter-individual entanglement in the population accelerates early convergence, revealing that quantum correlations among individuals provide an additional optimization advantage. Together, these results show that both superposition and entanglement enhance the search dynamics of evolutionary quantum algorithms, establishing gate-based QGAs as a promising framework for quantum-enhanced global optimization.

Related papers

• Quantum-Channel Matrix Optimization for Holevo Bound Enhancement [87.57725685513088]
  We propose a unified projected gradient ascent algorithm to optimize the quantum channel given a fixed input ensemble.<n> Simulation results demonstrate that the proposed quantum channel optimization yields higher Holevo bounds than input ensemble optimization.
  arXiv  Detail & Related papers  (2026-02-19T04:15:03Z)
• Quantum Approximate Optimization Algorithm for MIMO with Quantized b-bit Beamforming [47.98440449939344]
  Multiple-input multiple-output (MIMO) is critical for 6G communication, offering improved spectral efficiency and reliability.<n>This paper explores the use of the Quantum Approximate Optimization Algorithm (QAOA) and alternating optimization to address the problem of b-bit quantized phase shifters both at the transmitter and the receiver.<n>We demonstrate that the structure of this quantized beamforming problem aligns naturally with hybrid-classical methods like QAOA, as the phase shifts used in beamforming can be directly mapped to rotation gates in a quantum circuit.
  arXiv  Detail & Related papers  (2025-10-07T17:53:02Z)
• Variational Quantum Sensing for Structured Linear Function Estimation [0.977068710930551]
  We study the variational optimization of entangled probe states for quantum sensing tasks.<n>Specifically, we consider scenarios where each qubit in a spin-1/2 array accumulates a phase phi_i = alpha_i * theta.<n>We benchmark the optimized circuits for two relevant cases: (i) uniform encoding, where all qubits contribute equally to the phase function, and (ii) a custom encoding where a central qubit dominates the weight vector.
  arXiv  Detail & Related papers  (2025-07-29T17:48:14Z)
• Hybrid Reward-Driven Reinforcement Learning for Efficient Quantum Circuit Synthesis [0.0]
  A reinforcement learning framework is introduced for the efficient synthesis of quantum circuits.<n>The framework combines a static, domain-informed reward that guides the agent toward the target state with customizable dynamic penalties.<n> Benchmarking on graph-state preparation tasks for up to seven qubits, we demonstrate that the algorithm consistently discovers minimal-depth circuits.
  arXiv  Detail & Related papers  (2025-07-22T14:39:20Z)
• TANGO: A Robust Qubit Mapping Algorithm via Two-Stage Search and Bidirectional Look [7.064817742048067]
  Current quantum devices lack full qubit connectivity, making it difficult to directly execute logical circuits on quantum devices.<n>We propose the TANGO algorithm, which balances the impact of qubit mapping on both mapped and unmapped nodes.<n>We show that the algorithm achieves multi-objective co-optimization of gate count and circuit depth across various benchmarks and quantum devices.
  arXiv  Detail & Related papers  (2025-03-10T13:44:16Z)
• Optimizing quantum circuits with evolutionary algorithms for stable Boolean gates, elementary cellular automata, and highly entangled quantum states [0.5219568203653523]
  We investigate the potential of bio-inspired evolutionary algorithms for designing quantum circuits with specific goals.<n>We test the robustness of quantum implementations of the cellular automata for different numbers of quantum gates.<n>An evolutionary algorithm is employed to optimize circuits with respect to a fitness function defined with the Mayer-Wallach entanglement measure.
  arXiv  Detail & Related papers  (2024-08-01T10:36:38Z)
• 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)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• Exploring the role of parameters in variational quantum algorithms [59.20947681019466]
  We introduce a quantum-control-inspired method for the characterization of variational quantum circuits using the rank of the dynamical Lie algebra. A promising connection is found between the Lie rank, the accuracy of calculated energies, and the requisite depth to attain target states via a given circuit architecture.
  arXiv  Detail & Related papers  (2022-09-28T20:24:53Z)
• Automatic and effective discovery of quantum kernels [41.61572387137452]
  Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data.<n>We present an approach to this problem, which employs optimization techniques, similar to those used in neural architecture search and AutoML.<n>The results obtained by testing our approach on a high-energy physics problem demonstrate that, in the best-case scenario, we can either match or improve testing accuracy with respect to the manual design approach.
  arXiv  Detail & Related papers  (2022-09-22T16:42:14Z)
• Quantum Genetic Algorithm with Individuals in Multiple Registers [0.0]
  We propose a subroutine-based quantum genetic algorithm with individuals codified in independent registers. This distinctive codification allows our proposal to depict all the fundamental elements characterizing genetic algorithms. We study two paradigmatic examples, namely, the biomimetic cloning of quantum observables and the Buv zek-Hillery universal quantum cloning machine.
  arXiv  Detail & Related papers  (2022-03-28T19:05:03Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)

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.