Scalable Hardware Maturity Probe for Quantum Accelerators via Harmonic Analysis of QAOA

• URL: http://arxiv.org/abs/2509.11450v1
• Date: Sun, 14 Sep 2025 21:48:34 GMT
• Title: Scalable Hardware Maturity Probe for Quantum Accelerators via Harmonic Analysis of QAOA
• Authors: Chinonso Onah, Kristel Michielsen,
• Abstract summary: We present a hardware-maturity probe that quantifies a device's reliability.<n>We derive closed-form upper bounds on the number of stationary points in the p=1OA cost landscape for broad classes of verifiable-optimization problems.
• Score: 0.2578242050187029
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: As quantum processors begin operating as tightly coupled accelerators inside high-performance computing (HPC) facilities, dependable and reproducible behavior becomes a gating requirement for scientific and industrial workloads. We present a hardware-maturity probe that quantifies a device's reliability by testing whether it can repeatedly reproduce the provably global optima of single-layer Quantum Approximate Optimization Algorithm (QAOA) circuits. Using harmonic analysis, we derive closed-form upper bounds on the number of stationary points in the p=1 QAOA cost landscape for broad classes of combinatorial-optimization problems. These bounds yield an exhaustive yet low-overhead grid-sampling scheme with analytically verifiable outcomes. The probe integrates reliability-engineering notions like run-to-failure statistics, confidence-interval estimation, and reproducibility testing into a single, application-centric benchmark. Our framework supplies a standardized dependability metric for hybrid quantum-HPC (QHPC) workflows.

Related papers

• AQER: a scalable and efficient data loader for digital quantum computers [62.40228216126285]
  We develop AQER, a scalable AQL method that constructs the loading circuit by systematically reducing entanglement in target states.<n>We conduct systematic experiments to evaluate the effectiveness of AQER, using synthetic datasets, classical image and language datasets, and a quantum many-body state datasets with up to 50 qubits.
  arXiv  Detail & Related papers  (2026-02-02T14:39:42Z)
• 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)
• The EU Quantum Flagship's Key Performance Indicators for Quantum Computing [0.12099984425168675]
  We present a suite of scalable quantum computing benchmarks developed as key performance indicators (KPIs) within the EU Quantum Flagship.<n>These benchmarks are designed to assess holistic system performance rather than isolated components.
  arXiv  Detail & Related papers  (2025-12-22T18:30:06Z)
• QEF: Reproducible and Exploratory Quantum Software Experiments [1.1683938179815823]
  Quantum Experiment Framework (QEF) is designed to support the systematic, hypothesis-driven study of quantum algorithms.<n>QEF captures all key aspects of quantum software and algorithm experiments through a concise specification.<n>QEF supports parameter reuse to improve overall experiment runtimes.
  arXiv  Detail & Related papers  (2025-11-06T17:17:55Z)
• Quantum Kernel Methods: Convergence Theory, Separation Bounds and Applications to Marketing Analytics [0.22940141855172033]
  This work studies the feasibility of applying quantum kernel methods to a real consumer classification task in the NISQ regime.<n>We present a hybrid pipeline that combines a quantum- Kernel Support Vector Machine (Q-SVM) with a quantum feature extraction module (QFE)
  arXiv  Detail & Related papers  (2025-10-11T14:11:41Z)
• Cyclic Variational Quantum Eigensolver: Escaping Barren Plateaus through Staircase Descent [4.517663944296433]
  We introduce the Cyclic Variational Quantum Eigensolver (CVQE), a hardware-efficient framework for accurate ground-state quantum simulation.<n>CVQE departs from conventional VQE by incorporating a measurement-driven feedback cycle.<n>We show that CVQE consistently maintains chemical precision across correlation regimes, outperforms fixed UCCSD by several orders of magnitude, and achieves favorable accuracy-cost trade-offs.
  arXiv  Detail & Related papers  (2025-09-16T13:54:03Z)
• TensoMeta-VQC: A Tensor-Train-Guided Meta-Learning Framework for Robust and Scalable Variational Quantum Computing [60.996803677584424]
  TensoMeta-VQC is a novel tensor-train (TT)-guided meta-learning framework designed to improve the robustness and scalability of VQC significantly.<n>Our framework fully delegates the generation of quantum circuit parameters to a classical TT network, effectively decoupling optimization from quantum hardware.
  arXiv  Detail & Related papers  (2025-08-01T23:37:55Z)
• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [60.996803677584424]
  Variational Quantum Circuits (VQCs) offer a novel pathway for quantum machine learning.<n>Their practical application is hindered by inherent limitations such as constrained linear expressivity, optimization challenges, and acute sensitivity to quantum hardware noise.<n>This work introduces VQC-MLPNet, a scalable and robust hybrid quantum-classical architecture designed to overcome these obstacles.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• Enhanced feature encoding and classification on distributed quantum hardware [0.0]
  We propose a novel feature map optimization strategy for Quantum Support Vector Machines (QSVMs)<n>We take into account backend-specific parameters, including qubit connectivity, native gate sets, and circuit depth, which are critical factors in noisy quantum devices.<n>The study was carried out by partitioning each quantum processing unit (QPU) into several sub-units with the same topology to implement individual QSVM instances.
  arXiv  Detail & Related papers  (2024-12-02T16:14:37Z)
• AdaLog: Post-Training Quantization for Vision Transformers with Adaptive Logarithm Quantizer [54.713778961605115]
  Vision Transformer (ViT) has become one of the most prevailing fundamental backbone networks in the computer vision community. We propose a novel non-uniform quantizer, dubbed the Adaptive Logarithm AdaLog (AdaLog) quantizer.
  arXiv  Detail & Related papers  (2024-07-17T18:38:48Z)
• Projective Quantum Eigensolver via Adiabatically Decoupled Subsystem Evolution: a Resource Efficient Approach to Molecular Energetics in Noisy Quantum Computers [0.0]
  We develop a projective formalism that aims to compute ground-state energies of molecular systems accurately using Noisy Intermediate Scale Quantum (NISQ) hardware. We demonstrate the method's superior performance under noise while concurrently ensuring requisite accuracy in future fault-tolerant systems.
  arXiv  Detail & Related papers  (2024-03-13T13:27:40Z)
• QSAN: A Near-term Achievable Quantum Self-Attention Network [73.15524926159702]
  Self-Attention Mechanism (SAM) is good at capturing the internal connections of features. A novel Quantum Self-Attention Network (QSAN) is proposed for image classification tasks on near-term quantum devices.
  arXiv  Detail & Related papers  (2022-07-14T12:22:51Z)
• Scaling Quantum Approximate Optimization on Near-term Hardware [49.94954584453379]
  We quantify scaling of the expected resource requirements by optimized circuits for hardware architectures with varying levels of connectivity. We show the number of measurements, and hence total time to synthesizing solution, grows exponentially in problem size and problem graph degree. These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.
  arXiv  Detail & Related papers  (2022-01-06T21:02:30Z)
• Mixer-Phaser Ans\"atze for Quantum Optimization with Hard Constraints [1.011960004698409]
  We introduce parametrized circuit ans"atze and present the results of a numerical study comparing their performance with a standard Quantum Alternating Operator Ansatz approach. The ans"atze are inspired by mixing and phase separation in the QAOA, and also motivated by compilation considerations with the aim of running on near-term superconducting quantum processors.
  arXiv  Detail & Related papers  (2021-07-13T04:50:56Z)
• Benchmarking quantum co-processors in an application-centric, hardware-agnostic and scalable way [0.0]
  We introduce a new benchmark, dubbed Atos Q-score (TM) The Q-score measures the maximum number of qubits that can be used effectively to solve the MaxCut optimization problem. We provide an open-source implementation of Q-score that makes it easy to compute the Q-score of any quantum hardware.
  arXiv  Detail & Related papers  (2021-02-25T16:26:23Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06: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.