Most of the problems of theoretical quantum physics are characterized by a high complexity. Practically, this means that solution of such a problem demands computational effort and resources that often scale exponentially with the size of the quantum model and the solution can be obtained—even for relatively small models—only by resorting to high performance computing (HPC) technologies. Here we discuss a particular problem of the theory of open quantum systems, the so-called ‘‘Markovianity problem’’. To get the answer to the question whether a given quantum map can be obtained as the result of a time-continuous open quantum evolution, one needs to implement an algorithm whose complexity grows exponentially with the dimension of the model’s Hilbert space. We discuss how machine learning (ML) methods can be used to get the answer and provide some evidence for potential efficiency of the ML-based approach. We demonstrate that neural networks that are used to classify images can be used to determine the boundary between answers ‘‘yes’’ and ‘‘no’’ in the parameter space of a particular open quantum model. For an open model consisting of two qubits, our ML algorithm is able to give correct answer with $$97\%$$ accuracy. The computational experiments were performed on the Lomonosov-2 supercomputer.
Most of the problems of theoretical quantum physics are characterized by a high complexity. Practically, this means that solution of such a problem demands computational effort and resources that often scale exponentially with the size of the quantum model and the solution can be obtained—even for relatively small models—only by resorting to high performance computing (HPC) technologies. Here we discuss a particular problem of the theory of open quantum systems, the so-called ‘‘Markovianity problem’’. To get the answer to the question whether a given quantum map can be obtained as the result of a time-continuous open quantum evolution, one needs to implement an algorithm whose complexity grows exponentially with the dimension of the model’s Hilbert space. We discuss how machine learning (ML) methods can be used to get the answer and provide some evidence for potential efficiency of the ML-based approach. We demonstrate that neural networks that are used to classify images can be used to determine the boundary between answers ‘‘yes’’ and ‘‘no’’ in the parameter space of a particular open quantum model. For an open model consisting of two qubits, our ML algorithm is able to give correct answer with 97% accuracy. The computational experiments were performed on the Lomonosov-2 supercomputer.
Abstract Despite the complexity of quantum systems in the real world, models with just a few effective many-body states often suffice to describe their quantum dynamics, provided decoherence is accounted for. We show that a machine learning algorithm is able to construct such models, given a straightforward set of quantum dynamics measurements. The effective Hilbert space can be a black box, with variations of the coupling to just one accessible output state being sufficient to generate the required training data. We demonstrate through simulations of a Markovian open quantum system that a neural network can automatically detect the number N of effective states and the most relevant Hamiltonian terms and state-dephasing processes and rates. For systems with N ⩽ 5 we find typical mean relative errors of predictions in the 10 % range. With more advanced networks and larger training sets, it is conceivable that a future single software can provide the automated first stop solution to model building for an unknown device or system, complementing and validating the conventional approach based on physical insight into the system.
Machine learning (ML) is often listed among the most potential applications for quantum computing. This is in reality a puzzling choice: Nowadays machine learning algorithms are extremely powerful in practice, but still theoretically challenging to understand. Quantum computing, in contrast, does not give actual benchmarks on practical scales. However, theory remains the main tool we have to determine if it may become important for a task. Although it is far from reaching its full potential, nevertheless, it presents several techniques to efficiently deal with the problem which are tough to solve traditionally. In this perspective we deploy the Quanvolutional Neural Networks (QNNs) on a quantum computer to recognize handwritten digits, and compare its performance with that of its classical counterpart namely the Convolutional Neural Networks (CNNs). We used a quanvolutional layer to separate the pixel data and demonstrate the advantage of applying QNN on a quantum computer. Finally, we implement the Variational Quantum Classifier (VQC) and several classical classifiers built on the Iris dataset, in order to compare their accuracies. We employed amplitude encoding to map data into the large Hilbert space of a quantum computer. The results revealed that the QNN model and VQC had high accuracy and low loss value compared to their purely classical counterparts.
The intersection of machine learning and quantum computing has been one of the greatest scientific projects in current time. With quantum computing in the offing, the assurance of using quantum mechanical effects in computational learning to transform the world has never been closer. The publication of this book comes at a critical time, when theoretical models are shouldering maturity with capabilities of experimentation, that has brought about great possibilities to implement computational benefits that quantum systems can provide in performing machine learning tasks. Quantum machine learning is one field which has rapidly changed in the last ten years. What was originally viewed as mere theoretical conjecture has now evolved into a living research community which includes rigorous mathematical modeling, novel algorithm design, and more and more complex experimental realisations on the near-term quantum computers. Such change can be characterised by the increasing sophistication of our theory in as well as the revolutionary advances in quantum computing technology, and by the noisy intermediate-scale quantum (NISQ) era. Chapters in this book chronologically discuss the complex nature of quantum machine learning, including theoretical principles and challenges of practice. All the chapters cover a very important aspect in this growing area leaving the reader not only with an in-depth analysis but also a wide enough point of view to traverse this somewhat complicated inter-disciplinary area. The book is organized in such a way that that it takes the reader through more advanced parts of the quantum machine learning theory and practice. We start by explaining quantum feature maps, and kernel-type methods and laying the mathematical background on which quantum-enhanced learning is based. There we discuss computational complexity, trainability issues, neural network architectures, scaling of resources, sample complexity limits and the issue critical of quantum data encoding. This book has a variety of audience. The works will also offer exhaustive proposals of key concepts, methodologies and open problems to graduate students and researchers venturing into the field. Individuals who operate quantum computing platforms will have an understanding of the options available when it comes to designing an algorithm and the resources needed, as well as the expectations of its performance. The systematic approach of tackling complexity theorist-foundations and rigorous mathematical analyses will be appreciated by the theorists. Quantum machine learning is interdisciplinary and requires the services and knowledge of quantum physics, computer science, mathematics, and statistics. Although we do not expect our readers to have the basic knowledge of quantum computing and classical machine learning, we give adequate background and references to accommodate other readers of varying technical background. By 2026, quantum machine learning will be on a important crossroads. NISQ has also provided its own stunning demonstrations and harsh lessons on the difficulty of obtaining useful quantum advantage. Other phenomena like barren plateaus have changed the minds of us on the nature of variational quantum algorithm trainability. Resource-efficient quantum learning has been transformed by the advanced measurement protocols, such as classical shadow tomography. The frontier of the implementable quantum algorithms is constantly being pushed by hardware advances. The book reflects the picture of the field in this dynamic time, including the latest theoretical developments, their experiments, and new optimal practices. We admit that quantum machine learning is a fast-developing science, and there are certain spheres of our knowledge that will surely become more profound in the nearest future. The transformative potential of quantum machine learning is still achievable only with further achievements in many dimensions: the theory of when and why quantum algorithms are effective, algorithmic innovations to overcome the limitations of near-term hardware, hardware engineering to overcome qubit quality and system scale, and discovering applications when quantum algorithms and methods and methods offer significant superior practical performance. Hopefully, this book will provide useful guidance to all the existing knowledge and guide to the future innovations. The opportunities are out of the world, yet the challenges are significant. With the ongoing development of quantum hardware capabilities and an ever-increasing theoretical basis, it is quite possible that quantum machine learning will transform the world of approaching the problem of complex computational learning.
The convergence of machine learning (ML) and quantum computing is quickly becoming a game-changing new frontier in computational science. The most intriguing area of overlap may be quantum optimization, which seeks to reduce the exponentially increasing complexity and computational cost of ML algorithms. As they grow larger and more complicated, traditional optimization methods, particularly in high-dimensional and non-convex space, will inevitably hit performance limits. Quantum optimization is the whole new paradigm that leverages quantum mechanical effects like superposition, entanglement, and tunnelling to explore solution spaces more efficiently. The chapter outlines the theory, practice, and potential of hybrid quantum-classical optimization algorithms for machine learning. The most brilliant research direction in the current NISQ (noisy intermediate-scale quantum) era is mixed systems leveraging classical computing capability augmented by quantum capacity. In such designs, computationally intensive subroutines like optimization for global optima or escape from local minima are left to quantum processors and data preprocessing, iterative refinement, and model testing are performed by classical processors. We start by defining the fundamental principles of quantum computing and acquainting readers with the fundamentals like qubits, quantum gates, and quantum circuits. These are the building blocks for quantum algorithms, which hopefully can be utilized for optimization, for example, the QAOA (quantum approximate optimization algorithm), the VQE (variational quantum Eigensolver), and quantum annealing. They all build to optimize the problems in some way differently: QAOA through parameterized quantum circuits, VQE through approximations of ground states of the Hamiltonians, and quantum annealing through quantum evolution to low-energy solutions. We then form a loop between these quantum algorithms and regular machine learning tasks. Optimization impacts virtually all ML phases, from training neural networks, where one reduces loss functions; feature selection, where one aims to discover the most relevant subset of input variables; and hyperparameter optimization, which often involves expensive search procedures over extremely large combinatorial spaces. Quantum optimization techniques can therefore, in principle, accelerate such procedures through computational complexity reduction and enhancing solutions over challenging landscapes. Realistic simulations and case studies emphasize the degree to which hybrid quantum-classical algorithms have been employed in solving ML problems, that is, QSVMs, quantum-enhanced clustering, and quantum reinforcement learning. Despite their experimental nature, these applications already show encouraging results in terms of improved performance metrics as well as reduction in time-to-solution compared to classical-only solutions. Notwithstanding that, this new field is not bereft of real challenges. Quantum hardware suffers from hard limits on qubit fidelity, decoherence, and scalability in the current times. Furthermore, quantum circuit integration into broad ML pipelines requires novel architectures and software platforms. As a counter to those issues, this chapter surveys recent advances in quantum programming languages, simulators, and hybrid platforms like PennyLane, Qiskit, and TensorFlow Quantum. We conclude by looking to the future possibility that quantum optimization will revolutionize the machine learning landscape. As hardware improves and algorithmic complexity increases, the possibility of quantum-powered learning systems solving hard problems becomes increasingly accessible. From speeding up deep network training to enabling new types of unsupervised learning, quantum optimization holds the potential to recast computational tractability in machine learning. This chapter is an all-encompassing introduction and state-of-the-art work for students, researchers, and practitioners interested in using quantum optimization for practical ML applications. It sets the foundation for understanding how to pursue hybrid approaches (how they may be applied today in the real world and bracing oneself for disruption in the future).
Due to the similarity of the computational and probabilistic nature of quantum computing and machine learning, the idea arose to optimize the learning process using quantum methods. There are both fundamentally new algorithms, such as HHL, and quantum-improved ones: QPCA, QSVM. In this article, we will look at the QSVM algorithm step by step, starting from the basics described in section 2 and gradually delving into the composition of the algorithm. Thus, after the basics, we will consider the quantum phase estimation, which is part of the HHL algorithm, and then the QSVM algorithm, the component of which is the HHL. We also will consider the QPCA algorithm, which can be applied before the QSVM algorithm to reduce the dimension of the data sample. In this way, we explore the fundamental difference between classical algorithms and their quantum counterparts. We also implement the QSVM method in practice and compare the obtained practical results with theory. As a result, we obtained high quality of accuracy (100 %) compared to the classical SVM (83 %) on a data sample of dimension 72. However, we found out that the learning time on a quantum device is far from ideal (it can reach 5 min for a sample of this size). The study aims to theoretically argue or disprove the hypothesis about the efficiency of quantum computing for machine learning algorithms. The object of research is the programming of quantum computers. The research subject is the study of quantum computing mechanisms for the implementation of machine learning problems. The research result is a software module that allows evaluating the efficiency of the classification task on a quantum computer. It also can be used to compare the results obtained from classical and quantum devices. Research methods: theoretical analysis of the foundations of quantum computing: principles of superposition and entanglement, linear algebra, probability theory over complex numbers; building a model of one qubit and multi-qubit system; research of quantum machine learning algorithms’ work principles and their complexity; empirical comparison of quantum machine learning methods with their classical counterparts.
Similar to its classical version, quantum Markovian evolution can be either time-discrete or time-continuous. Discrete quantum Markovian evolution is usually modeled with completely positive trace-preserving maps, while time-continuous evolution is often specified with superoperators referred to as "Lindbladians." Here, we address the following question: Being given a quantum map, can we find a Lindbladian that generates an evolution identical-when monitored at discrete instances of time-to the one induced by the map? It was demonstrated that the problem of getting the answer to this question can be reduced to an NP-complete (in the dimension N of the Hilbert space, the evolution takes place in) problem. We approach this question from a different perspective by considering a variety of machine learning (ML) methods and trying to estimate their potential ability to give the correct answer. Complimentarily, we use the performance of different ML methods as a tool to validate a hypothesis that the answer to the question is encoded in spectral properties of the so-called Choi matrix, which can be constructed from the given quantum map. As a test bed, we use two single-qubit models for which the answer can be obtained using the reduction procedure. The outcome of our experiment is that, for a given map, the property of being generated by a time-independent Lindbladian is encoded both in the eigenvalues and the eigenstates of the corresponding Choi matrix.