Skip to content
DraconiticResearch
Search Sources API
197,761 studies31 sourcesUpdated 14 min ago
PreprintCC BY 4.0arXiv

Benchmarking Modular Optimization Strategies for Parameterized Quantum Circuits

Abstract

Training parameterized quantum circuits requires balancing optimization progress with limited evaluation budgets and the statistical uncertainty of near-term quantum hardware. We present a modular benchmarking framework that separates quantum search-direction estimation from classical parameter-update rules, allowing their interactions and sensitivities to be examined independently. We evaluate a suite of gradient-based, stochastic, and derivative-free optimizers across combinatorial optimization using the Quantum Approximate Optimization Algorithm (QAOA), supervised quantum machine learning using Iris classification and a quantum convolutional neural network (QCNN) for binary MNIST classification, and quantum chemistry using the variational quantum eigensolver (VQE) for molecular hydrogen. By separating objective evaluations from sample-circuit costs under finite-shot simulation and physical execution on a 156-qubit processor, we compare optimizer behavior across workloads with different parameter counts and measurement requirements. Four selected simulator and hardware case studies report terminal and best observed objectives separately, alongside post-training classifier accuracies. The comparisons include selected MaxCut and hydrogen trajectories and illustrate workload-dependent objective changes and evaluation costs, while the simulator benchmark compares both peak and mean performance across three seeds. The hardware runs do not establish an optimizer ranking or isolate a causal effect of device noise.

Related

  1. Task-aligned spectral inductive biases in parameterized quantum circuits
    Felix Frohnert, Adrián Pérez-Salinas, Sebastian Lange +3
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
  2. Metrological Benchmarking of Random Quantum Circuits
    Simone Cavazzoni, Changhun Oh
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
  3. Benchmarking Quantum Feature Encoding Strategies for Binary Classification with QSVM
    Murat Kurt
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  4. BAHAMAS: A Control Plane for Optimization and Execution of Variational Quantum Circuits
    Amit Samanta, Mohammad Abrarul Hasanat, Jason Ludmir +3
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
  5. Shot Allocation Strategies in Debugging Quantum Circuits
    Era Thaqi, Coco Gong, Margaret Martonosi
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
BibTeX
@misc{cotea2026benchmarking,
  title = {{Benchmarking Modular Optimization Strategies for Parameterized Quantum Circuits}},
  author = {Carla Cotea and Stefan Balauca and Andreea Arusoaie},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.10254},
  eprint = {2610.10254},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.10254},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Benchmarking Modular Optimization Strategies for Parameterized Quantum Circuits
AU  - Carla Cotea
AU  - Stefan Balauca
AU  - Andreea Arusoaie
PY  - 2026
DA  - 2026/10/07
PB  - arXiv
DO  - 10.48550/arxiv.2610.10254
UR  - https://arxiv.org/abs/2610.10254
AB  - Training parameterized quantum circuits requires balancing optimization progress with limited evaluation budgets and the statistical uncertainty of near-term quantum hardware. We present a modular benchmarking framework that separates quantum search-direction estimation from classical parameter-update rules, allowing their interactions and sensitivities to be examined independently. We evaluate a suite of gradient-based, stochastic, and derivative-free optimizers across combinatorial optimization using the Quantum Approximate Optimization Algorithm (QAOA), supervised quantum machine learning using Iris classification and a quantum convolutional neural network (QCNN) for binary MNIST classification, and quantum chemistry using the variational quantum eigensolver (VQE) for molecular hydrogen. By separating objective evaluations from sample-circuit costs under finite-shot simulation and physical execution on a 156-qubit processor, we compare optimizer behavior across workloads with different parameter counts and measurement requirements. Four selected simulator and hardware case studies report terminal and best observed objectives separately, alongside post-training classifier accuracies. The comparisons include selected MaxCut and hydrogen trajectories and illustrate workload-dependent objective changes and evaluation costs, while the simulator benchmark compares both peak and mean performance across three seeds. The hardware runs do not establish an optimizer ranking or isolate a causal effect of device noise.
ER  -