Machine learning is widely regarded as a promising application in which quantum computing could offer a computational advantage. However, general quantum machine learning models with provable guarantees on performance, trainability, and efficient inference remain limited. In this work, we introduce quantum Hamiltonian embeddings, a supervised learning framework in which a classical training dataset is encoded into a single effective, parameterized Hamiltonian. Training optimizes the parameters of this data-dependent Hamiltonian, whose approximate ground state defines the classification rule. Once the ground state has been approximated using a quantum algorithm, inference can be performed either classically using a classical representation of the learned state, or with a quantum representation of the state. We establish efficient methods for gradient estimation and prove favorable generalization guarantees. Furthermore, under standard cryptographic assumptions, we show that Hamiltonian embeddings can realize hypothesis functions beyond the reach of efficient classical algorithms. We then demonstrate the framework at scale on IBM Heron processors using a standard benchmark dataset. Together, these results establish Hamiltonian embeddings as a new framework for quantum machine learning, combining theoretical guarantees with a path for experimental investigations at scale on quantum hardware.
Abstract Quantum computers promise to enhance machine learning for practical applications. Quantum machine learning for real-world data has to handle extensive amounts of high-dimensional data. However, conventional methods for measuring quantum kernels are impractical for large datasets as they scale with the square of the dataset size. Here, we measure quantum kernels using randomized measurements. The quantum computation time scales linearly with dataset size and quadratic for classical post-processing. While our method scales in general exponentially in qubit number, we gain a substantial speed-up when running on intermediate-sized quantum computers. Further, we efficiently encode high-dimensional data into quantum computers with the number of features scaling linearly with the circuit depth. The encoding is characterized by the quantum Fisher information metric and is related to the radial basis function kernel. Our approach is robust to noise via a cost-free error mitigation scheme. We demonstrate the advantages of our methods for noisy quantum computers by classifying images with the IBM quantum computer. To achieve further speedups we distribute the quantum computational tasks between different quantum computers. Our method enables benchmarking of quantum machine learning algorithms with large datasets on currently available quantum computers.
Kohn-Sham density functional theory (DFT) is the workhorse of quantum chemistry, offering an attractive balance between accuracy and computational cost. Although exact in principle, DFT in practice relies on an approximation to the unknown exchange-correlation (XC) functional, which encodes the many-body quantum effects beyond the mean-field treatment. Many such approximations exist, and machine-learned XC functionals have proliferated in recent years. A persistent challenge in this area is the trade-off between accuracy and computational cost: while high-accuracy ML functionals have shown success on strongly correlated systems that are notoriously difficult for conventional approximations, their unfavorable scaling has limited broader adoption. Here, we propose a linearly scaling non-local XC approximation based on an expander graph transformer ansatz, improving the scaling of
O(N2) or worse for previous ML functionals capable of reliably capturing strongly correlated systems. We show that it recovers the correct
H2 dissociation curve in the strongly correlated regime, with promising results on planar
H4, a system where even high-level coupled cluster methods break down. Our approach thus charts a path toward ML functionals that are both accurate on strongly correlated systems and cheap enough to deploy at scale.