Validity of the quantum circuit learning (QCL) method for the prediction of physical properties of complex materials has been explored by comparing the prediction results of Vickers hardness of the high entropy alloys with those predicted by the conventional linear and nonlinear types of machine learning methods. The linear models include linear regression (LR), ridge regression (Ridge), Bayesian ridge regression (BR), and linear support vector regression (linear_SVR) for linear models, and the nonlinear models include Gaussian process regression (GBR), support vector regression with an radial basis function kernel (rbf_SVR), random forest (RF), gradient boosting decision trees (GBDT), and multilayer perceptron neural networks (MLP). Our current examinations revealed that the QCL can efficiently predict Vickers hardness of the high entropy alloys for outside applicability domains and extrapolations even with a small number of datasets, which implies that the QCL can be used for the design of new complex materials from an early stage of development with a small dataset.
Validity of the quantum circuit learning (QCL) method for the prediction of physical properties of complex materials has been explored by comparing the prediction results of Vickers hardness of the high entropy alloys with those predicted by the conventional linear and nonlinear types of machine learning methods. The linear models include linear regression (LR), ridge regression (Ridge), Bayesian ridge regression (BR), and linear support vector regression (linear_SVR) for linear models, and the nonlinear models include Gaussian process regression (GBR), support vector regression with an radial basis function kernel (rbf_SVR), random forest (RF), gradient boosting decision trees (GBDT), and multilayer perceptron neural networks (MLP). Our current examinations revealed that the QCL can efficiently predict Vickers hardness of the high entropy alloys for outside applicability domains and extrapolations even with a small number of datasets, which implies that the QCL can be used for the design of new complex materials from an early stage of development with a small dataset.
This study investigates the application of machine learning techniques for predicting gate depth in quantum computational systems, focusing on the relationship between quantum circuit parameters and computational performance. Using a dataset of 50 observations encompassing qubit count, gate depth, entanglement rate, and logical error rate, we developed and compared Linear Regression (LR) and Random Forest Regression (RFR) models for gate depth prediction. The research addresses critical challenges in quantum fault tolerance and circuit optimization, which are essential for achieving scalable quantum computation. Our analysis revealed strong negative correlation (-0.65) between qubit count and logical error rate, while gate depth showed moderate positive correlation (0.62) with error rates. The Random Forest model demonstrated superior performance with R² values of 0.96068 on training data and 0.87262 on testing data, significantly outperforming Linear Regression (R²: 0.87552 training, 0.60257 testing). Error metrics further confirmed RFR's superiority, achieving RMSE of 2.33 (training) and 2.97 (testing) compared to LR's 4.15 and 5.25 respectively. The study highlights the importance of quantum error correction mechanisms and the inherent trade-offs between circuit complexity and computational reliability. Both models showed expected performance degradation from training to testing, with RFR maintaining better generalization capabilities. These findings contribute to the development of typed models for quantum mechanics in computational applications, offering insights into quantum circuit optimization and fault-tolerant design. The research demonstrates that ensemble methods like Random Forest provide more robust predictions for quantum system parameters, supporting the advancement of practical quantum computing implementations and algorithm development. KeyWords: Quantum Computation, Gate Depth Prediction, Random Forest Regression, Quantum Error Correction, Machine Learning, Fault Tolerance.
Quantum Machine Learning (QML) has emerged as a paradigm that combines the computational advantages of quantum computing with the predictive capabilities of machine learning to address complex data classification problems. As data dimensionality increases rapidly and classical learning algorithms face scalability constraints, QML leverages quantum parallelism, entanglement, and high-dimensional Hilbert space representations to enhance learning performance. This paper reviews and analyses advanced QML algorithms, including Quantum Support Vector Machines (QSVM), Variational Quantum Circuits (VQC), Quantum Neural Networks (QNN), and Quantum Kernel Estimation, for optimizing both binary and multi-class classification tasks under high-complexity conditions. The proposed QML framework is evaluated on benchmark datasets like MNIST, the Breast Cancer Wisconsin (BCW) dataset, and synthetic nonlinear datasets, and is compared against classical machine learning baselines, including Support Vector Machines (SVM), Random Forests (RF), and Deep Neural Networks (DNN). The results demonstrate notable improvements in classification accuracy (up to 96.8%), decision margins, and computational efficiency in quantum-suitable data regimes, while also highlighting current limitations related to noise, circuit depth, and hardware constraints. Overall, the study presents a unified QML framework, theoretical formulations, and experimental evaluations that illustrate the potential of quantum algorithms for next-generation classification tasks.
Quantum machine learning (QML) represents a convergence of quantum computing and statistical learning theory with transformative potential for high-throughput computational materials discovery. This empirical study systematically benchmarks six QML architectures — quantum kernel support vector machines, variational quantum eigensolvers augmented by graph neural networks, quantum approximate optimization algorithm hybrids, quantum random forests, quantum Boltzmann machines, and parameterized quantum circuit-based neural networks — against their classical analogues across five material classes comprising perovskite oxides, battery cathode materials, two-dimensional semiconductor alloys, metal-organic frameworks, and high-entropy alloys. Using 14,720 DFT-computed property records drawn from the Materials Project and AFLOW databases as the common evaluation corpus, the QML methods achieved mean absolute error reductions of 38–61% and training time compressions of 29–61% relative to equivalent classical estimators at equivalent dataset sizes. The quantum random forest architecture exhibited the strongest overall performance (MAE = 0.026 eV; R² = 0.978), while hardware-native implementations on IBM Quantum Eagle and IonQ Forte achieved practical speed-ups of 28x–41x over CPU-based baselines. Barren plateau pathology and noise-induced gradient suppression remained the principal barriers to scaling beyond 50 qubits on current NISQ hardware. The empirical results of this study established principal conclusions that advance the theoretical and practical understanding of QML in materials discovery contexts. These findings provide grounding for deploying QML in production materials informatics pipelines.
With the increasing demand for high-performance materials in energy, healthcare, and electronics, the discovery of novel nanomaterials has become a critical area of research. Traditional methods for predicting material properties, such as Density Functional Theory (DFT) and classical machine learning (ML), often struggle with scalability and computational efficiency when dealing with complex, high-dimensional quantum systems. This study explores the potential of Quantum Machine Learning (QML) as a transformative tool for accelerating nanomaterial property prediction. By leveraging quantum computing frameworks like IBM Qi skit and PennyLane, quantum algorithms such as Quantum Support Vector Machines (QSVM) and Quantum Neural Networks (QNN) were applied to a real-world dataset containing 486 nanomaterial entries. Comparative analysis using performance metrics like MAE, RMSE, and R2 demonstrated that quantum models outperformed classical ones in both accuracy and adaptability to data complexity. Power BI was used for advanced visualization to interpret feature relationships, entropy levels, and prediction patterns across models. Key findings suggest that QML provides a promising alternative to conventional methods by offering faster, more accurate predictions, particularly for datasets with high entropy. While challenges remain—such as limited dataset scope and hardware access—this study lays the groundwork for broader adoption of QML in computational material science and calls for future research involving real quantum hardware and larger, more diverse datasets.
This thesis investigates the interplay between machine learning (ML) and quantum mechanics to advance quantum machine learning (QML) and quantum calculations, addressing computational challenges in quantum machine learning, materials science, and condensed matter physics. The high dimensionality of quantum systems often renders traditional methods computationally intensive. By integrating classical and quantum ML techniques, innovative algorithms are developed to enhance efficiency and accuracy. The first part investigates the design and optimization of quantum circuit architectures for quantum machine learning, with a focus on quantum support vector machines (QSVM). I develop a Bayesian algorithm that adaptively constructs quantum kernels, achieving superior performance over classical kernels in small-data classification tasks. I also establish an isomorphism between quantum circuits and polyatomic molecules, which enables the restriction of the search space for compositional optimization of quantum circuits. Additionally, I introduce a flexible scheme that maps quantum circuits into graph representations compatible with the neutral atom quantum hardware. Using this circuit-graph mapping scheme, I develop a Gaussian process regression model with quantum evolution kernels and a classical graph neural network to interpolate QSVM accuracy on graph-structured data. The second part applies ML to accelerate quantum calculations. I develop a variational algorithm based on eigenvector continuation to compute ground state energies of particle-phonon systems. This algorithm constructs the lowest eigenvalue and eigenvector for extended lattices by solving eigenvalue problems for small, independent lattice segments, with a lower computational cost. This enables the application of variational quantum eigensolvers to particle-phonon interactions in large and disordered lattices, reducing the demands on quantum resources. I also developed Gaussian process models to accelerate Green’s function calculations for electron-phonon systems, achieving high accuracy by extrapolating from restricted Hilbert spaces to larger systems with lower computational cost. Ultimately, this thesis demonstrates that these advancements pave the way for applications, including the design of materials, enhanced drug discovery, and the development of scalable quantum computing technologies, thereby positioning the integration of ML and quantum physics as a promising approach for future scientific breakthroughs.