Skip to main content
Search

# Sampling-Based Gradient Variance Estimator

1 related articles

Subscribe to updates
  1. arXiv

    Quantum circuits can be screened for trainability before costly optimization: a representation-theory criterion plus a sampling algorithm decide with polynomially many runs

    Gradients of variational quantum circuits can vanish exponentially with qubit count, creating barren plateaus that stall training. A new analysis splits the gradient variance over the invariant subspaces of the unitary representation of the circuit's compact Lie group and gives a sufficient condition for trainability: if the input state and the observable concentrate on the same polynomially sized invariant subspace, and the differentiated generator moves that subspace by an inverse-polynomial amount, the gradient variance has an inverse-polynomial lower bound. A companion sampling algorithm runs the circuit itself, without constructing representation-theoretic projectors, and decides whether the variance exceeds a tolerance with polynomially many runs.

You’re all caught up