arXiv:2606. 26312v1 Announce Type: cross Abstract: Autoencoders transformed classical machine learning by solving the curse of dimensionality, enabling principled weight initialization and learning compact, structured representations.
By Aldo Lamarre, Dominik \v{S}afr\'anek
The paper investigates whether quantum reinforcement learning algorithms can be matched by efficient classical methods. It focuses on a simplified reinforcement learning setting with a uniform generative model, providing finite‑sample guarantees for classical kernelized Fitted Q‑Iteration that uses kernels aligned with parameterized quantum circuits. The authors identify sufficient conditions on data encoding, kernel choice, and problem structure under which this classical approach dequantizes quantum Q‑learning, and suggest using kernelized Fitted Q‑Iteration as a heuristic when those conditions cannot be verified.
By Pablo Rodriguez-Grasa, Sofiene Jerbi, Mikel Sanz, Ryan Sweke
arXiv:2606. 31536v1 Announce Type: new Abstract: As Quantum Machine Learning (QML) transitions toward practical implementation, the field faces a critical architectural bottleneck that challenges the fundamental assumptions of classical statistical learning theory.
By Kung-Ming Lan
arXiv:2606. 14822v1 Announce Type: cross Abstract: Recent advances in Machine Learning have transformed numerous industrial sectors, yet classical paradigms face fundamental limitations: rapidly growing data volumes, rising computational costs, significant energy consumption, and the physical scaling limits of conventional hardware architectures.
By L\'eo Monbroussou
arXiv:2508. 19437v2 Announce Type: replace-cross Abstract: The importance of analyzing nontrivial datasets when testing quantum machine learning (QML) models is becoming increasingly prominent in literature, yet a cohesive framework for understanding dataset characteristics remains elusive.
By Alona Sakhnenko, Christian B. Mendl, Jeanette M. Lorenz
The paper derives a closed‑form expression for the reduced quantum channel of a single‑qubit Interactive Quantum Classifier (IQC), revealing that Hamiltonian parameters directly control the constant, sine, and cosine components of the classifier output. This Fourier interpretation motivates a generalized family of Hamiltonian encodings, including matrix‑parameterized environmental Hamiltonians that produce non‑separable Fourier structures. Numerical experiments on synthetic and real‑world datasets demonstrate that these generalized encodings improve classification performance on several nonlinear benchmarks, with a simpler four‑parameter extension achieving comparable results with fewer trainable parameters.
By F\'abio Novaes, Fernando M. de Paula Neto, Jo\~ao V. M. Cardoso