提出新型量子梯度估计算法,显著降低训练参数化量子电路的测量开销。
Adaptive directional gradients for parameterised quantum circuits

- 基于前向自动微分设计随机方向梯度估计器,可灵活调节采样方向数。
- 在60量子比特、1770参数下,训练效率比参数移位法快数个数量级。
- 适用于量子神经网络、变分量子算法等场景,适合资源受限的硬件部署。
在量子硬件上训练参数化量子电路(PQC)受限于梯度估计的测量成本,传统参数移位规则的测量开销随可训练参数线性增长,成为大规模训练的主要瓶颈。本文提出一种基于前向自动微分的梯度估计算法框架,通过平均任意数量的随机方向导数,获得无偏梯度估计,并可退化为SPSA、随机坐标下降和参数移位规则的特例,无需辅助量子比特或受控门开销。理论上证明了随机量子前向梯度下降在标准假设下收敛,其二阶矩展开介于SPSA单方向与参数移位全梯度之间。在此框架下,我们推导出QUIVER(量子迭代自适应估计算则)优化器,其更新规则由最小测量成本分配的闭式解导出。数值实验表明,前向梯度可高效训练含60量子比特、1770参数的哈密顿权重保持正交量子神经网络,在ECG5000和MNIST数据集上的效率远超参数移位规则。同时,QUIVER在量子近似优化算法和变分量子本征值求解器的量子模拟任务中,优于iCANS和gCANS等低测量开销优化器。
原文摘要 · Abstract (English)
Training parameterised quantum circuits (PQCs) on quantum hardware is bottlenecked by the measurement cost of gradient estimation, which under the parameter-shift rule scales linearly in the number of trainable parameters and dominates the total shot budget of training at scale. In this work, we propose a framework of forward gradient estimators for PQCs, based on the forward mode of automatic differentiation, that yields an unbiased estimator of the gradient by averaging a freely tunable number of random directional derivatives and recovers SPSA, random coordinate descent, and the parameter-shift rule as limiting cases, with no ancilla qubits or controlled-gate overhead. We prove that stochastic quantum forward gradient descent converges under standard assumptions, with an explicit second-moment expansion that interpolates between the single-direction extreme of SPSA and the full-gradient extreme of parameter-shift. Within this framework we derive QUIVER (Quantum Iterative V-adaptive Estimator Rule), an adaptive optimiser for parameterised circuits whose update rule follows from a closed-form minimum measurement-cost allocation. We show numerically that forward gradients train Hamming-weight-preserving orthogonal quantum neural networks with up to 60 qubits and 1770 parameters on the ECG5000 and MNIST datasets orders of magnitude more efficiently than the parameter-shift rule. We also demonstrate that our proposed QUIVER optimiser can outperform iCANS and gCANS measurement-frugal optimisers on optimisation problems using the quantum approximate optimisation algorithm and quantum simulation with the variational quantum eigensolver.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。