REVIEW 7 cited by
Showcasing a Barren Plateau Theory Beyond the Dynamical Lie Algebra
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Barren plateaus have emerged as a pivotal challenge for variational quantum computing. Our understanding of this phenomenon underwent a transformative shift with the recent introduction of a Lie algebraic theory capable of explaining most sources of barren plateaus. However, this theory requires either initial states or observables that lie in the circuit's Lie algebra. Focusing on parametrized matchgate circuits, in this work we are able to go beyond this assumption and provide an exact formula for the loss function variance that is valid for arbitrary input states and measurements. Our results reveal that new phenomena emerge when the Lie algebra constraint is relaxed. For instance, we find that the variance does not necessarily vanish inversely with the Lie algebra's dimension. Instead, this measure of expressiveness is replaced by a generalized expressiveness quantity: The dimension of the Lie group modules. By characterizing the operators in these modules as products of Majorana operators, we can introduce a precise notion of generalized globality and show that measuring generalized-global operators leads to barren plateaus. Our work also provides operational meaning to the generalized entanglement as we connect it with known fermionic entanglement measures, and show that it satisfies a monogamy relation. Finally, while parameterized matchgate circuits are not efficiently simulable in general, our results suggest that the structure allowing for trainability may also lead to classical simulability.
Forward citations
Cited by 7 Pith papers
-
Krylov-Lie Algebras for Variational Quantum Algorithms: Geometric, Depth-Aware Insights into Expressivity and Trainability
Krylov-Lie groups approximate finite-depth VQA manifolds and yield exact weighted variance formulas that isolate non-Haar corrections and obstruct unconditional Haar convergence.
-
Trainability of Parametrised Linear Combinations of Unitaries
Sums of trainable parametrised circuits remain trainable, with explicit variance formulas for LCU states under Haar-random assumptions.
-
Stacking the Deck: Tunable Trainability in Stacked LCUs
Stacked LCUs of fermionic Gaussian unitaries give variance Ω(1/(n k^{3l})) against classical simulation O(k^{2l} n^3) and quantum gate count O(l k n^2), with layers l as the single dial.
-
Concentration-Free Quantum Kernel Learning in the Rydberg Blockade
A Rydberg blockade based quantum kernel is claimed to avoid exponential concentration while remaining classically hard to simulate.
-
Pitfalls when tackling the exponential concentration of parameterized quantum models
Exponentially concentrated measurement outcomes are statistically indistinguishable from fixed noise after polynomial shots, so classical post-processing cannot fix them, and common proposed remedies do not escape this.
-
A unified approach to quantum resource theories and a new class of free operations
Quantum resource theories are unified by describing each as the automorphism group of a preferred algebraic structure, yielding a new family of complexified free operations for Lie-algebra-based theories.
-
Deep Learning in Classical and Quantum Physics
A graduate-level lecture-note review of deep learning methods and their applications in classical and quantum physics, with hands-on examples.
Discussion (0). Sign in to comment.