PaperlayerView exact revision on arXiv

Source-linked AI summary

On barren plateaus and cost function locality in variational quantum algorithms

Alexey Uvarov, Jacob Biamonte

arXiv:2011.10530v2quant-phcond-mat.dis-nncs.LG

TL;DR

Barren plateaus make gradient-based variational optimization difficult because gradients can vanish exponentially, while the dependence on cost-function structure is not fully characterized. The paper derives a lower bound on gradient variance based mainly on the causal-cone width of each Pauli term. It concludes that plateau severity depends on both Hamiltonian structure and ansatz structure, with implications for Hamiltonian preprocessing and hardware topology.

  • Problem

    Barren plateaus cause exponentially vanishing gradients in expressive variational circuits, and the dependence of their onset on cost-function structure has been established only for certain classes.

  • Method

    The paper derives a lower bound on the typical VQE gradient variance by decomposing the Hamiltonian into Pauli strings and relating each term to its circuit causal-cone width.

  • Results

    The results indicate that barren-plateau severity depends on ansatz structure as well as Hamiltonian structure.

  • Takeaways & Limitations

    Hamiltonians can be preprocessed to make optimization more viable, and some hardware topologies may be more suited for VQE than others.

Abstract

from arXiv · show

Variational quantum algorithms rely on gradient based optimization to iteratively minimize a cost function evaluated by measuring output(s) of a quantum processor. A barren plateau is the phenomenon of exponentially vanishing gradients in sufficiently expressive parametrized quantum circuits. It has been established that the onset of a barren plateau regime depends on the cost function, although the particular behavior has been demonstrated only for certain classes of cost functions. Here we derive a lower bound on the variance of the gradient, which depends mainly on the width of the circuit causal cone of each term in the Pauli decomposition of the cost function. Our result further clarifies the conditions under which barren plateaus can occur.

I. INTRODUCTION

The paper studies barren plateaus in variational quantum algorithms and derives a gradient-variance lower bound governed by Pauli-string causal-cone widths. It concludes that plateau onset depends on both Hamiltonian locality and ansatz structure.

  • Motivation: Variational quantum algorithms iteratively optimize measured cost functions using parametrized quantum circuits and classical optimization.Applications include VQE, QAOA, quantum autoencoders, and quantum neural networks.
  • Barren plateaus: Barren plateaus are regimes where average gradient magnitudes become exponentially small as the number of qubits increases.For sufficiently deep circuits forming approximate t-designs, this behavior follows from the circuit ensemble.
  • Prior results: Earlier work found that shorter-circuit plateau severity depends on cost-function locality, with local terms producing less severe effects.The paper develops this cost-function dependence beyond the previously studied classes.
  • Contribution: The paper derives a lower bound on the typical VQE gradient magnitude for a qubit Hamiltonian and variational ansatz.The bound is averaged over assignments of the ansatz parameters.
  • Contribution: Gradient variance is a weighted sum of independent Pauli-string variances, each bounded below using that string’s causal-cone width.The causal cone counts qubits on which conjugation by the ansatz can act nontrivially.
  • Implication: Barren-plateau onset depends not only on Hamiltonian locality but also on the structure of the variational ansatz.The introduction motivates analyzing circuit structure alongside the cost function.

A. Basic definitions and notation

The paper defines Pauli strings, ansätze, and causal cones, then reviews the t-design framework used to characterize barren-plateau gradients. These definitions connect circuit conjugation and causal-cone support to gradient variance.

  • Definitions: A Pauli string is a tensor product of n Pauli operators, while its locality counts the non-identity Pauli matrices it contains.The n-qubit identity is the trivial string.
  • Definitions: A super Pauli string is the tensor product h⊗h, represented on two copies of the n-qubit register.The two copies use primed labels for the second register.
  • Ansatz: An ansatz U(θ) is a fixed-structure, fixed-depth family of quantum circuits with independently tunable gates and N parameters.The stated assumptions organize gates into local blocks and layers covering the qubits.
  • Causal cone: A causal cone contains blocks that cannot be eliminated from U†hU, and its support is the number of qubits on which this conjugated string can act nontrivially.For the six-qubit checkerboard example, the causal-cone support includes all six qubits.
  • VQE setup: The VQE energy is E(θ)=⟨ψ(θ)|H|ψ(θ)⟩ for a parametrized ansatz state, and gradients are taken with respect to circuit parameters.The circuit is partitioned around the parameterized gate into operators before and after that gate.
  • Barren-plateau framework: Under the t-design framework, suitable circuit halves make the average derivative zero, while 2-design assumptions yield exponentially small gradient-variance bounds for polynomial-size Pauli Hamiltonians.The cited prior theorem gives Var ∂aE ∈ O(2^-2n), implying exponentially many measurements may be needed to resolve gradients.

C. Statement of main results

The paper derives a lower bound on gradient variance for Hamiltonians decomposed into Pauli strings, showing that causal-cone width is central to barren-plateau behavior. The result assumes independently parametrized local 2-design blocks and establishes independent Pauli-string contributions.

  • Main theorem: Theorem 2 bounds the gradient variance from below using the causal-cone sizes of Pauli strings whose cones contain the parameterized block.The bound applies to an n-qubit Hamiltonian H = Σ_i c_i h_i under local 2-design assumptions.
  • Main theorem: The variance contributions from individual Pauli strings are independent and therefore add to the total variance.The proof uses that the derivatives associated with distinct Pauli strings are uncorrelated.
  • Interpretation: Algebraic locality alone does not determine barren-plateau emergence; maximum locality under conjugation by the ansatz is more important.The relevant transformation is h → U†hU, which determines the possible causal-cone width.
  • Interpretation: Pauli strings whose causal cones contain many qubits may be difficult to optimize with gradient descent.This connects the theorem’s causal-cone dependence to optimization difficulty.
  • Proof strategy: The variance is evaluated in the Heisenberg picture by integrating over parameter assignments and applying local mixing and commutator superoperators.The derivation tracks which Pauli strings survive these operations and sums their final coefficients.
  • Proof strategy: The proof represents the variance as a composition of mixing operators and a commutator superoperator, with the latter eliminating unsupported strings and rescaling supported ones.The variance is expressed through the operator composition shown in Eq. (17).

B. Unitary designs

The paper introduces Haar measure and unitary t-designs as the probabilistic framework for averaging circuit blocks. For second moments, Haar averaging reduces to identity and swap operators, enabling explicit variance calculations.

  • Haar measure: Haar measure is the left-invariant probability measure on the unitary group and generalizes uniform sampling over unitaries.Its invariance under unitary shifts is the defining property used in the analysis.
  • Haar measure: Random circuits approach Haar measure at large depth, but convergence is exponentially slow in the number of qubits.This motivates approximating Haar averages with unitary designs.
  • Unitary designs: A unitary t-design reproduces Haar averages for polynomials of degree t in U and U*.The paper uses this moment-matching property to replace Haar integrations with tractable local design averages.
  • Unitary designs: For t = 2, Haar averaging reduces to a linear combination of the identity and swap operators.The coefficients are determined by the Weingarten function.
  • Unitary designs: The second-moment identities extend to non-factorizable inputs through the trace-swap relation.This extension supports the operator manipulations used later in the variance calculation.

C. Local mixing operator

The local mixing operator models averaging over Haar-distributed unitaries acting on a subset of qubits. Its key role is to transform Pauli-string pairs and eliminate distinct strings once the mixing supports cover all qubits.

  • Definition and role: Each ansatz block is treated as an independent local 2-design, allowing its average action to be represented by local mixing operators.The circuit average decomposes into a multiple integral over block instances.
  • Definition and role: The local mixing operator M_Y averages operators over Haar-distributed unitaries acting nontrivially on qubit subset Y.It is defined as a linear map on operators over H ⊗ H.
  • Action on Pauli strings: For a Pauli string with nontrivial support on Y, M_Y produces a sum over nontrivial Pauli substrings; otherwise its doubled identity component vanishes.This distinguishes strings that interact with the mixer support from those that do not.
  • Action on Pauli-string pairs: Mixing operators preserve only matching Pauli-string pairs when their supports collectively cover all qubits.For distinct strings h1 and h2, the full composition M_YN ◦ ··· ◦ M_Y1(h1 ⊗ h2) equals zero.
  • Action on Pauli-string pairs: The vanishing result follows because some covered qubit distinguishes the two Pauli strings, forcing the relevant trace terms to vanish.The argument continues to hold when the mixing subsets overlap.

D. Commutator

The commutator superoperator determines which Pauli strings contribute to the gradient variance after local mixing. It removes commuting strings, amplifies anticommuting ones, and supports the paper’s causal-cone lower bound.

  • Definition: The commutator superoperator is defined by applying i[F, ⋆] independently to two copies of the operator space.It is written as C_Y = (i[F, ⋆] ⊗ i[F, ⋆]) for a Hermitian operator F on Y.
  • Setup: The variance calculation assumes the parameter-dependent gate is surrounded by independent local 2-designs before and after the gate.This places the commutator between two local mixing operators with the same support.
  • Action: The commutator contribution vanishes on the doubled identity and retains only Pauli strings that anticommute with F.The identity result is stated explicitly for C_Y and the surrounding mixers.
  • Action: Commuting Pauli strings are eliminated, whereas anticommuting strings are multiplied by 4.This follows from the commutator action on each resulting super Pauli string.
  • Counting: For a nontrivial Pauli string F on Y, exactly 4^|Y|/2 nontrivial Pauli strings anticommute with F.The count is obtained by enumerating the choices of sites where the strings differ nontrivially.
  • Proof strategy: The full operation first mixes Pauli strings, filters and rescales them through the commutator, then mixes them again before collecting the prefactors.This sequence yields the expression used in the variance derivation.
  • Scope: The independent-local-2-design condition is not met by some numerical ansätze, but approximate 2-design behavior is argued not to alter the asymptotic scaling.Blocks in the first and last layers also do not appear to change the asymptotic behavior.

A. First portion of mixing operators

Mixing operators expand Pauli strings along causal paths, while commutators eliminate strings outside the relevant support. Tracking surviving strings along a path yields a lower-bound mechanism controlled by causal-cone structure.

  • Mixing operators: A mixing operator replaces one super Pauli string with a sum of strings containing all possible nontrivial substrings in its support.For a two-qubit block, this produces 15 super Pauli strings.
  • Mixing operators: After successive mixers, the transformed input becomes a weighted sum of super Pauli strings whose coefficients sum to one.Each resulting string has support bounded by the causal cone, and every causal-cone qubit appears in some resulting support.
  • Causal paths: A causal path is constructed by linking blocks with overlapping supports from the input Pauli string to the commutator.The path follows blocks across successive layers and is illustrated in Figure 3.
  • Commutator: The commutator removes strings whose domains do not intersect its support, while retaining the others with a block-size-dependent coefficient.Blocks outside the specified path can increase, but not decrease, the tracked lower-bound contribution.
  • Causal paths: Along the path, at least three quarters of the generated strings act nontrivially on the support of the next block at each step.For a two-qubit block, 12 of 15 generated strings share support with the next block, giving a factor of (3/4) per path step.

C. Second portion of the mixing operators

The second part of the argument averages surviving Pauli strings through the remaining mixers and derives a causal-cone-dependent variance lower bound. Numerical design tests characterize the local blocks used in this analysis.

  • Remaining mixers: Mixers outside the tracked path are applied to the surviving super Pauli strings and averaged over the computational zero state.Only strings composed entirely of identity and Pauli Z operators contribute one under this averaging.
  • Remaining mixers: For a nontrivial mixer on support Y, 4^|Y| − 1 strings are produced, while 2^|Y| − 1 identity-or-Z strings survive the zero-state average.This ratio supplies the multiplicative factors used in the lower-bound calculation.
  • Variance lower bound: The resulting variance bound is reduced to a factor scaling at least as 3^−|Ĉ(h,U)| with the causal-cone width.The derivation bounds the product over mixers using the number of blocks and qubits in the causal cone.
  • Variance lower bound: The proof concludes that the final product is lower bounded by 3^−|Ĉ(h,U)| because the number of blocks does not exceed the number of qubits.This establishes the stated causal-cone-dependent lower bound.
  • Local block designs: For two-qubit gate families, numerical estimates gave λ1 ≈ λ∞ = 0.022 and λ2 = 0.0028 for N = 500000 trials.The study compares local blocks with approximate tensor-product expanders as a measure of proximity to unitary designs.
  • Local block designs: The Cartan-decomposition block was closest to a 2-design among the studied families, while all blocks except the particle-conserving block were exact 1-designs within sampling tolerance.More sophisticated ansätze were generally better at approximating a 2-design.

B. Plateau dependence

Numerical experiments test the causal-cone lower bound across local and nonlocal Hamiltonians and several ansätze. The results show causal-cone structure and confirm additive variance behavior, while exposing limits on within-layer variation.

  • Numerical setup: Derivative variances are estimated by parameter-shift evaluations, with simulations performed under noise-free conditions using a statevector simulator.The derivative is computed as (f(θ + π/2) − f(θ − π/2))/2.
  • Local Hamiltonian: For H = X5 on 10 qubits, variances are evaluated over random parameter samples and averaged over parameters within each ansatz block.The experiments compare rotation-based blocks with Cartan-decomposition blocks in checkerboard ansätze.
  • Local Hamiltonian: The numerical results exhibit causal-cone structure, and gradients generally decrease toward earlier layers.Cartan-decomposition blocks produce smoother results, whereas the other block type yields uneven gradients.
  • Lower-bound comparison: The theoretical lower bound is fulfilled by a large margin in both tested cases.The bound does not capture within-layer differences: gradients are larger near the causal-cone middle than at its edges.
  • Nonlocal Hamiltonian: For H = X^⊗n with n = 10, the experiments show barren plateaus even for a very shallow ansatz.This behavior agrees with the lower-bound prediction for an n-local Hamiltonian.
  • Additivity: For H1 = X4X5 and H2 = X5X6, the variance for H1 + H2 agrees qualitatively with the sum of the separate variances.Per-parameter differences are close to zero up to the samples' standard errors.

C. Alternative ansatz architectures

The paper tests how alternative ansatz architectures affect gradient variances and barren-plateau behavior. Line and two-dimensional lattice structures can produce narrower causal cones and larger or zero derivative variances depending on parameter placement.

  • Causal-cone width depends on ansatz structure, so some ansatz structures may be less prone to barren plateaus.
  • Line connectivity gives edge qubits narrower causal cones and potentially higher gradient values than more centrally connected qubits.
  • Gradient variances for the line architecture are significantly larger than for ring connectivity in the tested H = X8 case.
  • The two-dimensional 3 × 3 lattice tests show that some ansatz blocks lie outside causal cones, making derivatives with respect to their parameters equal to zero.
  • The results indicate that plateau severity depends on ansatz structure, suggesting that some hardware topologies may be better suited for VQE than others.
  • The numerical tests can also be implemented on quantum hardware, while gradient estimation in hardware is linear in ansatz-parameter count and potentially sub-linear in Hamiltonian cardinality with simultaneous measurements.

Appendix A: Meaning of the operator 2-norm of the TPE

This appendix explains the operator 2-norm used to quantify discrepancies between an approximate and Haar-random tensor-product expectation. For Pauli-string inputs, the resulting error parameter bounds the corresponding coefficient-vector discrepancy.

  • The Hamiltonian is represented in the Pauli-string basis, whose orthogonality supports coefficient-wise analysis.
  • The operator 2-norm bounds the maximum output-vector discrepancy for unit-norm inputs between the approximate and perfect tensor-product expectations.
  • For a superoperator acting on Pauli-string inputs, the error λ2 upper-bounds the 2-norm of the coefficient difference c − cHaar.
  • The two-dimensional ansatz used in the numerical tests has four layers of two-qubit blocks, with each subsequent layer obtained by rotating the layout 90 degrees clockwise.
Loading 2011.10530v2…