- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
The paper proposes the normalized spectral entropy of the training Gram matrix as a single, label-free coordinate for quantum Gaussian-process kernels. It argues that this quantity governs two phenomena. The first is the dequantization result of Lowe et al. (2025), whose condition-number bounds rule out exponential HHL-type speedups. The second is the concentration of expressive quantum kernels. The experiments sweep circuit depth and encoding scale for hardware-efficient, matchgate and IQP circuits (; ) and compare them with classical kernels. They also run Bayesian optimization and estimate on IBM Heron devices (, ).
Critical strengths
-
The paper implements a broad empirical study (three quantum ansatz families and two non-modular ablations, five classical kernel families, synthetic, quantum-data and two real regression targets, downstream Bayesian optimization).
-
Plotted against spectral entropy, classical and quantum kernels fall on the same curves for dq, ECE and contraction. For these GP properties the spectrum matters, not the quantumness of the feature map. This is a useful corrective to quantum-specific narratives.
-
For broadband targets, the NLL optimum lies near the Haar end (–), so highly expressive kernels are not automatically useless. The useful window depends on the target. Theorem 2 (water-filling) gives a simple intuition for this. Lemmas 2–3 state the two degenerate regimes precisely, including the shrinkage bias and the failure in the noiseless case.
-
The spectral statistics are estimated on two IBM Heron devices without error mitigation, and the errors are small. Lemma 4 (depolarizing noise adds a rank-one component to the Gram matrix), together with shot noise, explains the direction of the observed bias.
Critical weaknesses
-
The theory is elementary and does not support the main story. By the authors' own account, Theorem 1 does not give the needed direction ("high entropy is hard to compress").
-
The unification claim is not substantiated. Lowe et al. study the condition number of , which depends on the smallest eigenvalues. Spectral entropy is insensitive to these eigenvalues, and no result in the paper connects the two quantities.
-
The score dq is the fraction of eigenvalues needed to carry 99% of the trace. Both dq and depend only on the normalized spectrum, so much of their joint behaviour follows from the definitions. Moreover, dq does not measure classical hardness.
-
The quantum-data target has variance about 15 times below the noise variance. Its low-entropy optimum thus reflects a nearly constant target.
-
As a predictor of NLL, is weaker than existing statistics. Its absolute Spearman correlation is 0.28, against 0.89 for off-diagonal concentration and 0.79 for kernel–target alignment.
-
The experiments are small and the claims are hard to identify. The sweeps use training points, the hardware runs use an Gram matrix, and most configurations have a single seed.
Questions for authors
- How is related to , the quantity analyzed by Lowe et al.?
- Why call dq a measure of dequantization when classically simulable circuits lie on the same curve?
- Is it possible to exhibit the low-entropy optimum on a band-limited target whose signal is well above the noise level?
- Off-diagonal concentration and kernel–target alignment predict NLL better. Which practical decision does improve?