HamQASBench: A Hamiltonian-Informed Diagnostic Benchmark for Evaluating Quantum Architecture Search

• URL: http://arxiv.org/abs/2607.04845v1
• Date: Mon, 06 Jul 2026 09:15:19 GMT
• Title: HamQASBench: A Hamiltonian-Informed Diagnostic Benchmark for Evaluating Quantum Architecture Search
• Abstract summary: HamQASBench is a Hamiltonian-informed diagnostic benchmark organizing 11 molecules into five structural tiers.<n>A post-hoc critical-structure extraction procedure identifies minimal circuits consistent with each tier's requirements.
• Score: 9.280081053107969
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum Architecture Search (QAS) automates the design of parameterized quantum circuits for variational quantum algorithms, yet existing benchmarks organize instances by molecular identity or qubit count -- criteria agnostic to Hamiltonian structure -- and rely solely on energy accuracy, which cannot detect structural failures such as over-parameterization on near-product ground states. We introduce HamQASBench, a Hamiltonian-informed diagnostic benchmark organizing 11 molecules into five structural tiers via fingerprints derived from the Pauli operator basis, computational basis representation, and ground-state entanglement. A post-hoc critical-structure extraction procedure identifies minimal circuits consistent with each tier's requirements, complementing energy-based evaluation with per-qubit entanglement analysis and pairwise state fidelity. Benchmarking five QAS methods across four paradigms reveals failure modes invisible to conventional metrics: over-parameterization in the minimalism regime, eigenstate commitment under degeneracy, a representation bottleneck in strongly correlated systems, topology-induced routing failure, and circuit search space growth as a scalability bottleneck.

Related papers

• An Oracle-Free Quantum Algorithm for Nonadiabatic Quantum Molecular Dynamics [0.0]
  dissertation applies diabatic Hamiltonian operators directly to the computational basis as first-quantized split-operator propagators.<n> circuits are derived and specified, with focused circuit optimization in multi-mode and multi-channel extensions.
  arXiv  Detail & Related papers  (2026-04-21T10:28:02Z)
• Beyond VQE and QPE: A Noise- and Sampling-Error-Tolerant Quantum Algorithm with Heisenberg-Limited Precision [2.9712062101543135]
  Witnessed Quantum Time Evolution (WQTE) is a novel quantum algorithm for efficiently computing the eigen-energy spectra of arbitrary quantum systems.<n>By leveraging a single ancillary qubit to control real-time evolution operators, WQTE enables parallel resolution of multiple eigen-energies.
  arXiv  Detail & Related papers  (2026-03-18T17:27:07Z)
• How to find expressible and trainable parameterized quantum circuits? [0.22940141855172033]
  We propose a property-based ansatz-search framework for identifying circuits that combine trainability and expressibility.<n>We demonstrate its practical viability on a real quantum computer and apply it to variational quantum algorithms.
  arXiv  Detail & Related papers  (2026-03-15T15:54:30Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Qumode-Based Variational Quantum Eigensolver for Molecular Excited States [43.148034499498586]
  We introduce the Qumode Subspace Variational Quantum Eigensolver (QSS-VQE), a hybrid quantum-classical algorithm for computing molecular excited states.<n>We demonstrate the performance of QSS-VQE through simulations of molecular excited states, including dihydrogen and a conical intersection in cytosine.
  arXiv  Detail & Related papers  (2025-09-05T00:53:51Z)
• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [50.95799256262098]
  Variational quantum circuits (VQCs) hold promise for quantum machine learning but face challenges in expressivity, trainability, and noise resilience.<n>We propose VQC-MLPNet, a hybrid architecture where a VQC generates the first-layer weights of a classical multilayer perceptron during training, while inference is performed entirely classically.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• RhoDARTS: Differentiable Quantum Architecture Search with Density Matrix Simulations [44.13836547616739]
  Variational Quantum Algorithms (VQAs) are a promising approach to leverage Noisy Intermediate-Scale Quantum (NISQ) computers.<n> choosing optimal quantum circuits that efficiently solve a given VQA problem is a non-trivial task.<n>Quantum Architecture Search (QAS) algorithms enable automatic generation of quantum circuits tailored to the provided problem.
  arXiv  Detail & Related papers  (2025-06-04T08:30:35Z)
• Assessing the query complexity limits of quantum phase estimation using symmetry aware spectral bounds [0.0]
  computational cost of quantum algorithms for physics and chemistry is closely linked to the spectrum of the Hamiltonian. We introduce a hierarchy of symmetry-aware spectral bounds that provide a unified understanding of the performance of quantum phase estimation algorithms.
  arXiv  Detail & Related papers  (2024-03-07T18:38:49Z)
• Majorization-based benchmark of the complexity of quantum processors [105.54048699217668]
  We numerically simulate and characterize the operation of various quantum processors. We identify and assess quantum complexity by comparing the performance of each device against benchmark lines. We find that the majorization-based benchmark holds as long as the circuits' output states have, on average, high purity.
  arXiv  Detail & Related papers  (2023-04-10T23:01:10Z)
• 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)
• A stochastic quantum Krylov protocol with double factorized Hamiltonians [0.0]
  We propose a class of randomized quantum Krylov diagonalization (rQKD) algorithms capable of solving the eigenstate estimation problem with modest quantum resource requirements. Compared to previous real-time evolution quantum Krylov subspace methods, our approach expresses the time evolution operator, $e-ihatH tau$, as a linear combination of unitaries and subsequently uses a sampling procedure to reduce circuit depth requirements.
  arXiv  Detail & Related papers  (2022-11-15T16:27:41Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Parent Hamiltonian as a benchmark problem for variational quantum eigensolvers [0.6946929968559495]
  Variational quantum eigensolver (VQE) finds a ground state of a given Hamiltonian by variationally optimizing the parameters of quantum circuits called ansatz. This work provides a systematic way to analyze energies for VQE and contribute to the design of ansatz and its initial parameters.
  arXiv  Detail & Related papers  (2021-09-24T06:09:10Z)

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.