Sparse identification of nonlinear dynamics (SINDy) is a data-driven framework for estimating classical nonlinear dynamical systems from time-series data. In this approach, system dynamics is represented as a linear combination of a predefined set of basis functions, and the corresponding coefficients are sparsely estimated from observed time-series data. In this study, we propose sparse identification of quantum Hamiltonian dynamics (SIQHDy), a SINDy-inspired quantum circuit learning framework for estimating quantum Hamiltonian dynamics from time-series data of quantum measurement outcomes. In SIQHDy, the unitary evolution of a quantum Hamiltonian system is expressed as a product of basis quantum circuits, and the corresponding circuit parameters are estimated through sparsity-promoting optimization. We numerically demonstrate that SIQHDy accurately reconstructs the dynamics of single-, three-, and five-spin systems, and exhibits robustness to measurement noise in the three-spin case. Furthermore, we propose an extension of SIQHDy for scenarios with limited accessible observables and evaluate its performance in identifying two-spin systems and in network-structure identification for five-spin systems.
Sparse identification of nonlinear dynamics (SINDy) is a data-driven framework for estimating classical nonlinear dynamical systems from time-series data. In this approach, system dynamics is represented as a linear combination of a predefined set of basis functions, and the corresponding coefficients are sparsely estimated from observed time-series data. In this study, we propose sparse identification of quantum Hamiltonian dynamics (SIQHDy), a SINDy-inspired quantum circuit learning framework for estimating quantum Hamiltonian dynamics from time-series data of quantum measurement outcomes. In SIQHDy, the unitary evolution of a quantum Hamiltonian system is expressed as a product of basis quantum circuits, and the corresponding circuit parameters are estimated through sparsity-promoting optimization. We numerically demonstrate that SIQHDy accurately reconstructs the dynamics of single-, three-, and five-spin systems, and exhibits robustness to measurement noise in the three-spin case. Furthermore, we propose an extension of SIQHDy for scenarios with limited accessible observables and evaluate its performance in identifying two-spin systems and in network-structure identification for five-spin systems.
Abstract Sparse identification of nonlinear dynamics (SINDy) is a data-driven framework for estimating classical nonlinear dynamical systems from time-series data. In this approach, system dynamics is represented as a linear combination of a predefined set of basis functions, and the corresponding coefficients are sparsely estimated from observed time-series data. In this study, we propose sparse identification of quantum Hamiltonian dynamics (SIQHDy), a SINDy-inspired quantum circuit learning framework for estimating quantum Hamiltonian dynamics from time-series data of quantum measurement outcomes. In SIQHDy, the unitary evolution of a quantum Hamiltonian system is expressed as a product of basis quantum circuits, and the corresponding circuit parameters are estimated through sparsity-promoting optimization. We numerically demonstrate that SIQHDy accurately reconstructs the dynamics of single-, three-, and five-spin systems, and exhibits robustness to measurement noise in the three-spin case. Furthermore, we propose an extension of SIQHDy for scenarios with limited accessible observables and evaluate its performance in identifying three-spin systems and in network-structure identification for five-spin systems.
Quantum circuit learning (QCL) is a hybrid quantum-classical machine learning technique designed for noisy intermediate-scale quantum (NISQ) devices. In QCL, classical data are encoded into quantum states and processed through parameterized quantum gates, and the resulting quantum measurement outcomes are used to optimize circuit parameters via classical optimization algorithms for machine learning. Sparse identification of nonlinear dynamics (SINDy) is a method for estimating classical nonlinear dynamical systems from time series data. In SINDy, system dynamics is approximately represented as a linear combination of a predefined set of basis functions, with their coefficients sparsely estimated from the time-series data. In this study, we propose sparse identification of quantum Hamiltonian dynamics (SIQHDy), a SINDy-inspired quantum circuit learning algorithm for estimating quantum Hamiltonian dynamics from time-series data. In SIQHDy, quantum Hamiltonian dynamics is approximately represented as a product of basis quantum circuits, with their parameters sparsely estimated from time-series data of quantum measurement outcomes. We numerically demonstrate that SIQHDy can successfully estimate the dynamics of single-, two-, and five-qubit systems and that the advantage of sparsity becomes evident when using time-series data with measurement noise.
Quantum feature maps offer expressive embeddings for classical learning tasks, and augmenting sparse identification of nonlinear dynamics (SINDy) with such features is a natural but unexplored direction. We introduce \textbf{Q-SINDy}, a quantum-kernel-augmented SINDy framework, and identify a specific failure mode that arises: \emph{coefficient cannibalization}, in which quantum features absorb coefficient mass that rightfully belongs to the polynomial basis, corrupting equation recovery. We derive the exact cannibalization-bias formula ΔξP=(P⊤P)−1P⊤Qξ^Q and prove that orthogonalizing quantum features against the polynomial column space at fit time eliminates this bias exactly. The claim is verified numerically to machine precision (<10−12) on multiple systems. Empirically, across six canonical dynamical systems (Duffing, Van der Pol, Lorenz, Lotka-Volterra, cubic oscillator, Rössler) and three quantum feature map architectures (ZZ-angle encoding, IQP, data re-uploading), orthogonalized Q-SINDy consistently matches vanilla SINDy's structural recovery while uncorrected augmentation degrades true-positive rates by up to 100\%. A refined dynamics-aware diagnostic, RQ2 for X˙, predicts cannibalization severity with statistical significance (Pearson r=0.70, p=0.023). An RBF classical-kernel control across 20 hyperparameter configurations fails more severely than any quantum variant, ruling out feature count as the cause. Orthogonalization remains robust under depolarizing hardware noise up to 2\% per gate, and the framework extends without modification to Burgers' equation.
Characterizing the dynamics of open quantum systems at the level of microscopic interactions and error mechanisms is essential for calibrating quantum hardware, designing robust simulation protocols, and developing tailored error-correction methods. Under Markovian noise/dissipation, a natural characterization approach is to identify the full Lindbladian generator that gives rise to both coherent (Hamiltonian) and dissipative dynamics. Prior protocols for learning Lindbladians from dynamical data assumed pre-specified interaction structure, which can be restrictive when the relevant noise channels or control imperfections are not known in advance. In this paper, we present a sample-efficient protocol for learning sparse Lindbladians without assuming any a priori structure. Our protocol is ancilla-free, uses only product-state preparations and Pauli-basis measurements, admits provably stable coefficient reconstruction, and achieves near-optimal time resolution, making it compatible with near-term experimental capabilities. Together, this provides a systematic route to scalable characterization of open-system quantum dynamics, especially in settings where the error mechanisms of interest are unknown.
Accurate identification of unknown quantum systems is essential for quantum computing, sensing, and control because the Hamiltonian governs quantum state evolution. This work proposes a QNN based framework for black box Hamiltonian learning and quantum system emulation using full density matrix trajectory learning. Unlike approaches based only on final states or selected observables, the method exploits the complete temporal evolution of the density matrix under Lindblad dynamics. A synthetic dataset of physically admissible Hamiltonians and dissipation parameters is generated to emulate experimental measurements. The QNN learns a nonlinear mapping from control inputs to a 32-dimensional Hamiltonian coefficient vector, enabling reconstruction and differentiable emulation of the unknown system. Chirped excitation and randomized initial quantum states are incorporated to improve robustness and provide richer dynamical information. Performance is evaluated using trajectory density loss, quantum-state fidelity, and trace distance. Randomized initialization improves state-level reconstruction, increasing fidelity to 0.929 for the single qubit benchmark and 0.787 for the unknown system, while reducing trace distance to 0.124 and 0.316, respectively. In contrast, chirped excitation primarily improves optimization by accelerating convergence and reducing trajectory density loss. Finally, the learned Hamiltonian is mapped onto a physical two qubit bus resonator architecture in the dispersive regime, yielding key circuit parameters including transmon capacitances, Josephson inductances, qubit separation, and bus-resonator length. The framework therefore establishes a data-driven pathway from black box quantum system identification to physical quantum emulation, with potential applications in quantum digital twin modeling.
The Hamiltonian of a quantum system governs the dynamics of the system via the Schrodinger equation. In this paper, the Hamiltonian is reconstructed in the Pauli basis using measurables on random states forming a time series data set. The time propagation is implemented through Trotterization and optimized variationally with gradients computed on the quantum circuit. We validate our output by reproducing the dynamics of unseen observables on a randomly chosen state not used for the optimization. Unlike existing techniques that try and exploit the structure/properties of the Hamiltonian, our scheme is general and provides freedom with regard to what observables or initial states can be used while still remaining efficient with regard to implementation. We extend our protocol to doing quantum state learning where we solve the reverse problem of doing state learning given time series data of observables generated against several Hamiltonian dynamics. We show results on Hamiltonians involving XX, ZZ couplings along with transverse field Ising Hamiltonians and propose an analytical method for the learning of Hamiltonians consisting of generators of the SU (3) group. This paper is likely to pave the way toward using Hamiltonian learning for time series prediction within the context of quantum machine learning algorithms.