Quantum computing has the potential to revolutionize numerous aspects of science and engineering, and extensive research in the past decades has been undertaken to exhibit quantum advantage over classical computers. Nevertheless, building robust quantum computers involves enormous technological challenges, and therefore many attempts are devoted to closing the gaps by developing classical simulation algorithms for problems in many body physics. Among these, the most notable are machine learning algorithms. This paper contributes to the development of these toolkits by studying the power of deep generative neural networks, including variational autoencoders and normalizing flows, to represent the distributions generated by quantum computing. The results show that these modern generative networks are only capable of partially capturing features of the quantum system including the overall distribution shapes, but missing the granularities such as local spikes and annihilations in the distributions This incomplete information reconstruction might be due to the inherent limitation of the classical algorithms when encountering the complex quantum states with the exponential growing Hilbert space. The results also show that variational autoencoders perform slightly better than normalizing flows for many cases, and the complimentary strength between the expressibility of variational autoencoders and normalizing flows is observed and worth further exploration.
Quantum computing has the potential to revolutionize numerous aspects of science and engineering, and extensive research in the past decades has been undertaken to exhibit quantum advantage over classical computers. Nevertheless, building robust quantum computers involves enormous technological challenges, and therefore many attempts are devoted to closing the gaps by developing classical simulation algorithms for problems in many body physics. Among these, the most notable are machine learning algorithms. This paper contributes to the development of these toolkits by studying the power of deep generative neural networks, including variational autoencoders and normalizing flows, to represent the distributions generated by quantum computing. The results show that these modern generative networks are only capable of partially capturing features of the quantum system including the overall distribution shapes, but missing the granularities such as local spikes and annihilations in the distributions This incomplete information reconstruction might be due to the inherent limitation of the classical algorithms when encountering the complex quantum states with the exponential growing Hilbert space. The results also show that variational autoencoders perform slightly better than normalizing flows for many cases, and the complimentary strength between the expressibility of variational autoencoders and normalizing flows is observed and worth further exploration.
The exact description of many-body quantum systems represents one of the major challenges in modern physics, because it requires an amount of computational resources that scales exponentially with the size of the system. Simulating the evolution of a state, or even storing its description, rapidly becomes intractable for exact classical algorithms. Recently, machine learning techniques, in the form of restricted Boltzmann machines, have been proposed as a way to efficiently represent certain quantum states with applications in state tomography and ground state estimation. Here, we introduce a practically usable deep architecture for representing and sampling from probability distributions of quantum states. Our representation is based on variational auto-encoders, a type of generative model in the form of a neural network. We show that this model is able to learn efficient representations of states that are easy to simulate classically and can compress states that are not classically tractable. Specifically, we consider the learnability of a class of quantum states introduced by Fefferman and Umans. Such states are provably hard to sample for classical computers, but not for quantum ones, under plausible computational complexity assumptions. The good level of compression achieved for hard states suggests these methods can be suitable for characterizing states of the size expected in first generation quantum hardware.
Abstract The exact description of many-body quantum systems represents one of the major challenges in modern physics, because it requires an amount of computational resources that scales exponentially with the size of the system. Simulating the evolution of a state, or even storing its description, rapidly becomes intractable for exact classical algorithms. Recently, machine learning techniques, in the form of restricted Boltzmann machines, have been proposed as a way to efficiently represent certain quantum states with applications in state tomography and ground state estimation. Here, we introduce a practically usable deep architecture for representing and sampling from probability distributions of quantum states. Our representation is based on variational auto-encoders, a type of generative model in the form of a neural network. We show that this model is able to learn efficient representations of states that are easy to simulate classically and can compress states that are not classically tractable. Specifically, we consider the learnability of a class of quantum states introduced by Fefferman and Umans. Such states are provably hard to sample for classical computers, but not for quantum ones, under plausible computational complexity assumptions. The good level of compression achieved for hard states suggests these methods can be suitable for characterizing states of the size expected in first generation quantum hardware.
Studying the dynamics of open quantum systems can enable breakthroughs both in fundamental physics and applications to quantum engineering and quantum computation. Since the density matrix ρ, which is the fundamental description for the dynamics of such systems, is high-dimensional, customized deep generative neural networks have been instrumental in modeling ρ. However, the complex-valued nature and normalization constraints of ρ, as well as its complicated dynamics, prohibit a seamless connection between open quantum systems and the recent advances in deep generative modeling. Here we lift that limitation by utilizing a reformulation of open quantum system dynamics to a partial differential equation (PDE) for a corresponding probability distribution Q, the Husimi Q function. Thus, we model the Q function seamlessly with off-the-shelf deep generative models such as normalizing flows. Additionally, we develop novel methods for learning normalizing flow evolution governed by high-dimensional PDEs based on the Euler method and the application of the time-dependent variational principle. We name the resulting approach Q-Flow and demonstrate the scalability and efficiency of Q-Flow on open quantum system simulations, including the dissipative harmonic oscillator and the dissipative bosonic model. Q-Flow is superior to conventional PDE solvers and state-of-the-art physics-informed neural network solvers, especially in high-dimensional systems.
The simulation of quantum matter with classical hardware plays a central role in the discovery and development of quantum many-body systems, with far-reaching implications in condensed matter physics and quantum technologies. In general, efficient and sophisticated algorithms are required to overcome the severe challenge posed by the exponential scaling of the Hilbert space of quantum systems. In contrast, hardware built with quantum bits of information are inherently capable of efficiently finding solutions of quantum many-body problems. While a universal and scalable quantum computer is still beyond the horizon, recent advances in qubit manufacturing and coherent control of synthetic quantum matter are leading to a new generation of intermediate scale quantum hardware. \n \nThe complexity underlying quantum many-body systems closely resembles the one encountered in many problems in the world of information and technology. In both contexts, the complexity stems from a large number of interacting degrees of freedom. A powerful strategy in the latter scenario is machine learning, a subfield of artificial intelligence where large amounts of data are used to extract relevant features and patterns. In particular, artificial neural networks have been demonstrated to be capable of discovering low-dimensional representations of complex objects from high-dimensional dataset, leading to the profound technological revolution we all witness in our daily life. \n \nIn this Thesis, we envision a new paradigm for scientific discovery in quantum physics. On the one hand, we have the essentially unlimited data generated with the increasing amount of highly controllable quantum hardware. On the other hand, we have a set of powerful algorithms that efficiently capture non-trivial correlations from high-dimensional data. Therefore, we fully embrace this data-driven approach to quantum mechanics, and anticipate new exciting possibilities in the field of quantum many-body physics and quantum information science. We revive a powerful stochastic neural network called a restricted Boltzmann machine, which slowly moved out of fashion after playing a central role in the machine learning revolution of the early 2010s. We introduce a neural-network representation of quantum states based on this generative model. We propose a set of algorithms to reconstruct unknown quantum states from measurement data and numerically demonstrate their potential, with important implications for current experiments. These include the reconstruction of experimentally inaccessible properties, such as entanglement, and diagnostics to determine sources of noise. Furthermore, we introduce a machine learning framework for quantum error correction, where a neural network learns the best decoding strategy directly from data. We expect that the full integration between quantum hardware and artificial intelligence will become the gold standard, and will drive the world into the era of fault-tolerant quantum computing and large-scale quantum simulations.
An important task in quantum generative machine learning is to model the probability distribution of measurements of many-body quantum systems. Classical generative models, such as generative adversarial networks (GANs) and variational autoencoders (VAEs), can model the distributions of product states with high fidelity, but fail or require an exponential number of parameters to model entangled states. In this paper, we introduce a quantum-enhanced VAE (QeVAE), a generative quantum-classical hybrid model that uses quantum correlations to improve the fidelity over classical VAEs, while requiring only a linear number of parameters. We provide a closed-form expression for the output distributions of the QeVAE. We also empirically show that the QeVAE outperforms classical models on several classes of quantum states, such as 4-qubit and 8-qubit quantum circuit states, haar random states, and quantum kicked rotor states, with a more than 2x increase in fidelity for some states. Finally, we find that the trained model outperforms the classical model when executed on the IBMq Manila quantum computer. Our work paves the way for new applications of quantum generative learning algorithms and characterizing measurement distributions of high-dimensional quantum states.
Quantum computers are next-generation devices that hold promise to perform calculations beyond the reach of classical computers. A leading method towards achieving this goal is through quantum machine learning, especially quantum generative learning. Due to the intrinsic probabilistic nature of quantum mechanics, it is reasonable to postulate that quantum generative learning models (QGLMs) may surpass their classical counterparts. As such, QGLMs are receiving growing attention from the quantum physics and computer science communities, where various QGLMs that can be efficiently implemented on near-term quantum machines with potential computational advantages are proposed. In this paper, we review the current progress of QGLMs from the perspective of machine learning. Particularly, we interpret these QGLMs, covering quantum circuit Born machines, quantum generative adversarial networks, quantum Boltzmann machines, and quantum variational autoencoders, as the quantum extension of classical generative learning models. In this context, we explore their intrinsic relations and their fundamental differences. We further summarize the potential applications of QGLMs in both conventional machine learning tasks and quantum physics. Last, we discuss the challenges and further research directions for QGLMs.