量子神经网络神经正切核的高效经典计算
Efficient classical computation of the neural tangent kernel of quantum neural networks
AI总结:
提出一种高效经典算法,利用Clifford群和Pauli群结构将初始化参数平均简化为四个离散值,从而精确计算量子神经网络的神经正切核,并证明宽量子神经网络无法实现量子优势。
摘要:
我们提出了一种高效的经典算法,用于估计与一类广泛的量子神经网络相关的神经正切核(NTK)。这些网络由属于Clifford群的任意酉算子与由属于Pauli群的任意哈密顿量生成的时间演化给出的参数化门交错组成。该算法利用了一个关键洞察:NTK定义中初始化参数分布的平均可以精确替换为仅四个离散值的平均,选择这些值使得相应的参数化门是Clifford操作。这种简化使得电路的高效经典模拟成为可能。结合最近的结果,即宽量子神经网络与高斯过程等价[Girardi等人, Comm. Math. Phys. 406, 92 (2025); Melchor Hernandez等人, Ann. Henri Poincaré (2025)],我们的方法能够高效计算宽训练量子神经网络的期望输出,因此表明此类网络无法实现量子优势。
英文摘要:
We propose an efficient classical algorithm to estimate the Neural Tangent Kernel (NTK) associated with a broad class of quantum neural networks. These networks consist of arbitrary unitary operators belonging to the Clifford group interleaved with parametric gates given by the time evolution generated by an arbitrary Hamiltonian belonging to the Pauli group. The proposed algorithm leverages a key insight: the average over the distribution of initialization parameters in the NTK definition can be exactly replaced by an average over just four discrete values, chosen such that the corresponding parametric gates are Clifford operations. This reduction enables an efficient classical simulation of the circuit. Combined with recent results establishing the equivalence between wide quantum neural networks and Gaussian processes [Girardi \emph{et al.}, Comm. Math. Phys. 406, 92 (2025); Melchor Hernandez \emph{et al.}, Ann. Henri Poincar{é} (2025)], our method enables efficient computation of the expected output of wide, trained quantum neural networks, and therefore shows that such networks cannot achieve quantum advantage.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。