Preparation of a target quantum many-body state on quantum simulators is one of the significant steps in quantum science and technology. With a small number of qubits, a few quantum states, such as the Greenberger-Horne-Zeilinger state, have been prepared, but fundamental difficulties in systems with many qubits remain, including the Lieb-Robinson bounds for the number of quantum operations. Here, we provide one algorithm with an implementation of a deep learning process and achieve to prepare the target ground states with many qubits. Our strategy is to train a machine-learning model and predict parameters with many qubits by utilizing a pattern of quantum states from the corresponding quantum states with small numbers of qubits. For example, we demonstrate that our algorithm with the Quantum Approximate Optimization Ansatz can effectively generate the ground state for a 1D XY model with 64 spins. We also demonstrate that the reduced density operator of two qubits can be utilized to capture the pattern of quantum many-body states such as correlation lengths even for quantum critical states.
Preparation of a target quantum many-body state on quantum simulators is one of the significant steps in quantum science and technology. With a small number of qubits, a few quantum states, such as the Greenberger-Horne-Zeilinger state, have been prepared, but fundamental difficulties in systems with many qubits remain, including the Lieb-Robinson bounds for the number of quantum operations. Here, we provide one algorithm with an implementation of a deep learning process and achieve to prepare the target ground states with many qubits. Our strategy is to train a machine-learning model and predict parameters with many qubits by utilizing a pattern of quantum states from the corresponding quantum states with small numbers of qubits. For example, we demonstrate that our algorithm with the Quantum Approximate Optimization Ansatz can effectively generate the ground state for a 1D XY model with 64 spins. We also demonstrate that the reduced density operator of two qubits can be utilized to capture the pattern of quantum many-body states such as correlation lengths even for quantum critical states.
Solving the ground state and the ground-state properties of quantum many-body systems is generically a hard task for classical algorithms. For a family of Hamiltonians defined on an m -dimensional space of physical parameters, the ground state and its properties at an arbitrary parameter configuration can be predicted via a machine learning protocol up to a prescribed prediction error ɛ , provided that a sample set (of size N ) of the states can be efficiently prepared and measured. In a recent work [Huang , ], a rigorous guarantee for such a generalization was proved. Unfortunately, an exponential scaling for the provable sample complexity, N = m O ( 1 ɛ ) , was found to be universal for generic gapped Hamiltonians. This result applies to the situation where the dimension of the parameter space is large, while the scaling with the accuracy is not an urgent factor, not entering the realm of more precise learning and prediction. In this work, we consider an alternative relevant scenario, where the effective dimension m is a finite, not necessarily large constant, while the scaling with the prediction error becomes the central concern. By jointly preserving the fundamental properties of density matrices in the learning protocol and utilizing the continuity of quantum states in the parameter range of interest, we rigorously obtain a polynomial sample complexity for predicting quantum many-body states and their properties, with respect to the prediction error ɛ and the number of qubits, n , with N = poly ( ɛ − 1 , n , ln 1 δ ) , where poly denotes a polynomial function, and ( 1 − δ ) is the probability of success. Moreover, if restricted to learning local quantum-state properties, the number of samples can be further reduced to N = poly ( ɛ − 1 , ln n δ ) . Numerical demonstrations confirm our findings, and an alternative approach utilizing statistical learning theory with reproducing kernel Hilbert space achieves consistent results. The mere continuity assumption indicates that our results are not restricted to gapped Hamiltonian systems and properties within the same phase. Published by the American Physical Society 2024
Recent theoretical progress has established conditions under which machine learning models can efficiently predict ground-state properties of gapped local Hamiltonians when trained on quantum-generated data. Previous experimental demonstrations in this paradigm, however, have largely been limited to small systems or highly structured states, due to the difficulty of preparing many-body ground states on quantum processors. In this work, we demonstrate learning from experimental quantum data generated from approximate ground states of the two-dimensional Heisenberg XXZ model with system sizes up to 115 qubits. We construct a dataset of single-site expectation values, two-point correlations, and 12-body loop correlations across the antiferromagnetic phase. We then train neural networks on this data and show that they can accurately predict spatially resolved observables for previously unseen Hamiltonian parameters, both within the training distribution and in an out-of-distribution regime approaching the phase boundary. Our results demonstrate the practical realization of learning from quantum data for an interacting two-dimensional many-body system at scale, motivating a path toward regimes where quantum processors could provide training data beyond the reach of classical approximation methods.
Abstract Classical deep learning algorithms have aroused great interest in both academia and industry for their utility in image recognition, language translation, decision-making problems and more. In this work, we have provided a quantum deep learning scheme based on multi-qubit entanglement states, including computation and training of neural network in full quantum process. In the course of training, efficient calculation of the distance between unknown unit vector and known unit vector has been realized by proper measurement based on the Greenberger–Horne–Zeilinger entanglement states. An exponential speedup over classical algorithms has been demonstrated. In the process of computation, quantum scheme corresponding to multi-layer feedforward neural network has been provided. We have shown the utility of our scheme using Iris dataset. The extensibility of the present scheme to different types of model has also been analyzed.
In the past decades, methods to solve the ground state given a quantum many-body Hamiltonian have been well established. In this work, we consider an inverse problem and demonstrate that convolutional neural network (CNN) can predict the physical parameters of interacting Hamiltonians, such as coupling strengths and magnetic fields, providing the quantum many-body wave-functions as the ground states. We propose QubismNet that consists of two main parts: the Qubism map that visualizes the ground states (or the purified reduced density matrices) as images, and a CNN that maps the images to the target physical parameters. QubismNet exhibits impressive powers of learning and generalization on several quantum spin models. While the training samples are restricted to the states from certain ranges of the parameters, QubismNet can accurately predict the parameters of the states beyond such training regions. For instance, our results show that QubismNet can predict the magnetic fields near the critical point by learning from the states away from the critical vicinity. Our work provides a data-driven way to infer the Hamiltonians that give the designed ground states, and therefore would benefit the existing and future generations of quantum technologies such as Hamiltonian-based quantum simulations.
A fundamental problem in quantum many-body physics is that of finding ground states of local Hamiltonians. A number of recent works gave provably efficient machine learning (ML) algorithms for learning ground states. Specifically, [Huang et al. Science 2022], introduced an approach for learning properties of the ground state of an n-qubit gapped local Hamiltonian H from only nO(1) data points sampled from Hamiltonians in the same phase of matter. This was subsequently improved by [Lewis et al. Nature Communications 2024], to O(logn) samples when the geometry of the n-qubit system is known. In this work, we introduce two approaches that achieve a constant sample complexity, independent of system size n, for learning ground state properties. Our first algorithm consists of a simple modification of the ML model used by Lewis et al. and applies to a property of interest known beforehand. Our second algorithm, which applies even if a description of the property is not known, is a deep neural network model. While empirical results showing the performance of neural networks have been demonstrated, to our knowledge, this is the first rigorous sample complexity bound on a neural network model for predicting ground state properties. We also perform numerical experiments that confirm the improved scaling of our approach compared to earlier results.
Finding the ground state of a quantum many-body system is a fundamental problem in quantum physics. In this work, we give a classical machine learning (ML) algorithm for predicting ground state properties with an inductive bias encoding geometric locality. The proposed ML model can efficiently predict ground state properties of an n-qubit gapped local Hamiltonian after learning from only [Formula: see text] data about other Hamiltonians in the same quantum phase of matter. This improves substantially upon previous results that require [Formula: see text] data for a large constant c. Furthermore, the training and prediction time of the proposed ML model scale as [Formula: see text] in the number of qubits n. Numerical experiments on physical systems with up to 45 qubits confirm the favorable scaling in predicting ground state properties using a small training dataset.