Genetic optimization of ansatz expressibility for enhanced variational quantum algorithm performance

• URL: http://arxiv.org/abs/2509.05804v1
• Date: Sat, 06 Sep 2025 18:39:10 GMT
• Title: Genetic optimization of ansatz expressibility for enhanced variational quantum algorithm performance
• Authors: Manish Mallapur, Ronit Raj, Ankur Raina,
• Abstract summary: Variational quantum algorithms have emerged as a leading paradigm that extracts practical computation from near-term intermediate-scale quantum devices.<n>To be effective, ansatze must be expressive enough to capture target states but shallow enough to be trainable.<n>We propose a genetic algorithm-inspired framework for designing ansatze that achieve high expressibility while maintaining shallow depth and low parameter count.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Variational quantum algorithms have emerged as a leading paradigm that extracts practical computation from near-term intermediate-scale quantum devices, enabling advances in quantum chemistry simulations, combinatorial optimization, and quantum machine learning. However, the performance of Variational Quantum Algorithms is highly sensitive to the design of the ansatze. To be effective, ansatze must be expressive enough to capture target states but shallow enough to be trainable. We propose a genetic algorithm-inspired framework for designing ansatze that achieve high expressibility while maintaining shallow depth and low parameter count. Our approach evolves ansatze through mutation and selection based on an expressibility metric. The circuit generated by our framework consistently demonstrates high expressibility at any target depth and performs comparably to traditional ansatz design approaches while showing minimal to no signs of barren plateau issues. This work presents a general, scalable solution for ansatz design, producing expressive, low-depth circuits that need to be designed only once and can serve a wide range of applications.

Related papers

• Provably Robust Training of Quantum Circuit Classifiers Against Parameter Noise [49.97673761305336]
  Noise remains a major obstacle to achieving reliable quantum algorithms.<n>We present a provably noise-resilient training theory and algorithm to enhance the robustness of parameterized quantum circuit classifiers.
  arXiv  Detail & Related papers  (2025-05-24T02:51:34Z)
• Optimizing Ansatz Design in Quantum Generative Adversarial Networks Using Large Language Models [0.0]
  We present a novel approach for improving the design of ansatzes in Quantum Generative Adversarial Networks (qGANs) by leveraging Large Language Models (LLMs)<n>Our approach iteratively refines ansatz structures to improve accuracy while reducing circuit depth and the number of parameters.
  arXiv  Detail & Related papers  (2025-03-17T07:29:05Z)
• Pulse-based variational quantum optimization and metalearning in superconducting circuits [3.770494165043573]
  We introduce pulse-based variational quantum optimization (PBVQO) as a hardware-level framework. We illustrate the framework by optimizing external superconducting on quantum interference devices. The synergy between PBVQO and meta-learning provides an advantage over conventional gate-based variational algorithms.
  arXiv  Detail & Related papers  (2024-07-17T15:05:36Z)
• Quantum Circuit Synthesis and Compilation Optimization: Overview and Prospects [0.0]
  In this survey, we explore the feasibility of an integrated design and optimization scheme that spans from the algorithmic level to quantum hardware, combining the steps of logic circuit design and compilation optimization. Leveraging the exceptional cognitive and learning capabilities of AI algorithms, one can reduce manual design costs, enhance the precision and efficiency of execution, and facilitate the implementation and validation of the superiority of quantum algorithms on hardware.
  arXiv  Detail & Related papers  (2024-06-30T15:50:10Z)
• Polynomial Reduction Methods and their Impact on QAOA Circuits [2.4588375162098877]
  We show how higher-order problem formulations can be used to leverage different desired non-functional properties for quantum optimisation. Our study shows that the approach allows us to satisfy different trade-offs, and suggests various possibilities for the future construction of general-purpose abstractions.
  arXiv  Detail & Related papers  (2024-06-13T07:43:18Z)
• Performant near-term quantum combinatorial optimization [1.1999555634662633]
  We present a variational quantum algorithm for solving optimization problems with linear-depth circuits. Our algorithm uses an ansatz composed of Hamiltonian generators designed to control each term in the target quantum function. We conclude our performant and resource-minimal approach is a promising candidate for potential quantum computational advantages.
  arXiv  Detail & Related papers  (2024-04-24T18:49:07Z)
• 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 algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• 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)
• Space-efficient binary optimization for variational computing [68.8204255655161]
  We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem. We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
  arXiv  Detail & Related papers  (2020-09-15T18:17:27Z)

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.