We present a new machine learning technique which calculates a real-valued, time independent, finite dimensional Hamiltonian matrix from only experimental data. A novel cost function is given along with a proof that the cost function has the theoretically correct Hamiltonian as a global minimum. We present results based on data simulated on a classical computer and results based on simulations of quantum systems on IBM's ibmqx2 quantum computer. We conclude with a discussion on the limitations of this data driven framework, as well as several possible extensions of this work. We also note that algorithm presented in this article not only serves as an example of using domain knowledge to design a machine learning framework, but also as an example of using domain knowledge to improve the speed of such algorithm.
We present a new machine learning technique which calculates a real-valued, time independent, finite dimensional Hamiltonian matrix from only experimental data. A novel cost function is given along with a proof that the cost function has the theoretically correct Hamiltonian as a global minimum. We present results based on data simulated on a classical computer and results based on simulations of quantum systems on IBM's ibmqx2 quantum computer. We conclude with a discussion on the limitations of this data driven framework, as well as several possible extensions of this work. We also note that algorithm presented in this article not only serves as an example of using domain knowledge to design a machine learning framework, but also as an example of using domain knowledge to improve the speed of such algorithm.
This paper introduces a novel approach to quantum machine learning termed "Dynamic Matrix-Based Adaptive Quantum Machine Learning" (DMM-AQML). We propose a framework that leverages dynamic matrix computations and updates to emulate complex data and facilitate learning and prediction. The core innovation lies in the integration of quantum mechanics principles, specifically the inherent noise and dynamic nature of quantum systems, into the learning process. This allows for the modeling of intricate patterns and the generation of optimized probability outcomes. The proposed DMM-AQML offers advantages over traditional machine learning algorithms, particularly in handling high-dimensional data and complex non-linear relationships. We present a theoretical framework and preliminary experimental results demonstrating the framework's effectiveness in a simulated scenario. The paper concludes with a discussion of future research directions and potential applications.
Machine learning is widely regarded as a promising application in which quantum computing could offer a computational advantage. However, general quantum machine learning models with provable guarantees on performance, trainability, and efficient inference remain limited. In this work, we introduce quantum Hamiltonian embeddings, a supervised learning framework in which a classical training dataset is encoded into a single effective, parameterized Hamiltonian. Training optimizes the parameters of this data-dependent Hamiltonian, whose approximate ground state defines the classification rule. Once the ground state has been approximated using a quantum algorithm, inference can be performed either classically using a classical representation of the learned state, or with a quantum representation of the state. We establish efficient methods for gradient estimation and prove favorable generalization guarantees. Furthermore, under standard cryptographic assumptions, we show that Hamiltonian embeddings can realize hypothesis functions beyond the reach of efficient classical algorithms. We then demonstrate the framework at scale on IBM Heron processors using a standard benchmark dataset. Together, these results establish Hamiltonian embeddings as a new framework for quantum machine learning, combining theoretical guarantees with a path for experimental investigations at scale on quantum hardware.
Machine Learning (ML) models are trained using historical data to classify new, unseen data. However, traditional computing resources often struggle to handle the immense amount of data, commonly known as Big Data, within a reasonable time frame. Quantum Computing (QC) provides a novel approach to information processing, offering the potential to process classical data exponentially faster than classical computing through quantum algorithms. By mapping Quantum Machine Learning (QML) algorithms into the quantum mechanical domain, we can potentially achieve exponential improvements in data processing speed, reduced resource requirements, and enhanced accuracy and efficiency. In this article, we delve into both the QC and ML fields, exploring the interplay of ideas between them, as well as the current capabilities and limitations of hardware. We investigate the history of quantum computing, examine existing QML algorithms, and present a simplified procedure for setting up simulations of QML algorithms, making it accessible and understandable for readers. Furthermore, we conduct simulations on a dataset using both traditional machine learning and quantum machine learning approaches. We then compare their respective performances by utilizing a quantum simulator.
There is no doubt that quantum computing has opened up new horizons and perspectives in many fields, including scientific research. With the advancement of technology and quantum computers, we can now conduct new kinds of scientific experiments: observing quantum properties of individual systems, atoms, electrons and photons as well as influencing and controlling quantum systems. Quantum mechanics describes the properties of quantum systems by their quantum states. Unlike in classical mechanics, quantum states themselves cannot be directly observed in experiments, so many-body dynamics mathematical simulations are useful. Even though many-body dynamics problems can be solved for limited cases, but when we consider real-world pieces of matter this leads to computation-intensive calculations that are beyond classic digital computers. The memory and time needed to describe the quantum state of a many-body system scales exponentially with the size of the system. This has led physics communities to focus their attention on the algorithms underlying modern machine learning with the goal of making progress in quantum matter research. As a consequence, the successful application of machine learning requires effective and informative data representation. This paper discusses some novel aspects of applying classical machine learning algorithms to quantum data derived from measurements associated with quantum systems in many-body simulation problems. In this paper, we investigate and experimentally demonstrate one of the effective methods of the quantum data representation suited for the classical machine learning applications based on quantum classical shadows.
Quantum machine learning combines quantum computing with machine learning to solve complex computational problems more efficiently than classical approaches. This survey provides an introduction to the foundations, algorithms, frameworks, data and applications of quantum machine learning, serving as a resource for researchers and practitioners. We begin by reviewing existing surveys to identify gaps that this work addresses, followed by a detailed discussion of the foundational principles of quantum mechanics and machine learning essential for quantum machine learning. Key algorithms are examined, highlighting their mechanisms, advantages, and applications across various domains. Current frameworks and platforms for implementing quantum machine learning algorithms are explored, emphasizing their unique features and suitability for different contexts. Existing quantum datasets for practical usage are also reported and commented on. This survey also reviews over 135 articles, categorized into theoretical and practical contributions, to identify key advances, limitations, and application areas within quantum machine learning. Critical challenges such as hardware limitations, error rates, and scalability are analyzed to detect the obstacles that must be addressed for practical deployment. By synthesizing these elements into a structured overview, this survey aims at serving as both an introduction and a guide for advancing research and development in this disruptive field.
One of the key challenges in quantum machine learning is finding relevant machine learning tasks with a provable quantum advantage. A natural candidate for this is learning unknown Hamiltonian dynamics. Here, we tackle the supervised learning version of this problem, where we are given random examples of the inputs to the dynamics as classical data, paired with the expectation values of some observable after the time evolution, as corresponding output labels. The task is to replicate the corresponding input-output function. We prove that this task can yield provable exponential classical-quantum learning advantages under common complexity assumptions in natural settings. To design our quantum learning algorithms, we introduce a new method, which we term \textit{\subroutine}~algorithm for parametrized circuit functions, and which may be of independent interest. Furthermore, we discuss the limitations of generalizing our method to arbitrary quantum dynamics while maintaining provable guarantees. We explain that significant generalizations are impossible under certain complexity-theoretic assumptions, but nonetheless, we provide a heuristic kernel method, where we trade-off provable correctness for broader applicability.