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 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.
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.
Quantum Circuit Learning (QCL) is one approach to leveraging Noisy-Intermediate-Scale Quantum (NISQ) devices, which have a limited number of qubits and are unable to correct physical errors. While QCL was initially expected to be tolerant of overfitting, intrinsic noise in these devices limits the performance of QCL applications. To address this issue, we propose a circuit configuration that combines data re-uploading with dynamic circuit techniques. We developed a QCL circuit with dynamic circuit integration to mitigate the effects of noise on both the learning and estimation phases. To assess the effectiveness of the proposed method, we implemented the circuit on a classical simulator with realistic noise models and trained it on various toy classification problems. Our results show that the proposed circuit estimates the correct labels of test data more accurately than the original data re-uploading circuit. We also explore possible extensions of the proposed method.
Hybridizing machine learning (ML) with quantum computing has become an attractive strategy to increase computational power on Noisy Intermediate Scale Quantum (NISQ) devices. Although these can be potentially quantum advantage devices, their qubit numbers and noise are bounded and there are challenges when it comes to practical quantum circuit realization. This work concentrates on the creation of optimized quantum circuits via ML-based strategies, to enhance the performance of the circuits, to reduce the error rate and to accommodate the particular noise profile of the hardware of NISQ devices. The resulting suboptimal mappings with little or no consideration of noise and hardware topology in traditional quantum compilers can ruin the fidelity of quantum algorithm. Leveraging machine learning, and specifically reinforcement and supervised learning methods, our method learns to optimize compilation strategy for specific quantum hardware architecture. The paper proposes a framework that uses machine learning models to predict qubit mappings, gate decompositions, and transpilation paths that minimize gate depth and error accumulation. We also investigate transfer learning methods for propagating the learned compilation strategies to novel NISQ machines. Such methods are empirically validated on both simulated and real quantum hardware backends, providing evidence of circuit depth, execution time and error reductions. The results show that ML-assisted compilation can achieve better success probabilities for benchmark quantum algorithms like VQE and QAOA than conventional compilers. Furthermore, the work examines the interpretability of ML models providing hardware-aware optimization recommendations and understanding the noise patterns and methods of error correction. Our work highlights the key role of ML for transferring between theoretical quantum algorithms and their practical NISQ implementations. This integration boosts the immediate applicability of existing quantum devices and provides a basis for adaptive and scalable likelihood-based compilation for the era of fault-tolerant quantum computation. Our results motivate further investigation of hybrid classical-quantum workflows, in which ML iteratively improves compilation in accordance with changing hardware noise and capabilities. By improving quantum circuit compilation onNISQ computers, this work is taking steps toward the realization of quantum advantage in application scenarios such as optimization, cryptography, and quantum simulation without needing to wait for fully fault-tolerant large-scale quantum computers.
Abstract Quantum machine learning is an approach that aims to improve the performance of machine learning methods by leveraging the properties of quantum computers. Quantum circuit learning (QCL) is a supervised learning framework that can be implemented using variational quantum algorithms. The parameterized quantum circuits are used as models that transform input data into predictions, and one can naturally represent a quantum model as a Fourier series of the data. The process of encoding input data into quantum states has been widely discussed for its important role in the learning models. In particular, the properties of the eigenvalues of the Hamiltonian used for encoding significantly influence the number of accessible Fourier components. Recent encoding methods have demonstrated that the number of accessible Fourier components can be enhanced by applying exponentially large magnetic fields proportional to the number of qubits. However, this approach poses a challenge as it requires exponentially increasing magnetic fields, which are impractical for implementation in large-scale systems. Here, we propose a QCL method that leverages a non-integrable Hamiltonian for encoding, aiming to achieve both practical feasibility and a large number of accessible Fourier components. We find that the thermalization properties of non-integrable systems over long timescales, implying that the energy difference has a low probability to be degenerate, lead to an exponentially large number of accessible Fourier components. Since the required magnetic field strength remains within a practical range, our approach to using the non-integrable system is suitable for intermediate-scale quantum computers. Our results bridge the dynamics of non-integrable systems and the field of quantum machine learning, suggesting the potential for significant interdisciplinary contributions.
Parameterized quantum circuits (PQCs) play an essential role in the application of variational quantum algorithms (VQAs) in noisy intermediate-scale quantum (NISQ) devices. The PQCs are a leading candidate to achieve a quantum advantage in NISQ devices and have already been applied in various domains such as quantum chemistry, quantum machine learning, combinatorial optimization, and many others. There is no single definitive way to optimize PQCs. The most commonly used methods are based on computing the gradient via the parameter-shift rule to use classical gradient descent (GD) optimizers like Adam, stochastic GD, and others. In addition, sequential single-qubit optimizers have been proposed, such as Rotosolve, Free-Axis Selection (Fraxis), Free-Quaternion Selection (FQS), and hybrid algorithms from the aforementioned optimizers. We further develop hybrid algorithms than those represented in the previous work by drawing inspiration from the early stopping method used in classical machine learning. The switch between the optimizers depends on the previous cost function values compared to the previous ones. We introduce two new hybrid algorithms that are more robust and scalable, and they outperform previous hybrid methods in terms of convergence towards the global minima across various cost functions. In addition, we find that they are feasible for NISQ devices with different noise profiles.
Time-series forecasting is vital across sectors such as finance, energy, and environmental science, where accurate future predictions drive informed decision-making. Traditional statistical methods and deep learning models like LSTM and Transformers, while effective, often struggle with high-dimensional data and long-term dependencies. In this paper, we propose a hybrid quantum-classical model that utilizes Parameterized Quantum Circuits (PQCs) to capture complex temporal patterns in multivariate time-series data. Our architecture integrates a classical encoder, a quantum variational processor, and a classical decoder, trained end-to-end using gradient-based optimization. Experiments conducted on benchmark datasets—electricity load, stock prices, and weather forecasting—demonstrate that the hybrid model consistently outperforms classical baselines in terms of Mean Squared Error (MSE), Mean Absolute Error (MAE), and R² score. Robustness analysis confirms the model’s resilience to moderate quantum noise, while an ablation study highlights the performance gain from quantum components. This work showcases the potential of hybrid quantum-classical approaches on Noisy Intermediate-Scale Quantum (NISQ) devices and lays a foundation for scalable, real-world quantum machine learning applications.