Quality Diversity for Variational Quantum Circuit Optimization

Maximilian Zorn, Jonas Stein, Maximilian Balthasar Mansky, Philipp J. Altmann, Michael Kölle, Claudia Linnhoff‐Popien

TL;DR

This paper introduces a quality-diversity (QD) evolutionary framework to simultaneously optimize the architecture and parameters of Variational Quantum Circuits (VQCs). By mapping entire quantum circuits into continuous matrices and guiding search with two NISQ-friendly quality metrics—circuit sparsity and gate diversity—the approach discovers high-performing circuits within just 20 optimization steps, significantly outperforming both QAOA and evolutionary baselines like QNEAT.

What Problem Does This Paper Address?

Variational Quantum Circuits (VQCs) are central to near-term quantum computing applications, particularly for NP-hard combinatorial optimization (CO) problems. However, designing high-performing VQC architectures is notoriously difficult:

  1. Barren Plateaus: Gradient-based methods often encounter flat optimization landscapes where gradients vanish exponentially as circuit depth and qubit counts grow.
  2. Sample Inefficiency: Standard gradient-free methods (e.g., genetic algorithms or reinforcement learning) either assemble circuits incrementally gate-by-gate or require massive evaluation budgets that are prohibitively expensive on real quantum hardware.
  3. Representation Bottlenecks: Quality-diversity algorithms—which excel at exploring multimodal solution spaces—have historically lacked a standardized, continuous circuit representation and meaningful low-dimensional quality metrics suitable for quantum compilation.

Methods

The authors introduce an end-to-end evolutionary pipeline based on Covariance Matrix Adaptation (CMA) variants, including CMA-ES, CMA-ME, and CMA-MAE (MAP-Annealing):

  • Matrix-Based Circuit Encoding: A circuit of $n$ qubits and $L$ layers is flattened into an $n \times L$ vector of real-valued scalars. The integer part selects a gate type from a predefined gate set $GS$, while the fractional part is dynamically interpreted depending on the gate:
  • Controlled gates (e.g., CNOT): The fraction determines the target qubit wire.
  • Parameterized rotation gates (e.g., $R_X$): The fraction scales to an angle $\theta \in [0, 2\pi]$.
  • Fixed gates (e.g., Hadamard $H$) / Identity ($I$): The fractional part is discarded.
  • NISQ-Centric Quality Measures: Instead of optimizing solely for the Hamiltonian cost objective, the search archive is indexed across two structural behavior dimensions designed to avoid barren plateaus and classical simulability:
  • Circuit Sparsity: The count of active, non-identity gates. Sparsity acts as an expressivity heuristic to curb over-parameterization.
  • Gate Diversity: The number of unique gate types per layer, encouraging non-uniform unitaries that unlock non-trivial quantum operations.

Datasets

The authors benchmarked their framework on four standard NP-hard binary graph optimization problems formulated as cost Hamiltonians: MaxCUT, Minimum Vertex Cover (MinVEC), Maximum Independent Set (MaxIND), and Maximum Clique (MaxCLI).

Evaluations utilized:

  • Canonical Graph Topologies (8 vertices): Barbell (sparse inter-cluster links), Ladder (uniform structure), and Caveman (clique clusters).
  • Random Graphs: 50 randomly generated connected Erdős–Rényi graphs with 8 vertices (average edge density $0.635 \pm 0.22$).
  • Scaling Benchmarks: Random Erdős–Rényi graphs scaled to $v \in \{12, 14, 16\}$ vertices with 4 circuit layers.

Key Insights and Ideas

  • Simpler Gate Sets Optimize Better: Comparing universal Clifford+T against parameterized sets (RotCNOT, TinyH, Tiny), the minimal variational gate set Tiny ($\{R_X, \text{CNOT}, I\}$) yielded the best optimization performance. Stripping out the Hadamard gate simplified the CMA optimization landscape without hurting expressivity.
  • Organic Barren Plateau Avoidance: Archive heatmaps revealed that CMA-MAE naturally converged toward solutions with high gate diversity and high sparsity. In other words, quality diversity inherently steers the population away from dense, over-parameterized circuits known to trigger barren plateaus.
  • Holistic vs. Sequential Search: Rather than sequentially appending gates via RL or tuning fixed-ansatz angles, optimizing the entire continuous encoding simultaneously allows CMA emitters to find valid circuit topologies and parameters in unified steps.

Key Results

  • Sample Efficiency: Across all graph problems, CMA variants discovered optimal (or near-optimal) solutions in under 20 optimization steps, compared to QAOA (which converged slowly) and QNEAT (which showed high variance across runs).
  • MaxCUT Performance: On 8-vertex Erdős–Rényi graphs, CMA methods achieved median approximation ratios approaching 1.0 within 100 steps, markedly surpassing the classical Goemans-Williamson average heuristic baseline ($\approx 0.87$).
  • Scaling Robustness: On 4-layer circuits with up to 16 vertices (Table 1), CMA methods maintained high average approximation ratios across all problems (e.g., for $v=16$: MaxIND $\ge 0.991$, MaxCUT $\ge 0.968$, MaxCLI $\ge 0.961$, and MinVEC $\ge 0.900$).

Limitations and Future Work

  • Simulation-Only Evaluation: All experiments were performed on classical GPU-accelerated simulators (AMD Threadripper / NVIDIA RTX 4090); physical hardware validation under real device noise remains to be demonstrated.
  • Circuit Scale: The empirical study was restricted to relatively shallow circuits ($L=4$) and graphs up to 16 vertices.
  • Application Domain: The method was tested exclusively on combinatorial optimization; testing against quantum machine learning (QML) benchmarks is an open next step.
  • Quality Metrics: Future extensions could replace heuristic proxies (sparsity and gate diversity) with rigorous information-theoretic metrics such as direct circuit expressivity and dynamical Lie algebra capacity.

Summary updated

Abstract

Optimizing the architecture of variational quantum circuits (VQCs) is crucial for advancing quantum computing (QC) towards practical applications. Current methods range from static ansatz design and evolutionary methods to machine learned VQC optimization, but are either slow, sample inefficient or require infeasible circuit depth to realize advantages. Quality diversity (QD) search methods combine diversity-driven optimization with user-specified features that offer insight into the optimization quality of circuit solution candidates. However, the choice of quality measures and the representational modeling of the circuits to allow for optimization with the current state-of-the-art QD methods like covariance matrix adaptation (CMA), is currently still an open problem. In this work we introduce a directly matrix-based circuit engineering, that can be readily optimized with QD-CMA methods and evaluate heuristic circuit quality properties like expressivity and gate-diversity as quality measures. We empirically show superior circuit optimization of our QD optimization w.r.t. speed and solution score against a set of robust benchmark algorithms from the literature on a selection of NP-hard combinatorial optimization problems.
BibTeX
@inproceedings{zorn2025quality,
  author = {Maximilian Zorn and Jonas Stein and Maximilian Balthasar Mansky and Philipp J. Altmann and Michael Kölle and Claudia Linnhoff‐Popien},
  title = {{Quality Diversity for Variational Quantum Circuit Optimization}},
  booktitle = {Proceedings of the International Conference on Automated Planning and Scheduling},
  year = {2025},
  doi = {10.1609/icaps.v35i1.36139},
}

Loading related content...

Figure