Skip to main content
Search

# Representation Theory

2 related articles

Subscribe to updates
  1. arXiv

    Order in linear recurrent memory gets an algebraic test: HyperSSM stays exact on a 32-generator group task with quaternion channels

    Whether a linear recurrent memory can retain the order of its inputs depends on the number system its transition matrices live in. Efficient parallel scans have relied on diagonal recurrences, and real or complex transitions commute, so the state records which inputs occurred but not their order. HyperSSM adds quaternion blocks to each channel while keeping linear-time inference and parallel training, solving group tasks exactly with at most five state numbers, including 32 generators, and staying exact on sequences 25 times longer than training.

  2. 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