S-LCU:可调节训练性与经典可模拟性权衡的变分量子电路

Stacking the Deck: Tunable Trainability in Stacked LCUs

精选理由

这篇论文告诉你如何用 S-LCU 结构在“训练不动”和“容易模拟”之间自己拧旋钮,层数 l 就是那个旋钮,适合搞量子变分电路的人参考。

AI 摘要

arXiv 2607.24686 提出堆叠线性组合酉算子(S-LCU)作为变分量子电路的新结构。作者通过图解分析证明了 Free Fermion S-LCU 的损失景观方差下界为 Ω(1/(n k^{3l})),经典模拟代价为 O(k^{2l} n^3),而量子门复杂度仅为 O(lkn^2)。层数 l 作为单一调节旋钮,允许在计算复杂性与代价集中速率之间连续权衡。该工作为构造具有可调训练难度与经典可模拟性折中的 ansätze 提供了系统方法。

原文 · arXiv cs.LG

Stacking the Deck: Tunable Trainability in Stacked LCUs

Variational quantum circuits have been central to many proposed near-term applications of quantum computing, but a growing body of evidence suggests that trainability and quantum advantage are fundamentally at odds: ansätze expressive enough to resist efficient classical simulation tend to exhibit barren plateaus, while structures that provably rule out barren plateaus typically render them classically simulable. We propose a stacked linear combination of unitaries (S-LCU) as a variational ansatz which provides a tunable trade-off between barren plateaus and classical simulability. Using a diagrammatic analysis, we bound the loss-landscape variance of the Free Fermion S-LCU, whose elements are fermionic Gaussian unitaries. We prove a variance lower bound of $Ω(1/(n k^{3l}))$, with a simulation cost of $O(k^{2l} n^3)$ using the best known classical algorithm, compared to a quantum gate complexity of only $O(lkn^2)$. The number of layers $l$ serves as a single dial that trades computational complexity against the rate of cost concentration. This offers practitioners a systematic method for constructing ansätze with a complexity-trainability trade-off that best suits their application and hardware.