An efficient classical algorithm reduces the NTK average for Clifford-Pauli quantum neural networks to four discrete Clifford gates, enabling Gaussian-process simulation of wide trained networks and ruling out quantum advantage for this class.
The clifford theory of the n-qubit clifford group
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Efficient classical computation of the neural tangent kernel of quantum neural networks
An efficient classical algorithm reduces the NTK average for Clifford-Pauli quantum neural networks to four discrete Clifford gates, enabling Gaussian-process simulation of wide trained networks and ruling out quantum advantage for this class.