Quantum Circuit Trainability

Overview

The field asks whether parameterized quantum circuits can be optimized reliably as their depth and number of qubits grow, particularly when gradients become too small or misleading, as in barren plateaus. Researchers analyze gradient variance, circuit geometry, Jacobian rank, and Fourier spectra, and test design strategies such as local readouts, structured ansätze, adaptive depth growth, and frequency-aware initialization. Studies span variational quantum algorithms, quantum machine learning, and tasks such as classification and molecular-energy estimation, using both theoretical bounds and simulations with classical and hardware-aware baselines. A central tension is that expressivity, useful gradients, noise robustness, and resistance to efficient classical simulation do not necessarily improve together, and gradient diagnostics alone do not guarantee successful optimization.

Latest papers

CardsList

34 papers4 papers in the last four weeks, up 33% on the four weeks before. 0.0% of all new papers.

  1. Trainability-Oriented Hybrid Quantum Regression via Geometric Preconditioning and Curriculum Optimization

    Jan 17, 2026Qingyu Meng, Yangshuai WangQuantum Machine LearningHybrid Quantum-Classical ML

  2. Reducing QPU Calls in Variational Quantum Algorithms via Classical Offloading of Gradient Computation

    Mar 20, 2025Rahul Bhowmick, Harsh Wadhwa, Avinash Singh +3Variational Quantum AlgorithmsQuantum Circuit Trainability

  3. Metric Learning with Quantum Feature Spaces

    Dec 4, 2023Vinayak Sharma, Lord Sen, Ashish Padhy +4Quantum Machine LearningMetric Learning