This thesis illustrates the use of machine learning algorithms and exact numerical methods to study quantum observables for different systems. The first part of this thesis depicts how to construct accurate potential energy surfaces (PESs) using supervised learning algorithms such as Gaussian Process (GP) regression. PESs have a leading part in quantum chemistry since they are used to study chemical reaction dynamics. Constructing the PES from quantum reactive scattering calculations, as the reaction probability, is known as the inverse scattering problem. Here, we illustrate a possible solution to the inverse scattering problem with a two-tiered GP model one GP model interpolates the PES and the second in Bayesian optimization (BO) algorithm. The end result is an accurate PES constructed with a GP with fewer points than with standard methods previously used for PES. BO is an optimization algorithm for black-box functions that use GP regression as an approximation of the interrogative function. We applied BO to find the optimal parameters of hybrid-density functionals. Quantum observables can differ between phases of matter. GP models with kernel combinations can extrapolate quantum observables such as the polaron dispersion energy between different phases and discover phases of matter. The same algorithm can predict quantum observables where standard numerical techniques lack convergence. In the second half of the dissertation, we studied the evolution of quantum walks in various graphs with Hamiltonians permitting particle number changes. We showed that particle number-changing interactions accelerate quantum walks for any of the graph considered. Quantum simulators to study many-body physics is an active research field. We proposed the use of magnetic atoms trapped in optical lattices to experimentally mimic Bose-Hubbard type models by preparing atoms in different Zeeman states.
This thesis illustrates the use of machine learning algorithms and exact numerical methods to study quantum observables for different systems. The first part of this thesis depicts how to construct accurate potential energy surfaces (PESs) using supervised learning algorithms such as Gaussian Process (GP) regression. PESs have a leading part in quantum chemistry since they are used to study chemical reaction dynamics. Constructing the PES from quantum reactive scattering calculations, as the reaction probability, is known as the inverse scattering problem. Here, we illustrate a possible solution to the inverse scattering problem with a two-tiered GP model one GP model interpolates the PES and the second in Bayesian optimization (BO) algorithm. The end result is an accurate PES constructed with a GP with fewer points than with standard methods previously used for PES. BO is an optimization algorithm for black-box functions that use GP regression as an approximation of the interrogative function. We applied BO to find the optimal parameters of hybrid-density functionals. Quantum observables can differ between phases of matter. GP models with kernel combinations can extrapolate quantum observables such as the polaron dispersion energy between different phases and discover phases of matter. The same algorithm can predict quantum observables where standard numerical techniques lack convergence. In the second half of the dissertation, we studied the evolution of quantum walks in various graphs with Hamiltonians permitting particle number changes. We showed that particle number-changing interactions accelerate quantum walks for any of the graph considered. Quantum simulators to study many-body physics is an active research field. We proposed the use of magnetic atoms trapped in optical lattices to experimentally mimic Bose-Hubbard type models by preparing atoms in different Zeeman states.
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.
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.
The potential energy surface (PES) is crucial for interpreting a variety of chemical reaction processes. However, predicting accurate PESs with high-level electronic structure methods is a challenging task due to the high computational cost. As an appealing application of quantum computing, we show in this work that variational quantum algorithms can be integrated with machine learning (ML) techniques as a promising scheme for exploring accurate PESs. Different from using a ML model to represent the potential energy, we encode the molecular geometry information into a deep neural network (DNN) to represent parameters of the variational quantum eigensolver (VQE), leaving the PES to the wave function ansatz. Once the DNN model is trained, the variational optimization procedure that hinders the application of the VQE to complex systems is avoided, and thus the evaluation of PESs is significantly accelerated. Numerical results demonstrate that a simple DNN model is able to reproduce accurate PESs for small molecules.
The potential energy surface (PES) is crucial for interpreting a variety of chemical reaction processes. However, predicting accurate PESs with high-level electronic structure methods is a challenging task due to the high computational cost. As an appealing application of quantum computing, we show in this work that variational quantum algorithms can be integrated with machine learning (ML) techniques as a promising scheme for exploring accurate PESs. Different from using a ML model to represent the potential energy, we encode the molecular geometry information into a deep neural network (DNN) for representing parameters of the variational quantum eigensolver (VQE), leaving the PES to the wave function ansatz. Once the DNN model is trained, the variational optimization procedure that hinders the application of the VQE to complex systems is avoided and thus the evaluation of PESs is significantly accelerated. Numerical results demonstrate that a simple DNN model is able to reproduce accurate PESs for small molecules.
For applications in chemistry and physics, machine learning (ML) is generally used to solve one of three problems: interpolation, classification or clustering. These problems use information about physical systems in a certain range of parameters or variables in order to make predictions at unknown values of these variables within the same range. The present work illustrates the application of ML to prediction of physical properties outside the range of the training parameters. We define `physical extrapolation' to refer to accurate predictions y(x∗) of a given physical property at a point x∗=[x1∗,...,xD∗] in the D-dimensional space, if, at least, one of the variables xi∗∈[x1∗,...,xD∗] is {\it outside} of the range covering the training data. We show that Gaussian processes (GPs) can be used to build ML models capable of physical extrapolation of quantum properties of complex systems across quantum phase transitions. The approach is based on training GP models of variable complexity by the evolution of the physical functions. We show that, as the complexity of the models increases, they become capable of predicting new transitions. We also show that, where the evolution of the physical functions is analytic and relatively simple, GP models with simple kernels already yield accurate generalization results, allowing for accurate predictions of quantum properties in a different quantum phase. For more complex problems, it is necessary to build models with complex kernels. The complexity of the kernels is increased using the Bayesian Information Criterion (BIC). We illustrate the importance of the BIC by comparing the results with random kernels of various complexity and illustrate a method to obtain meaningful extrapolation results without direct validation in the extrapolated region.
This thesis focuses on the development, application, and high-performance implementation of numerical methods for simulating quantum many-body systems. In the first chapter, I provide an overview of several most successful conventional approaches for simulating quantum many-body systems, along with their current limitations. Then, the basic properties of the quantum spin model, which will be the subject of study in the following chapters, and its ground state are briefly summarized. Additionally, I discuss the background and the motivations of the research projects carried out during my PhD research. Chapter 2 introduces two numerical algorithms that are extensively used in this thesis, which are exact diagonalization (ED) and variational Monte Carlo. I outline the process of constructing a Hamiltonian matrix and employing iterative methods for exact diagonalization. Subsequently, I introduce the mechanism of the four important components in the ``standard" variational Monte Carlo that are widely used in the most recent research. In Chapter 3, we propose a symmetry-projected variational ansatz in the form of linear combinations of simple restricted Boltzmann machines. This construction allows one to explore states outside of the original variational manifold and increase the representation power with moderate computational effort. Besides allowing one to restore spatial symmetries, an expansion in terms of Krylov states using a Lanczos recursion offers a solution that can further improve the quantum state accuracy. We illustrate these ideas with an application to the Heisenberg J1−J2 model on the square lattice, a paradigmatic problem under debate in condensed matter physics,and achieve state-of-the-art accuracy in the representation of the ground state. In Chapter 4, we present a variational approach based on a Chebyshev expansion of the spectral function, and each Chebyshev polynomial is represented by a neural network quantum state. The Chebyshev moments are obtained by recursively applying the Hamiltonian and projecting on the space of variational states using a modified natural gradient descent method. We compare this approach with a modified approximation of the spectral function which uses a Krylov subspace constructed from the "Chebyshev wave functions." We present results for the one-dimensional and two-dimensional Heisenberg models on the square lattice and compare them with those obtained by other methods in the literature. In Chapter 5, we describe a method to carry out thermodynamic simulations of quantum many-body models using typicality and variational representations of quantum states. Minimally entangled typical thermal states (METTS) are a construction that allows one to solve for the imaginary time evolution of quantum many-body systems. By using wave functions that are weakly entangled, one can take advantage of efficient representations in the form of matrixproduct states. We generalize these ideas to arbitrary variational wave functions and we focus, as an illustration, on the particular case of restricted Boltzmann machines. We demonstrate the application of the method to quantum spin systems in one and two spatial dimensions. In Chapter 6, we study the properties of the impurity band in heavily doped nonmagnetic semiconductors using the Jacobi-Davidson algorithm and the supervised deep learning method. The disorder averaged inverse participation ratio and Thouless number calculation show us the rich structure inside the impurity band. A convolutional neural network model, which is trained to distinguish the extended/localized phase of the Anderson model with high accuracy, shows us the results in good agreement with the conventional approach. Together, we find that there are three mobility edges in the impurity band for a specific on-site impurity potential, which means the presence of the extended states while filling the impurity band. In the final chapter, Chapter 7, we discuss the implementation of architecture-aware optimizations for spin dynamics simulations on x86 CPUs and Nvidia GPUs. The time cost of evaluating the spin-spin correlation functions in real space increases quadratically as the number of spins N, leading to significant computational effort, making the simulation of large spin systems very challenging. We propose to use a highly optimized general matrix multiply (GEMM) subroutine to calculate the dynamical spin-spin correlation function that can achieve near-optimal hardware utilization. Furthermore, we fuse the element-wise operations in the calculation of S(q,t) into the in-house GEMM kernel to reduce memory latency. On Nvidia GPU, we perform the on-the-fly calculation in the epilogue of the GEMM subroutine to avoid saving intermediate results on global memory, which significantly reduces memory usage and achieves better performance than cuBLAS.--Author's abstract