Beyond Logical Circuits: Hardware-Aware Analysis of Expressibility and Trainability in Variational Quantum Algorithms

• URL: http://arxiv.org/abs/2605.25552v1
• Date: Mon, 25 May 2026 08:09:35 GMT
• Title: Beyond Logical Circuits: Hardware-Aware Analysis of Expressibility and Trainability in Variational Quantum Algorithms
• Abstract summary: We show that hardware-aware transpilation modifies circuit structure through qubit mapping, routing, and basis decomposition.<n>Our results show that transpilation acts as an implicit architectural perturbation, producing strongly ansatz-dependent effects.<n>We further show that transpilation can alter the commonly assumed expressibility-trainability trade-off, demonstrating that logical-level analyses may not reliably predict hardware-level behavior.
• Score: 2.717526933594264
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Variational quantum algorithms (VQAs) rely on parameterized quantum circuits (PQCs), whose performance is governed by expressibility and trainability. Existing studies typically evaluate these properties at the logical circuit level, implicitly assuming that designed PQCs remain unchanged during hardware execution. In practice, however, hardware-aware transpilation modifies circuit structure through qubit mapping, routing, and basis decomposition, potentially altering PQC behavior. In this paper, we perform a systematic hardware-aware analysis of expressibility and trainability by comparing logical and transpiled PQCs across multiple ansatz families, qubit counts, and circuit depths. Expressibility is measured using fidelity-based KL divergence, while trainability is quantified through gradient variance. Our results show that transpilation acts as an implicit architectural perturbation, producing strongly ansatz-dependent effects. Expressibility deviations exceed upto 125% in some cases, while trainability variations reach up to 25%. Structured ansatzes are generally more robust, whereas highly entangled architectures are more sensitive to transpilation-induced transformations. We further show that transpilation can alter the commonly assumed expressibility-trainability trade-off, demonstrating that logical-level analyses may not reliably predict hardware-level behavior. These findings highlight the importance of hardware-aware evaluation for accurate characterization of VQAs.

Related papers

• Architecture-Aware Reinforcement Learning for Communication-Efficient Distributed Quantum Circuit Compilation [16.380589534840862]
  Distributed quantum computing provides a scalable route for executing quantum circuits beyond the capacity limits of a single quantum processing unit.<n>This paper presents an architecture-aware reinforcement-learning framework that formulates distributed quantum compilation as a constrained Markov Decision Process.
  arXiv  Detail & Related papers  (2026-08-07T07:25:18Z)
• Branch-Aware Quantum Constant Propagation for Dynamic Quantum Circuits [0.30313876226441433]
  Branch-Aware Quantum Constant Propagation (BQCP) is a compile-time analysis for dynamic circuits.<n>BQCP tracks the classical information produced by mid-circuit measurements together with the corresponding post-measurement quantum states.<n>Our method consistently achieves larger reductions than other existing passes including QCP.
  arXiv  Detail & Related papers  (2026-06-01T10:08:05Z)
• Late Breaking Results: Hardware-Aware Compilation Reshapes Trainability in Variational Quantum Circuits [2.717526933594264]
  Execution on real quantum devices requires hardware-aware compilation (transpilation) to satisfy qubit connectivity and native gate-set constraints.<n>In this paper, we examine how transpilation can alter the gradient statistics.
  arXiv  Detail & Related papers  (2026-04-16T14:08:02Z)
• Efficiently architecting VQAs: Expressibility--Trainability--Resources Pareto-Optimality [0.0]
  Ansatz selection is a key factor in the performance of variational quantum algorithms.<n>In this work, the ansatz is treated as a design feature to be optimized rather than a fixed block.<n>Three complementary metrics -- expressibility, trainability, and resource cost -- are evaluated and used to analyze the trade-offs that emerge.
  arXiv  Detail & Related papers  (2026-03-23T16:04:02Z)
• 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)
• Differentiable Logical Programming for Quantum Circuit Discovery and Optimization [0.15229257192293197]
  We introduce a neuro-symbolic framework that reframes quantum circuit design as a differentiable logic programming problem.<n>Our model represents a scaffold of potential quantum gates and parameterized operations as a set of learnable, continuous truth values''<n>We report a hardware-aware adaptation experiment on the 133-qubit IBM Torino processor.
  arXiv  Detail & Related papers  (2026-02-09T16:40:19Z)
• 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)
• Provable In-Context Learning of Nonlinear Regression with Transformers [66.99048542127768]
  In-context learning (ICL) is the ability to perform unseen tasks using task specific prompts without updating parameters.<n>Recent research has actively explored the training dynamics behind ICL, with much of the focus on relatively simple tasks.<n>This paper investigates more complex nonlinear regression tasks, aiming to uncover how transformers acquire in-context learning capabilities.
  arXiv  Detail & Related papers  (2025-07-28T00:09:28Z)
• 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)
• 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)
• Q-fid: Quantum Circuit Fidelity Improvement with LSTM Networks [0.6062751776009752]
  The fidelity of quantum circuits (QC) is influenced by several factors, including hardware characteristics, calibration status, and the transpilation process.<n>Q-fid is introduced, a Long Short-Term Memory (LSTM) based fidelity prediction system accompanied by a novel metric designed to quantify the fidelity of quantum circuits.<n>Q-fid achieves a high prediction accuracy with an average RMSE of 0.0515, up to 24.7x more accurate than the Qiskit transpile tool mapomatic.
  arXiv  Detail & Related papers  (2023-03-30T16:44:12Z)
• Quantum circuit architecture search on a superconducting processor [56.04169357427682]
  Variational quantum algorithms (VQAs) have shown strong evidences to gain provable computational advantages for diverse fields such as finance, machine learning, and chemistry. However, the ansatz exploited in modern VQAs is incapable of balancing the tradeoff between expressivity and trainability. We demonstrate the first proof-of-principle experiment of applying an efficient automatic ansatz design technique to enhance VQAs on an 8-qubit superconducting quantum processor.
  arXiv  Detail & Related papers  (2022-01-04T01:53:42Z)
• 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.