Comment on 'Supervised quantum machine learning models are kernel methods'

• URL: http://arxiv.org/abs/2608.24923v1
• Date: Tue, 18 Aug 2026 20:23:30 GMT
• Title: Comment on 'Supervised quantum machine learning models are kernel methods'
• Abstract summary: We identify a few small errors in the proof of Theorem 1 in M. Schuld.<n>These do not affect the validity of the theorem, but do matter if one wants to use the appendix to explicitly compute the Fourier coefficients of a quantum kernel.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We identify a few small errors in the proof of Theorem 1 in M. Schuld, 'Supervised quantum machine learning models are kernel methods' (arXiv:2101.11020v2), Appendix A. These do not affect the validity of the theorem, but do matter if one wants to use the appendix to explicitly compute the Fourier coefficients of a quantum kernel. We give the corrected derivation, and additionally show that the paper's worked cosine-kernel example contains a second, unrelated error that happens to cancel the first, thereby coincidentally yielding the correct result.

Related papers

• Effective Dimension Governs Generalization in Quantum Kernel Vision Models [31.082191748525137]
  We show that entanglement structure and quantum noise are two knobs that move $d_rm eff$.<n>Amplitude damping contracts $d_rm eff$ and lifts test accuracy by up to $+13%$ along an inverted-U sweet spot.
  arXiv  Detail & Related papers  (2026-06-18T12:55:59Z)
• Normal quantum channels and Markovian correlated two-qubit quantum errors [77.34726150561087]
  We study general normally'' distributed random unitary transformations. On the one hand, a normal distribution induces a unital quantum channel. On the other hand, the diffusive random walk defines a unital quantum process.
  arXiv  Detail & Related papers  (2023-07-25T15:33:28Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
  We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
  arXiv  Detail & Related papers  (2022-12-06T22:01:49Z)
• On the misinterpretation of conditionally-solvable quantum-mechanical problems [0.0]
  We show that the supposedly exact solutions to radial eigenvalue equations derived in recent papers are not correct because they do not satisfy some well-known theorems.
  arXiv  Detail & Related papers  (2022-05-15T18:13:45Z)
• Noisy Quantum Kernel Machines [58.09028887465797]
  An emerging class of quantum learning machines is that based on the paradigm of quantum kernels. We study how dissipation and decoherence affect their performance. We show that decoherence and dissipation can be seen as an implicit regularization for the quantum kernel machines.
  arXiv  Detail & Related papers  (2022-04-26T09:52:02Z)
• The complexity of quantum support vector machines [1.7887848708497243]
  Quantum support vector machines employ quantum circuits to define the kernel function. We show that the dual problem can be solved in $O(M4.67/varepsilon2)$ quantum circuit evaluations.
  arXiv  Detail & Related papers  (2022-02-28T19:01:17Z)
• Non-commutative graphs based on finite-infinite system couplings: quantum error correction for a qubit coupled to a coherent field [0.0]
  We study error correction in the case of a finite-dimensional quantum system coupled to an infinite dimensional system. We find the quantum anticlique, which is the projector on the error correcting subspace, and analyze it as a function of the frequencies of the qubit and the bosonic field.
  arXiv  Detail & Related papers  (2021-04-24T12:06:43Z)
• Towards understanding the power of quantum kernels in the NISQ era [79.8341515283403]
  We show that the advantage of quantum kernels is vanished for large size datasets, few number of measurements, and large system noise. Our work provides theoretical guidance of exploring advanced quantum kernels to attain quantum advantages on NISQ devices.
  arXiv  Detail & Related papers  (2021-03-31T02:41:36Z)
• Fusion-based quantum computation [43.642915252379815]
  Fusion-based quantum computing (FBQC) is a model of universal quantum computation in which entangling measurements, called fusions, are performed on qubits of small constant-sized entangled resource states. We introduce a stabilizer formalism for analyzing fault tolerance and computation in these schemes. This framework naturally captures the error structure that arises in certain physical systems for quantum computing, such as photonics.
  arXiv  Detail & Related papers  (2021-01-22T20:00:22Z)
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
  We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates. Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
  arXiv  Detail & Related papers  (2020-04-24T17:58:10Z)
• Sample-efficient learning of quantum many-body systems [17.396274240172122]
  We study the problem of learning the Hamiltonian of a quantum many-body system given samples from its Gibbs state. We give the first sample-efficient algorithm for the quantum Hamiltonian learning problem.
  arXiv  Detail & Related papers  (2020-04-15T18:01:59Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.