One of the main challenges of quantum many‐body physics is the exponential growth in the dimensionality of the Hilbert space with system size. This growth makes solving the Schrödinger equation of the system extremely difficult. Nonetheless, many physical systems have a simplified internal structure that typically makes the parameters needed to characterize their ground states exponentially smaller. Many numerical methods then become available to capture the physics of the system. Among modern numerical techniques, neural networks, which show great power in approximating functions and extracting features of big data, are now attracting much interest. In this work, the progress in using artificial neural networks to build quantum many‐body states is reviewed. The Boltzmann machine representation is taken as a prototypical example to illustrate various aspects of the neural network states. The classical neural networks are also briefly reviewed, and it is illustrated how to use neural networks to represent quantum states and density operators. Some physical properties of the neural network states are discussed. For applications, the progress in many‐body calculations based on neural network states, the neural network state approach to tomography, and the classical simulation of quantum computing based on Boltzmann machine states are briefly reviewed.

An artificial neural network, consisting of many neurons in different layers, is an important method to simulate the human brain. Usually, one neuron has two operations: one is linear, the other is nonlinear. The linear operation is the inner product and the nonlinear operation is represented by an activation function. In this work, we introduce a kind of quantum neuron whose inputs and outputs are quantum states. The inner product and activation operator of the quantum neurons can be realized by quantum circuits. Based on the quantum neuron, we propose a model of a quantum neural network in which the weights between neurons are all quantum states. We also construct a quantum circuit to realize this quantum neural network model. A learning algorithm is proposed meanwhile. We show the validity of the learning algorithm theoretically and demonstrate the potential of the quantum neural network numerically.

Variational quantum algorithms (VQAs) are widely applied in the noisy intermediate-scale quantum era and are expected to demonstrate quantum advantage. However, training VQAs faces difficulties, one of which is the so-called barren plateaus (BPs) phenomenon, where gradients of cost functions vanish exponentially with the number of qubits. In this paper, inspired by transfer learning, where knowledge of pre-solved tasks could be further used in a different but related work with training efficiency improved, we report a parameter initialization method to mitigate BP. In the method, a small-sized task is solved with a VQA. Then the ansatz and its optimum parameters are transferred to tasks with larger sizes. Numerical simulations show that this method could mitigate BP and improve training efficiency. A brief discussion on how this method can work well is also provided. This work provides a reference for mitigating BP, and therefore, VQAs could be applied to more practical problems.

Machine-learning representations of many-body quantum states have recently been introduced as an ansatz to describe the ground states and unitary evolutions of many-body quantum systems. We investigate one of the most important representations, the restricted Boltzmann machine (RBM), in the stabilizer formalism. A general method to construct RBM representations for stabilizer code states is given, and exact RBM representations for several types of stabilizer groups with the number of hidden neurons equal to or less than the number of visible neurons are presented. The result indicates that the representation is extremely efficient. Then we analyze a surface code with boundaries, defects, domain walls, and twists in full detail and find that almost all the models can be efficiently represented via the RBM ansatz: the RBM parameters of the perfect case, boundary case, and defect case are constructed analytically using the method we provide in the stabilizer formalism, and the domain wall and twist case is studied numerically. In addition, the case for Kitaev's $D\left({\mathbb{Z}}_d\right)$ model, which is a generalized model of the surface code, is also investigated.

The quantum approximate optimization algorithm (QAOA) is a quantum-classical hybrid algorithm intending to find the ground state of a target Hamiltonian. Theoretically, QAOA can obtain the approximate solution if the quantum circuit is deep enough. Actually, the performance of QAOA decreases practically if the quantum circuit is deep since near-term devices are not noise free, and the errors caused by noise accumulate as the quantum circuit increases. In order to reduce the depth of quantum circuits, we propose an ansatz dubbed as “Shortcuts to QAOA” (S-QAOA), S-QAOA provides shortcuts to the ground state of the target Hamiltonian by including more two-body interactions and releasing the parameter freedoms. To be specific, besides the existing $ZZ$ interaction in the QAOA ansatz, other two-body interactions are introduced in the S-QAOA ansatz such that the approximate solutions could be obtained with smaller circuit depth. Considering the Max-Cut problem and the Sherrington-Kirkpatrick model, numerically computation shows the $YY$ interaction has the best performance. The reason for this might arise from the counterdiabatic effect generated by $YY$ interaction. On top of this, we release the freedom of parameters of two-body interactions, which a priori do not necessarily have to be fully identical, and numerical results show that it is worth paying the extra cost of having more parameter freedom since one has a greater improvement on success rate.