Efficiently architecting VQAs: Expressibility--Trainability--Resources Pareto-Optimality

• URL: http://arxiv.org/abs/2603.22142v1
• Date: Mon, 23 Mar 2026 16:04:02 GMT
• Title: Efficiently architecting VQAs: Expressibility--Trainability--Resources Pareto-Optimality
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Ansatz selection is a key factor in the performance of variational quantum algorithms (VQAs). While much of the state-of-the-art still relies on heuristic choices, an inadequate circuit structure can compromise both the expressive power and the trainability of the resulting model. Recent results have also established theoretical connections between expressibility and the onset of barren plateaus, highlighting the need for systematic criteria for ansatz selection. In this work, the ansatz is treated as a design feature to be optimized rather than a fixed block, and a design space exploration (DSE) is performed over a diverse set of parametrized quantum circuits (PQCs). Three complementary metrics -- expressibility, trainability, and resource cost -- are evaluated and used to analyze the trade-offs that emerge across different PQCs. Beyond identifying Pareto-optimal candidates, this multi-objective perspective helps clarify the interplay between these metrics and contributes quantitative evidence toward understanding the expressibility--trainability tension in variational circuits.

Related papers

• Enhancing Pauli Correlation Encoding for quantum optimization via systematic expressivity analysis [2.6945797019995363]
  Pauli Correlation atz (PCE) has emerged as a promising framework for quantum devices with limited qubit resources.<n>We show that PCE attains comparable solution quality with substantially fewer trainable parameters.<n>We propose a multistage continuation framework that gradually transforms a smooth relaxed objective into a sharper objective.
  arXiv  Detail & Related papers  (2026-09-09T05:03:07Z)
• A Target-Centric Survey of Quantization-Aware Training [53.52583463060327]
  Quantization-Aware Training (QAT) techniques have emerged as a promising solution to address these challenges.<n>QAT techniques explicitly simulate quantization effects during model training, yielding low-bit models that achieve accuracy comparable to their full-precision counterparts.
  arXiv  Detail & Related papers  (2026-08-30T09:04:47Z)
• Rethinking Expressibility-Trainability Trade-off in Hybrid Quantum Neural Networks [2.717526933594264]
  Hybrid quantum neural networks (HQNNs) integrate parameterized quantum circuits (PQCs) within classical networks.<n>We systematically analyze the expressibility--trainability relationship in HQNNs across varying circuit depths, qubit counts, entanglement topologies.<n>Our results show that pure PQCs exhibit only a weak and regime-dependent trade-off, while hybrid architectures increasingly disrupt and can eliminate this relationship.
  arXiv  Detail & Related papers  (2026-05-25T12:19:26Z)
• Rethinking Token-Level Policy Optimization for Multimodal Chain-of-Thought [73.39221516441624]
  Multimodal Chain-of-Thought (CoT) reasoning requires large vision-language models to construct reasoning trajectories.<n>Existing Reinforcement Learning with Verifiable Rewards (RLVR) methods treat CoT uniformly without distinguishing varying degrees of visual grounding.<n>We propose Perception-Exploration Policy Optimization (PEPO), which derives a perception prior to hidden state similarity and integrates it with token entropy.
  arXiv  Detail & Related papers  (2026-03-24T06:38:00Z)
• 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)
• Benchmarking Quantum Data Center Architectures: A Performance and Scalability Perspective [13.628992375229247]
  We study the impact of four representative quantum data-center architectures on distributed quantum circuit execution latency, resource contention, and scalability.<n>Our results show that distributed quantum performance is jointly shaped by topology, scheduling policies, and physical-layer parameters.
  arXiv  Detail & Related papers  (2026-01-04T03:48:02Z)
• Quantum Decision Transformers (QDT): Synergistic Entanglement and Interference for Offline Reinforcement Learning [0.2538209532048867]
  We introduce the Quantum Decision Transformer (QDT), a novel architecture incorporating quantum-inspired computational mechanisms.<n>Our approach integrates two core components: Quantum-Inspired Attention with entanglement operations that capture non-local feature correlations, and Quantum Feedforward Networks with multi-path processing and learnable interference for adaptive computation.
  arXiv  Detail & Related papers  (2025-12-09T16:47:37Z)
• Pathways of Thoughts: Multi-Directional Thinking for Long-form Personalized Question Answering [57.12316804290369]
  Personalization is essential for adapting question answering systems to user-specific information needs.<n>We propose Pathways of Thoughts (PoT), an inference-stage method that applies to any large language model (LLM) without requiring task-specific fine-tuning.<n>PoT consistently outperforms competitive baselines, achieving up to a 13.1% relative improvement.
  arXiv  Detail & Related papers  (2025-09-23T14:44:46Z)
• Federated In-Context Learning: Iterative Refinement for Improved Answer Quality [62.72381208029899]
  In-context learning (ICL) enables language models to generate responses without modifying their parameters by leveraging examples provided in the input.<n>We propose Federated In-Context Learning (Fed-ICL), a general framework that enhances ICL through an iterative, collaborative process.<n>Fed-ICL progressively refines responses by leveraging multi-round interactions between clients and a central server, improving answer quality without the need to transmit model parameters.
  arXiv  Detail & Related papers  (2025-06-09T05:33:28Z)
• Untrained Filtering with Trained Focusing for Superior Quantum Architecture Search [14.288836269941207]
  Quantum architecture search (QAS) represents a fundamental challenge in quantum machine learning. We decompose the search process into dynamic alternating phases of coarse and fine-grained knowledge learning. QUEST-A develops an evolutionary mechanism with knowledge accumulation and reuse to enhance multi-level knowledge transfer.
  arXiv  Detail & Related papers  (2024-10-31T01:57:14Z)
• Parameter-Efficient Fine-Tuning for Continual Learning: A Neural Tangent Kernel Perspective [125.00228936051657]
  We introduce NTK-CL, a novel framework that eliminates task-specific parameter storage while adaptively generating task-relevant features.<n>By fine-tuning optimizable parameters with appropriate regularization, NTK-CL achieves state-of-the-art performance on established PEFT-CL benchmarks.
  arXiv  Detail & Related papers  (2024-07-24T09:30:04Z)
• Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
  Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems. In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems. We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
  arXiv  Detail & Related papers  (2024-04-17T11:00:12Z)
• Pointer Networks with Q-Learning for Combinatorial Optimization [55.2480439325792]
  We introduce the Pointer Q-Network (PQN), a hybrid neural architecture that integrates model-free Q-value policy approximation with Pointer Networks (Ptr-Nets) Our empirical results demonstrate the efficacy of this approach, also testing the model in unstable environments.
  arXiv  Detail & Related papers  (2023-11-05T12:03:58Z)
• Adaptive Discrete Communication Bottlenecks with Dynamic Vector Quantization [76.68866368409216]
  We propose learning to dynamically select discretization tightness conditioned on inputs. We show that dynamically varying tightness in communication bottlenecks can improve model performance on visual reasoning and reinforcement learning tasks.
  arXiv  Detail & Related papers  (2022-02-02T23:54:26Z)

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.