Quantum Dynamics Applications in Supervised Machine Learning

I’d like to draw your attention to a new paper on arXiv, “Shallow-circuit Supervised Learning on a Quantum Processor”, from IBM and Qognitive that develops a Hamiltonian-based framework for quantum machine learning. Instead of fixed amplitude or angle encodings used in many prior approaches, our method learns a local Hamiltonian embedding for classical data. https://lnkd.in/ejcxYstW We are very interested in new approaches to QML as we deal with recurring bottlenecks like expensive classical data loading and difficult training dynamics in parameterized circuit models. Here, both the feature operators and the label operator are learned during training, with predictions obtained from measurements on an approximate ground state. This aims to avoid those bottlenecks. A key enabler is Sample-based Krylov Quantum Diagonalization (SKQD), which approximates low-energy states by sampling from time-evolved Krylov states and then diagonalizing the Hamiltonian in the sampled subspace. SKQD was recently employed to estimate low-energy properties of impurity models (https://lnkd.in/epwCrG5R). In our setting, restricting to 2-local Hamiltonian embeddings keeps the required time-evolution circuits relatively shallow, which helps make the approach practical on current quantum processors. The team demonstrates end-to-end training on IBM Heron processor up to 50 qubits, with non-vanishing gradients and strong proof-of-concept performance on a binary classification task. There are many exciting next steps here, including testing on broader datasets, using more expressive operator ansatz, and performing systematic comparisons to strong classical baselines to pinpoint when Hamiltonian-based encodings offer the right inductive bias. I encourage the community to try out this approach and explore where it can be extended in meaningful ways.

Exciting work from Caltech, Google Quantum AI, MIT, and Oratomic on quantum advantage for classical machine learning. The long standing question: can quantum computers offer a rigorous advantage in large scale classical data processing, not just specialized problems like cryptography or quantum simulation? This paper gives rigorous results for formalized machine learning tasks. In the benchmarks they report, a quantum computer with fewer than 60 logical qubits performs classification and dimension reduction on massive datasets using 4 to 6 orders of magnitude less memory than the classical and QRAM based baselines in the paper. The key idea is quantum oracle sketching. Instead of loading an entire dataset into quantum memory, it streams classical samples one at a time, applies small quantum rotations, and discards each sample immediately. These operations coherently build an approximate quantum oracle that can then be used in downstream quantum algorithms. The authors present numerical experiments on IMDb sentiment analysis and single cell RNA sequencing that are consistent with the theory. What makes this notable: - A provable quantum memory advantage for classification and dimension reduction - The advantage is framed as a theorem under the paper's learning model, not just a conjecture or empirical trend - The approach is designed to work with streaming, noisy, and time varying classical data Read the paper here: https://lnkd.in/g77PuZzQ

🚀 New Paper on arXiv! I’m excited to share our latest work: “Learning to Program Quantum Measurements for Machine Learning” 📌 arXiv: https://lnkd.in/euRhBQJM 👥 With Huan-Hsin Tseng (Brookhaven National Lab), Hsin-Yi Lin (Seton Hall University), and Shinjae Yoo (BNL) In this paper, we challenge a long-standing limitation in quantum machine learning: static measurements. Most QML models rely on fixed observables (e.g., Pauli-Z), limiting the expressivity of the output space. We take this one step further--by making the quantum observable (Hermitian matrix) a learnable, input-conditioned component, programmed dynamically by a neural network. 🧠 Our approach integrates: 1. A Fast Weight Programmer (FWP) that generates both VQC rotation parameters and quantum observables 2. A differentiable, end-to-end architecture for measurement programming 3. A geometric formulation based on Hermitian fiber bundles to describe quantum measurements over data manifolds 🧪 Experiments on noisy datasets (make_moons, make_circles, and high-dimensional classification) show that our dual-generator model outperforms all traditional baselines—achieving faster convergence, higher accuracy, and stronger generalization even under severe noise. We believe this work opens the door to adaptive quantum measurements and paves the way toward more expressive and robust QML models. If you're working on QML, differentiable quantum programming, or quantum meta-learning, I’d love to connect! #QuantumMachineLearning #QuantumComputing #QML #FastWeightProgrammer #DifferentiableQuantumProgramming #arXiv #HybridAI #AI #Quantum

⚛️ Parallel Data Processing in Quantum Machine Learning 🧾 We propose a Quantum Machine Learning (QML) framework that leverages quantum parallelism to process entire training datasets in a single quantum operation, addressing the computational bottleneck of sequential data processing in both classical and quantum settings. Building on the structural analogy between feature extraction in foundational quantum algorithms and parameter optimization in QML, we embed a standard parameterized quantum circuit into an integrated architecture that encodes all training samples into a quantum superposition and applies classification in parallel. This approach reduces the theoretical complexity of loss function evaluation from O(N^2) in conventional QML training to O(N), where N is the dataset size. Numerical simulations on multiple binary and multi-class classification datasets demonstrate that our method achieves classification accuracy comparable to conventional circuits while offering substantial training time savings. These results highlight the potential of quantum-parallel data processing as a scalable pathway to efficient QML implementations. ℹ️ Ramezani et al - 2025

Quantum Machine Learning (QML) offers a new paradigm for addressing complex financial problems intractable for classical methods. This work specifically tackles the challenge of few-shot credit risk assessment, a critical issue in inclusive finance where data scarcity and imbalance limit the effectiveness of conventional models. To address this, the researchers design and implement a novel hybrid quantum-classical workflow. The methodology first employs an ensemble of classical machine learning models (Logistic Regression, Random Forest, XGBoost) for intelligent feature engineering and dimensionality reduction. Subsequently, a Quantum Neural Network (QNN), trained via the parameter-shift rule, serves as the core classifier. This framework was evaluated through numerical simulations and deployed on the Quafu Quantum Cloud Platform's ScQ-P21 superconducting processor. On a real-world credit dataset of 279 samples, the QNN achieved a robust average AUC of 0.852 +/- 0.027 in simulations and yielded an impressive AUC of 0.88 in the hardware experiment. This performance surpasses a suite of classical benchmarks, with a particularly strong result on the recall metric. This study provides a pragmatic blueprint for applying quantum computing to data-constrained financial scenarios in the NISQ era and offers valuable empirical evidence supporting its potential in high-stakes applications like inclusive finance.