Variational Methods for Solving High-Dimensional Quantum Systems

Abstract

Variational methods are highly valuable computational tools for solving high-dimensional quantum systems. In this paper, we explore the effectiveness of three variational methods: density matrix renormalization group (DMRG), Boltzmann machine learning, and variational quantum eigensolver (VQE). We apply these methods to solve two different quantum systems: the Fermi-Hubbard model in condensed matter physics and the Schwinger model in high energy physics. To facilitate the computations on quantum computers, we map each model to a spin 1/2 system using the Jordan-Wigner transformation. This transformation allows us to take advantage of the capabilities of quantum computing. We calculate the ground state of both quantum systems and compare the results obtained using three variational methods. Our aim is to demonstrate the power and effectiveness of these variational approaches in tackling complex quantum systems.

Share and Cite:

Li, D. (2025) Variational Methods for Solving High-Dimensional Quantum Systems. Journal of Modern Physics, 16, 686-714. doi: 10.4236/jmp.2025.165038.

1. Introduction

Many exciting phenomena in quantum many-body systems are due to the interplay of quantum fluctuations and correlations. Celebrated examples are the superfluid Helium [1] [2], the fractional quantum Hall effect [3] [4], the Haldane phase in quantum spin chains [5] [6], quantum spin liquids [7], and high-temperature superconductivity [8]. The aim of theoretical physics is to understand the emergent properties for such challenging quantum many-body systems. The main difficulty in investigating quantum many-body problems is due to the fact that the Hilbert space spanned by the possible microstates grows exponentially with the system size. To unravel the physics of microscopic model systems and to study the robustness of quantum phases of matter, large scale numerical simulations are essential. The exact diagonization method is only possible for small many-body systems. For large systems, efficient quantum Monte Carlo (QMC) methods can be applied. In a large class of quantum many-body systems (e.g., fermionic degrees of freedom, geometric frustration), however, these QMC sampling techniques cannot be used effectively due to the sign problem [9]. In this case, the variational methods have been shown to be a powerful tool to efficiently simulate quantum many-body systems.

The first type of variational method is the density matrix renormalization group (DMRG) method which was originally developed to study ground state properties of one-dimensional systems. The success of the DMRG method is based on the area law of the quantum ground state [10], and thus can be represented efficiently using matrix product states (MPS) [11]-[19]. This algorithm has been generalized to study two-dimensional systems [20], Abelian and non-Abelian symmetries [21]-[25], single-site optimization with density matrix perturbation [26] [27], hybrid real-momentum space representation [28] [29], and the development of real-space parallelization [30], continuous matrix product state (cMPS) [31] [32]. The cMPS can also be used to study the Lieb-Liniger model [33] [34], the Gaudin-Yang model [35], periodic bc atomtronics [36] and 1 + 1 relative Bose theories [37].

The machine learning has been extensively used in physical sciences [38]. The second type of variational method is based on machine learning, where neutral network variational ansatz efficiently represents highly correlated quantum states and their parameters are easily optimized by means of the variational Monte Carlo (VMC) method [39], which has powerful expressibility for quantum state [40]-[43]. Alongside with restricted Boltzmann machine (RBM) [44]-[59], other network structures such as a feed-forward [60]-[63], recurrent neural networks [64] [65], autoregressive neural TensorNet [66], and convolutional neural networks [67]-[78], have been adopted. Recurrent neural networks (RNNs) are tremendously powerful tools that have been used in language modeling [79], speech recognition [80], and image generation [81] [82]. RNNs process data streams by maintaining a hidden state, which is updated by applying an identical function to the previous hidden state and the input at the next time step.

At the same time, neural networks using self-attention layers, like the Transformer [83], have had a profound impact on much of machine learning. They have led to breakthroughs in natural language processing [84], language modeling [85], image recognition [86], and protein folding [87]. However, the application of Transformer in this field is still rather limited, with a few results concerning quantum lattice models [88], open systems [89], quantum state tomography [90] and quantum circuit simulation [91]. Therefore, the full potential of the transformer architecture has yet to be explored.

The third type of variational method is called the variational quantum eigensolver (VQE), which is extensively used in quantum calculation. This is a hybrid algorithm, where the quantum state is prepared by a quantum algorithm, which is implemented according to a quantum circuit with many quantum gates. Classical computer is used to optimize the parameters used in quantum circuit. Compared with the matrix product state and machine learning ansatz, the variational state in VQE is realized by quantum algorithm, which can be implemented in the quantum hardware devices, and thus exponential speedup over classical methods becomes possible. The previous quantum algorithms to find the ground state of a given Hamiltonian were based on adiabatic state preparation and quantum phase estimation subroutines [92] [93], both of which have circuit depth requirements beyond those available in the NISQ era. Here we listed both the original VQE architecture [94] and some more advanced methods: orthogonality constrained VQE [95], subspace expansion method [96], subspace VQE [97] [98], multistate contracted VQE [99], adiabatically assisted VQE [100] [101], and accelerated VQE [102]-[104]. To study the dynamics of many-body quantum systems, the conventional quantum Hamiltonian simulation algorithm such as the Trotter-Suzuki product formula [105] was used. However, the circuit depth of standard Trotterization methods can rapidly exceed the coherence time of noisy quantum computers. This has led to recent proposals for variational approaches to dynamical simulation, including iterative variational algorithms [106] [107], imaginary time evolution [108], general first order derivative equations with non-Hermitian Hamiltonians [109], adaptive ansatz to reduce the circuit depth [110] [111] and variational fast forwarding [112]-[115].

In this paper, these three variational methods are discussed in detail and are used to solve the ground state energy of the Fermi-Hubbard model and Schwinger model. The paper is organized as follows: The details of the three variational methods are given in Sections 2, 3, and 4. In Sections 5 and 6, the Fermi-Hubbard model and Schwinger model have been mapped to spin 1/2 systems using the Jordan-Wigner representation. In Section 7, the ground state energy of the Fermi-Hubbard model and Schwinger model are calculated using these three variational methods. The discussion is given in the final Section 8.

2. Density Matrix Renormalization Group

A general discrete Hilbert space of the many-body quantum systems with N sites has the structure

=span{ | s 0 | s N1 | s i i ,i{ 0,,N1 } } (1)

where i is the set of discrete quantum numbers at site i . { | s i } s i i is the standard orthogonal basis for the local Hilbert space i corresponding to the i th site, i=0,,N1 . The whole Hilbert space is the tensor product of individual local Hilbert space: = i=0 N1 i . The standard orthogonal basis | s 0 s N1 | s 0 | s N1 in is also called the computational basis. For the qubit systems, i ={ 0,1 } . For spin-1/2, i ={ 1,1 } , which is the two eigenvalues of Pauli matrix Z . For general spin- S with integral or half integral S=1/2 ,1,3/2 ,2, , i ={ 2S,2S+2,,2S2,2S } and i has the dimension 2S+1 . Sometimes, the dimension of Hilbert space is reduced under some kind of restriction. For example, the spin 1/2 system with the restriction i=0 N1 Z i =0 , the dimension 16 of is reduced to 6 if N=4 .

The state |ψ can be represented by

|ψ= s ψ( s )|s= s 0 ,, s N1 ψ( s 0 ,, s N1 )| s 0 s N1 (2)

where the sum s over all quantum numbers is assumed. Since the computational basis is standard orthogonal, the wave function ψ( s )=s|ψ is the inner product of |ψ and |s .

The Hamiltonian H of many-body quantum system is a Hermitian operator from d N dimensional Hilbert space into itself. We assume that the dimension d of i are same for i=0,,N1 . The calculation of the spectra of H is difficult due to the exponentially large dimension over N . For small N , exact diagonalization can be adopted since H can be represented as the Hermitian matrix in the computation basis |s .

A general operator O ^ in the basis |s can be written as

O ^ = s, s O s 0 s N1 s 0 s N1 | s 0 s N1 s N1 s 0 | (3)

Since the basis |s is orthogonal to each other,

O ^ | s 0 s N1 = s O s 0 s N1 s 0 s N1 | s 0 s N1 (4)

i.e., O ^ | s = s O s s |s . Apply this operator O ^ to a general state |ψ in (2), one has

O ^ |ψ= s, s O s s ψ( s )|s (5)

The inner product between O ^ |ψ and |ψ is

ψ| O ^ |ψ= s, s O s s ψ( s ) ψ( s ) ¯ (6)

where ψ( s ) ¯ denotes the complex conjugate of ψ( s ) .

The wave function ψ( s 0 ,, s N1 ) can be regarded as the tensor ψ s 0 s N1 of order N , and thus the manipulation of the wave function is reduced to be that of tensor ψ s 0 s N1 . Similarly, O s s = O s 0 s N1 s 0 s N1 is the tensor of order 2N . The computational cost of s O s s ψ( s ) = s 0 ,, s N1 O s 0 s N1 s 0 s N1 ψ s 0 ,, s N1 is O( d 2N ) which is not acceptable. The trick of reducing computational cost is the decomposition of tensor and then truncation. A very important operation for tensor is the decomposition as follows:

ψ s 0 s N1 = M [ 0 ] s 0 M [ 1 ] s 1 M [ N1 ] s N1 (7)

where M [ i ] s i = ( M [ i ] s i ) α i α i+1 is the χ i × χ i+1 matrix for fixed (physical) indices s i , i=0,,N1 , i.e., M [ i ] is a tensor of order 3. The index { α i } i=0 N is contracted in the multiplication of all M [ i ] s i , and α 0 = χ 0 = α N = χ N =1 since the contracted result ψ s 0 s N1 is a complex number. Since the index { α i } i=0 N is not physical, they are called virtual indices.

The decomposition (7) can be realized by N1 steps of singular value decomposition (SVD) of matrices, which is given in detail in Appendix. Inserting (7) into (2), we get the matrix product state

|ψ= s 0 ,, s N1 M [ 0 ] s 0 M [ 1 ] s 1 M [ N1 ] s N1 | s 0 s N1 (8)

If s i =1,,d for i=0,,N1 , then χ 1 =d and χ i+1 d χ i , i=1,,N2 , and thus χ i d i . The exact decomposition of (7) will cause exponential disaster. Fortunately, if the state of interest is not highly entangled, the truncation in SVD will not cause much error for the approximation of this state.

As shown in Appendix, if the tensor ψ s 0 s N1 is normalized

s 0 ,, s N1 | ψ s 0 s N1 | 2 =1 (9)

the N tensors { M [ i ] } i=0 N1 of order 3 satisfy the left canonical condition

s i ( M [ i ] s i ) M [ i ] s i = I χ i+1 ,i=0,,N1 (10)

where I χ i+1 is the χ i+1 × χ i+1 identity matrix. For a general tenor ψ s 0 s N1 of order N , we have the left canonical form

ψ s 0 s N1 = A [ 0 ] s 0 A [ 1 ] s 1 A [ N1 ] s N1 Λ [ N ] (11)

with the left canonical condition for the N tensors { A [ i ] } i=0 N1

s i ( A [ i ] s i ) A [ i ] s i = I χ i+1 ,i=0,,N1 (12)

Here we intentionally introduce a number Λ [ N ] which becomes 1 if ψ s 0 s N1 satisfies (9). In fact, this left canonical form can also be obtained from the general matrix product form (7) where M [ i ] does not satisfy (10). This can be realized by N1 steps of SVD. First,

( M [ 0 ] s 0 ) α 0 , α 1 = k U ( α 0 s 0 ),k S k ( V ) k, α 1 (13)

where U and V are unitary matrices and { S k } are the singular values. Then ( A [ 0 ] s 0 ) α 0 ,k = U ( α 0 s 0 ),k satisfies the left canonical condition. The remaining part S k ( V ) k, α 1 is combined with ( M [ 1 ] s 1 ) α 1 , α 2 to get α 1 S k ( V ) k, α 1 ( M [ 1 ] s 1 ) α 1 , α 2 and use SVD for this matrix again, we can find A [ 1 ] s 1 which satisfies the left canonical condition. Continuing this process, we can get the left canonical form (11).

Similarly, if the SVD is implemented from the right-hand side, the general tensor has the right canonical form

ψ s 0 s N1 = Λ [ 0 ] B [ 0 ] s 0 B [ 1 ] s 1 B [ N1 ] s N1 (14)

with the right canonical condition for the tensor { B [ i ] } i=0 N1 of order 3

s i B [ i ] s i ( B [ i ] s i ) = I χ i ,i=0,,N1 (15)

If the SVD is implemented from both sides, they will meet at some bonds, e.g.,

ψ s 0 s N1 = Λ [ 0 ] A [ 0 ] s 0 A [ 1 ] s 1 Λ [ 2 ] B [ 2 ] s 2 B [ N1 ] s N1 Λ [ N ] (16)

We call this the mixed canonical form. Here Λ [ 2 ] is a χ 2 × χ 2 diagonal matrix.

A full decomposition is

ψ s 0 s N1 = Λ [ 0 ] Γ [ 0 ] s 0 Λ [ N1 ] Γ [ N1 ] s N1 Λ [ N ] (17)

where Γ [ i ] s i is the χ i × χ i+1 matrix and Λ [ i ] is the χ i × χ i diagonal matrix. Obviously, these three canonical forms are related to each other

A [ i ] s i = Λ [ i ] Γ [ i ] s i = Λ [ i ] B [ i ] s i ( Λ [ i+1 ] ) 1 , B [ i ] s i = Γ [ i ] s i Λ [ i+1 ] = ( Λ [ i ] ) 1 A [ i ] s i Λ [ i+1 ] (18)

for i=0,,N1 .

Assume that O s s = O s 0 s N1 s 0 s N1 has the decomposition

O= v L W [ 0 ] W [ N1 ] v R (19)

where W [ i ] = ( W s i s i [ i ] ) α i α i+1 is the tensor of order 4 with 1 s i , s i d , 1 α i χ i and 1 α i+1 χ i+1 , v L and v R are the 1× χ 1 and χ N ×1 matrices, respectively. For example, the Hamiltonian

H= i=0 N2 J X i X i+1 i=0 N1 g Z i (20)

can be written in the form (19) with

v L =( 1,0,0 ), v R = ( 0,0,1 ) T , W [ i ] =( 1 X gZ 0 0 JX 0 0 1 ),i=0,,N1

Here X , Y and Z are the Pauli x , y and z matrices, respectively.

From the decompositions in (7) and (19), one has

O s 0 s N1 s 0 s N1 ψ s 0 ,, s N1 = v α 0 L ( W s 0 s 0 [ 0 ] ) α 0 α 1 ( W s N1 s N1 [ N1 ] ) α N1 α N v α N R ( M [ 0 ] s 0 ) β 0 β 1 ( M [ N1 ] s N1 ) β N1 β N (21)

The inner product O|ψ with |ψ in (6) is a scalar

ψ| O ^ |ψ= O s 0 s N1 s 0 s N1 ψ s 0 ,, s N1 ψ s 0 ,, s N1 ¯ = v α 0 L ( W s 0 s 0 [ 0 ] ) α 0 α 1 ( W s N1 s N1 [ N1 ] ) α N1 α N v α N R ( M [ 0 ] s 0 ) β 0 β 1 ( M [ N1 ] s N1 ) β N1 β N ( M [ 0 ] s 0 ) ¯ γ 0 γ 1 ( M [ N1 ] s N1 ) ¯ γ N1 γ N (22)

The summation over one virtual index α 0 and two physical indices s 0 and s 0 of v α 0 L ( W s 0 s 0 [ 0 ] ) α 0 α 1 , ( M [ 0 ] s 0 ) β 0 β 1 and ( M [ 0 ] s 0 ) ¯ γ 0 γ 1 is a tensor of order 3 with virtual indices α 1 , β 1 and γ 1 . Note that β 0 = γ 0 =1 .

If the operator O ^ is local and ψ s is a canonical form, the expression in (22) can be simplified. For example, ψ s has the mixed canonical form (16), O ^ is the operator acting on local site 2 and site 3. For example, ( W s i s i [ i ] ) α i , α i+1 = δ s i , s i δ α i , α i+1 for i2,3 ,

(23)

The ground state of Hamiltonian H ^ can be calculated by DMRG algorithm [11], which is a variational method by minimizing ψ| H ^ |ψ over the tensor ψ s of order N . Here we always require that s | ψ s | 2 =1 . Since ψ s has the structure of matrix product state, this global minimization can be realized by local minimization step by step. For example, H ^ and ψ s have a form (19), and (16), respectively, then ψ| H ^ |ψ has a form (23) can be written as

ψ| H ^ |ψ=Θ| H eff |Θ (24)

where Θ= Λ [ 2 ] B [ 2 ] B [ 3 ] is a tensor of order 4. H eff , which is the tensor of order 8, is obtained by the contraction of the left environment L [ 2 ] , right environment R [ 3 ] , W [ 2 ] and W [ 3 ] . Here the left environment L [ i ] is obtained from the contraction of L [ i1 ] , W [ i1 ] , A [ i1 ] and A [ i1 ] ¯ , L β 0 γ 0 α 0 [ 0 ] = δ β 0 γ 0 v α 0 L . Similarly, R [ i ] is obtained from the contraction of R [ i+1 ] , W [ i+1 ] and B [ i+1 ] , B [ i+1 ] ¯ , R β N γ N α N [ N ] = δ β N γ N v α N R .

To keep the mixed canonical form of tensor of order N , THE SVD for the minimum Θ min is

Θ min = A ˜ [ 2 ] Λ ˜ [ 3 ] B ˜ [ 3 ] Θ ( β 2 s 2 ),( β 4 s 3 ) = β 3 =1 min( d χ 2 ,d χ 4 ) A ˜ ( β 2 s 2 ), β 3 [ 2 ] Λ ˜ β 3 β 3 [ 3 ] B ˜ β 3 ,( β 4 s 3 ) [ 3 ] (25)

Here the tensor Θ β 2 β 4 s 2 s 3 of order 4 is rewritten as a matrix Θ ( β 2 s 2 ),( β 4 s 3 ) . The bond dimension becomes d times χ 2 or χ 4 which is almost d times of the bond dimension for the original β 3 =1 χ 3 ( A [ 2 ] s 2 ) β 2 , β 3 Λ β 3 β 3 [ 3 ] ( B [ 3 ] s 3 ) β 3 , β 4 . Here we assume that χ 2 ~ χ 3 ~ χ 4 . To keep the bond dimension under control, the SVD in (25) is truncated for k=1,, χ max . In practice, the largest χ max singular values in magnitude { Λ β 3 β 3 [ 3 ] } β 3 =1 χ max are kept and then scale these singular values such that k=1 χ max | Λ β 3 β 3 [ 3 ] | 2 = k=1 min( d χ 2 ,d χ 4 ) | Λ ˜ β 3 β 3 [ 3 ] | 2 to ensure | ψ s | 2 =1 . For the ground state with not highly entangled, the singular values in magnitude decays vary fast. This truncation will not cause much error. Replacing Θ= Λ [ 2 ] B [ 2 ] B [ 3 ] by Θ min = A ˜ [ 2 ] Λ ˜ [ 3 ] B ˜ [ 3 ] , we get another better tensor with the less value of ψ| O ^ |ψ . This better tensor is also in the mixed canonical form. This is called one step of two-site DMRG algorithm since the local tensors Λ [ 2 ] B [ 2 ] at site 2 and B [ 3 ] at site 3 are updated. To update the local tensors Λ [ 3 ] B [ 3 ] at site 3 and B [ 4 ] at site 4 in the next step of DMRG, we should prepare the left environment L [ 3 ] , right environment R [ 4 ] . L [ 3 ] is the contraction of L [ 2 ] , W [ 2 ] , A ˜ [ 2 ] and A ˜ [ 2 ] ¯ . So we use N1 steps of DMRG to update all N sub-tensors from the left to the right-hand side. This is called one sweep of DMRG. The next sweep is implemented from the right to the left-hand side. This algorithm will stop if ψ| H ^ |ψ will not decrease.

3. Boltzmann Machine Learning

The quantum expectation value of an operator O ^ on a non-normalized state |ψ can be written as a classical expectation value over the distribution p( s )= | ψ( s ) | 2 / ψ|ψ using

O ^ ψ| O ^ |ψ ψ|ψ =E[ O ˜ ] s p( s ) O ˜ ( s ) (26)

where

O ˜ ( s )= s| O ^ |ψ s|ψ = s ψ( s ) ψ( s ) s| O ^ | s (27)

If the matrix presentation O of the operator O ^ under the basis | s is sparse, there are only O( n ) basis |s such that s| O ^ | s are nonzero. Equation (26) shows that O ^ can be calculated by Monte Carlo sampling of O ˜ ( s ) with the probability p( s ) .

We use neutral network to describe the wave function ψ( s ) , which depends on real parameters θ= { θ k } k=1 p , and thus denoted by ψ θ ( s ) . Denote by δ θ k the change of the kth component θ k . ψ θ+δ θ k ( s ) has the expansion

ψ θ+δ θ k ( s )= ψ θ ( s )+δ θ k ψ θ ( s ) θ k +O( δ θ k 2 ) (28)

Define the local operator Ψ ^ k with matrix elements

s| Ψ ^ k | s = δ s, s Ψ k ( s ) (29)

where we introduced the log-derivative of ψ θ ( s )

Ψ k ( s )= ln ψ θ ( s ) θ k = 1 ψ θ ( s ) ψ θ ( s ) θ k (30)

Here Ψ k ( s ) depends on θ . We thus have

s| Ψ ^ k | ψ θ = Ψ k ( s ) ψ θ ( s )= ψ θ ( s ) θ k (31)

From (28), one has

| ψ θ+ θ k =( 1+δ θ k Ψ ^ k )| ψ θ (32)

where we omitted O( δ θ k 2 ) .

| ψ θ is normalized to be

| v 0,θ = | ψ θ ψ θ | ψ θ (33)

Define

| v k,θ =( Ψ ^ k Ψ ^ k )| v 0,θ ,k=1,,p (34)

where

Ψ ^ k = v 0,θ | Ψ ^ k | v 0,θ = ψ θ | Ψ ^ k | ψ θ ψ θ | ψ θ (35)

Thus | v k,θ and | v 0,θ are orthogonal, k=1,,p . But v k,θ | v k ,θ 0 for k, k =1,,p .

The norm squared of | ψ θ+δ θ k is

ψ θ+δ θ k | ψ θ+δ θ k = ψ θ | ( 1+δ θ k Ψ ^ k ) * ( 1+δ θ k Ψ ^ k )| ψ θ = ψ θ | ψ θ [ 1+2Re( δ θ k Ψ ^ k )+O( δ θ k 2 ) ] (36)

where Re denotes the real part. One has from (32) (36)

| v 0,θ+δ θ k = | ψ θ+δ θ k ψ θ+δ θ k | ψ θ+δ θ k =| v 0,θ +[ δ θ k Ψ ^ k Re( δ θ k Ψ ^ k ) ]| v 0,θ +O( δ θ k 2 ) =[ 1+iIm( δ θ k Ψ ^ k ) ]| v 0,θ +δ θ k | v k,θ +O( δ θ k 2 )( by( 34 ) ) = e iδϕ [ | v 0,θ +δ θ k | v k,θ ]+O( δ θ k 2 ) (37)

where δϕ=Im( δ θ k Ψ ^ k ) is the imaginary part of δ θ k Ψ ^ k .

Let H ^ be the Hamiltonian operator and using (37), one has

θ k ψ θ | H ^ | ψ θ ψ θ | ψ θ = θ k v 0,θ | H ^ | v 0,θ = lim δ θ k 0 v 0,θ+δ θ k | H ^ | v 0,θ+δ θ k v 0,θ | H ^ | v 0,θ δ θ k

= v k,θ | H ^ | v 0,θ + v 0,θ | H ^ | v k,θ =2Re[ ψ θ | H ^ ( Ψ ^ k Ψ ^ k )| ψ θ ψ θ | ψ θ ] =2Re[ ψ θ | H ^ Ψ ^ k | ψ θ ψ θ | ψ θ ψ θ | H ^ | ψ θ ψ θ | ψ θ ψ θ | Ψ ^ k | ψ θ ψ θ | ψ θ ] (38)

The k th parameter θ k is updated according to the gradient descent method

θ k θ k η f k (39)

where f k = E θ θ k , E θ = ψ θ | H ^ | ψ θ ψ θ | ψ θ , η>0 is the learning rate.

If each component θ k has a change δ θ k , the wave function ψ θ ( s ) has changed to be ψ θ+δθ ( s ) . Let | v 0,θ+δθ = | ψ θ+δθ / ψ θ+δ θ k | ψ θ+δ θ k . Equation (37) is generalized to be

| v 0,θ+δθ = e iδϕ [ | v 0,θ + k=1 p δ θ k | v k,θ ]+O( δ θ 2 ) (40)

where δϕ= k=1 p Im( δ θ k Ψ ^ k ) .

The distance between | v 0,θ and | v 0,θ+δθ is

δ s 2 = min δα e iδα | v 0,θ+δθ | v 0,θ 2 (41)

When δα=δϕ , δ s 2 is minimized to be

δ s 2 = 1k, k p v k,θ | v k ,θ δ θ k δ θ k +o( δ θ 2 )= 1k, k p S k, k δ θ k δ θ k +o( δ θ 2 ) (42)

with

S k, k = v k,θ | v k ,θ + v k ,θ | v k,θ 2 =Re( v k,θ | v k ,θ ) =Re( Ψ ^ k * Ψ ^ k Ψ ^ k * Ψ k ) (43)

where we used

v k,θ | v k ,θ = v 0,θ | ( Ψ ^ k Ψ ^ k ) * ( Ψ ^ k Ψ ^ k )| v 0,θ (44)

Find δθ such that: 1) ΔE= E θ+δθ E θ is minimized; 2) the distance δ s 2 between | v 0,θ and | v 0,θ+δθ is as small as possible. Minimize

ΔE+μδ s 2 = k E θ θ k δ θ k +μ k, k S k, k δ θ k δ θ k +o( δ θ 2 ) (45)

to find that δθ satisfies

k S k, k δ θ k = f k 2μ (46)

which can be used to update the parameter θ . This algorithm is called the stochastic reconfiguration method.

In the Boltzmann machine ansatz, the wave function is chosen to be

ψ θ ( s )=exp( j=0 N1 a j s j ) i=0 M1 2cosh( b i + j=0 N1 W ij s j ) (47)

where θ={ a j , b i , W ij } are the real parameters. Here M is a given positive integer number. α=M/N is the ratio of M and N . Compared to the other neutral network ansatz, Ψ k for the Boltzmann machine ansatz can be calculated analytically [39].

4. Variational Quantum Eigensolver

The variational quantum eigensolver is aimed at finding the ground state energy of a Hamiltonian H ^ by minimizing the cost function L( θ )= ψ θ | H ^ | ψ θ , where he parameter θ is updated by θηL( θ ) by iterations. Here η>0 is the learning rate. We choose the trial state | ψ θ = U θ | ψ 0 for some ansatz U θ and initial state | ψ 0 . The variational Hamiltonian ansatz also aims to prepare a trial ground state for a given Hamiltonian H ^ = k H ^ k (where H ^ k are Hermitian operators, usual Pauli strings) by Trotterizing an adiabatic state preparation process [116]. Here, each Trotter step corresponds to a variational ansatz so that the unitary is given U θ = l ( k e i θ l,k H ^ k ) .

Consider a general Hamiltonian

H ^ = σ=, j=0 N2 ( C X h X j,σ X j+1,σ + C Y h Y j,σ Y j+1,σ + C Z h Z j,σ Z j+1,σ ) + j=0 N1 ( C X v X j, X j, + C Y v Y j, Y j, + C Z v Z j, Z j, ) (48)

where N is an even integer and the coefficients C α h >0 and C α v do not depend on sites. X j,σ , etc., denotes the Pauli X matrix acting on site j and spin σ=, . Splitting the N sites to be even sites and odd sites, this Hamiltonian can be written as

H ^ = α=X,Y,Z ( H α h,e + H α h,o + H α v,e + H α v,o )= H e + H o (49)

where

H e = α=X,Y,Z ( H α h,e + H α v,e ), H o = α=X,Y,Z ( H α h,o + H α v,o ) (50)

H α h,e = σ=, evenj=0 N2 C α h α j,σ α j+1,σ , H α v,e = evenj=0 N1 C α v α j,σ α j, α j, ,α=X,Y,Z (51)

H α h,o and H α v,o are defined similarly by replacing summation over even site j with odd site j .

Inspired by Ref. [117] [118], the quantum circuit is U θ = k=1 p U h ( θ k h ) U v ( θ k v ) , where

U h ( θ k h )=G( θ k,X h,e , H X h,e )G( θ k,Y h,e , H Y h,e )G( θ k,Z h,e , H Z h,e ) G( θ k,Z h,o , H Z h,o )G( θ k,Y h,o , H Y h,o )G( θ k,X h,o , H X h,o ) (52)

where G( x,H )= e ixH . U v ( θ k v ) is defined similarly, with the subscription h replaced by v . Since the terms in H α h,o , etc., commute with each other,

G( θ k,X h,e , H X h,e )= σ=, evenj=0 N2 e i C α h α j,σ α j+1,σ

The initial state | ψ 0 is chosen to be the ground state | ψ 0 = σ=, evenj=0 N2 1 2 ( | 01| 10 ) of α=X,Y,Z H α h,e with the ground state energy 3N C α h . This is because

α j,σ α j+1,σ ( | 01| 10 )=( | 01| 10 ) (53)

for α=X,Y,Z , σ=, and even site j=0,2,,N2 .

5. Fermi-Hubbard Model

The Hamiltonian for Fermi-Hubbard model is

H ^ =t σ=, j=0 N2 ( c j,σ c j+1,σ +h.c. )+U j=0 N1 n j, n j, μ σ=, j=0 N1 n j,σ =t σ=, j=0 N2 ( c j,σ c j+1,σ +h.c. )+U j=0 N1 ( n j, 1 2 )( n j, 1 2 ) ( μ U 2 ) σ=, j=0 N1 n j,σ NU 4 (54)

where open boundary condition is assumed and n j,σ = c j,σ c j,σ . The creation operator c j,σ and the annihilate operators c j,σ satisfy

{ c j,σ , c k,τ }= δ jk δ στ ,{ c j,σ , c k,τ }=0,{ c j,σ , c k,τ }=0 (55)

For the half filling case: μ=U/2 , the Hamiltonian is reduced to

H ^ =t σ=, j=0 N2 ( c j,σ c j+1,σ +h.c. )+U j=0 N1 ( n j, 1 2 )( n j, 1 2 ) NU 4 (56)

Combining the index σ=( 0 ),( 1 ) and j=0,,N1 to be k=Nσ+j , we have

H ^ = k=0 2N2 t k ( c k c k+1 +h.c. )+U k=0 N1 ( n k 1 2 )( n k+N 1 2 ) NU 4 (57)

where t k =t if kN1 and 0 if k=N1 . The Jordan-Wigner representation shows that

n j = 1 2 + 1 2 Z j Z j =2 n j 1

2( c k+1 c k + c k c k+1 )= X k X k+1 + Y k Y k+1

Here X,Y,Z are Pauli operators. In the Jordan-Wigner representation, the Hamiltonian for half-filling case, is written as

1 tN H ^ = 1 2N k=0 2N2 t k ( X k X k+1 + Y k Y k+1 )+ U 4tN k=0 N1 Z k Z k+N U 4t (58)

which is the special case for the Hamiltonian in (48) except the constant U 4t .

If one uses the index k=2j+σ for j=0,,N1 and σ=( 0 ),( 1 ) , the Hamiltonian in (56) becomes

H ^ =t k=0 2N3 ( c k c k+2 +h.c. )+U k=0 N1 ( n 2k 1 2 )( n 2k+1 1 2 ) NU 4 (59)

Under the Jordan-Wigner representation

2( c k+2 c k + c k c k+2 )= X k ( Z k+1 ) X k+2 + Y k ( Z k+1 ) Y k+2

it becomes

1 tN H ^ = 1 2N k=0 2N3 ( X k ( Z k+1 ) X k+2 + Y k ( Z k+1 ) Y k+2 )+ U 4t k=0 N1 Z 2k Z 2k+1 U 4t (60)

6. Schwinger Model

The massive Schwinger model, or QED in two space-time dimensions, is a gauge theory describing the interaction of a single fermionic species with the photon field. In the temporal gauge, the Hamiltonian density is

=i ψ γ 0 γ 1 ( x +igA )ψ+m ψ ( x ) γ 0 ψ+ 1 2 E 2 (61)

where

γ 0 =( 1 0 0 1 ), γ 1 =( 0 1 1 0 )

are the γ matrices, m and g are two parameters. The electric field, E= t A satisfies the Gauss’s law

x E( x )g ψ ( x )ψ( x )=0

Here x and t denotes the partial derivative along one-dimensional space direction x and time direction t .

The theory is quantized using canonical quantization by imposing anticommutation relations on the fermion fields

{ ψ ( x,t ),ψ( y,t ) }=δ( xy ) (62)

and by imposing commutation relations on the gauge fields

[ E( x,t ),A( y,t ) ]=iδ( xy ) (63)

The model can now be formulated on a “staggered” spatial lattice. Let the lattice spacing be a , and label the sites with an integer n . Define a single-component fermion field ϕ( n ) at each site n , obeying anticommutation relations

{ ϕ ( n ),ϕ( m ) }= δ mn (64)

The gauge field is defined on the links ( n,n+1 ) connecting each pair of sites by

U( n,n+1 )= e iθ( n ) = e iagA( n ) (65)

Then the lattice Hamiltonian equivalent to Equation (61) is

H ^ = i 2a n=0 N1 [ ϕ ( n ) e iθ( n ) ϕ( n+1 )H.c. ]+m n=0 N1 ( 1 ) n ϕ ( n )ϕ( n )+ g 2 a 2 n=0 N1 L 2 ( n ) (66)

where the number of lattice sites N is even, and the correspondence between lattice and continuum fields is

ϕ( n ) a { ψ e ( x ), neven, ψ o ( x ), nodd (67)

ψ e and ψ o are the two components of the continuum spinor ψ=( ψ e , ψ o ) ,

1 ag θ( n )A( x ),gL( n )E( x ) (68)

From the commutation relations (63) and the above correspondence, one has

[ θ( n ),L( m ) ]=i δ nm (69)

The dimensionless Hamiltonian is 2 a g 2 H ^ , which is also denoted by H ^

H ^ =ix n=0 N1 [ ϕ ( n ) e iθ( n ) ϕ( n+1 )H.c. ]+μ n=0 N1 ( 1 ) n ϕ ( n )ϕ( n )+ n=0 N1 L 2 ( n ) (70)

with the dimensionless parameters

x= 1 g 2 a 2 ,μ= 2m g 2 a (71)

The Gauss law x E=g ψ ψ is discretized to be

L( n )L( n1 )=ϕ ( n ) ϕ( n ) 1 2 [ 1 ( 1 ) n ] (72)

The elimination of fermion fields can be realized by using a Jordan-Wigner transformation

ϕ( n )= k<n ( σ k z ) σ n ,ϕ ( n ) = k<n ( σ k z ) σ n +

where σ n ± = ( X n ±i Y n )/2 denotes the matrix |01| ( |10| ) acting on the jth qubit.

The Gauss law in (72) is reduced to be

L( n )L( n1 )= 1 2 [ σ n z + ( 1 ) n ] (73)

and the dimensionless Hamiltonian in (70) is

H=ix n=0 N1 [ σ n + e iθ( n ) σ n+1 H.c. ]+μ n=0 N1 ( 1 ) n 1 2 ( σ n z +1 )+ n=0 N1 L 2 ( n ) (74)

The factor e iθ( n ) has been eliminated by a residual gauge transformation [119]

σ n l<n { e iθ( l ) } σ n (75)

Finally, the model (70) can be mapped to a spin 1/2 Hamiltonian [119] [120]

H=x n=0 N2 [ σ n + σ n+1 + σ n σ n+1 + ]+ μ 2 n=0 N1 [ 1+ ( 1 ) n σ n z ]+ n=0 N2 [ + 1 2 k=0 n ( ( 1 ) k + σ k z ) ] 2 = x 2 n=0 N2 [ X n X n+1 + Y n Y n+1 ]+ μ 2 n=0 N1 [ 1+ ( 1 ) n Z n ]+ n=0 N2 [ + 1 2 k=0 n ( ( 1 ) k + Z k ) ] 2 (76)

where is the boundary electric field (on the leftmost link), which can describe the background field. In the second equality, we used

σ n + σ n+1 + σ n σ n+1 + = X n X n+1 + Y n Y n+1 2 , σ n z = Z n

7. Simulation Results

We investigate the Fermi-Hubbard model at half filling, where the Hamiltonian is given by (56) or (58). Table 1 presents the ground state energy per site E 0 /N obtained by DMRG algorithm for different values of N and U/t . It is evident that the thermodynamic limit ( N ) is achieved in each column. We also check these results by exact diagonalization and find that the error between the DMRG and exact ground state energies is less than 1.42 × 109 for all ( U/t ,N ) in Table 1, demonstrating the high accuracy of the DMRG method. Figure 1 illustrates the energy H ^ =ψ| H ^ |ψ in Equation (24) as a function of iteration for different values of U/t with N=8 . We perform 8 sweeps, with 14 ( =2( N1 ) ) local minimizations in each sweep (multiplied by 2 due to spin up and spin down states). It is noteworthy that the ground state energy is obtained after a single sweep (14 local minimizations). Furthermore, the energy H ^ decreases with each step of local minimization.

Figure 1. The dependence of H ^ of the Fermi-Hubbard model for half-filling case on the iteration for different U/t , N=8 by DMRG algorithm.

Table 1. The ground state energy E 0 /N of the Fermi-Hubbard model for half-filling case obtained by DMRG algorithm.

U/t

0

2

4

8

N=4

−1.118033

−1.718985

−2.488286

−4.279293

N=6

−1.164653

−1.757718

−2.515427

−4.294683

N=8

−1.189692

−1.778204

−2.529475

−4.302603

We display the ground state energy per site, E 0 /N , obtained using the restricted Boltzmann machine with α=4 in Table 2. To calculate the ground state energy E 0 /N , we use the last 10,000 sampling data out of a total of 40,000 data points. Comparing these results with those obtained using the DMRG algorithm, we find that the results from the restricted Boltzmann machine are reliable when U/t and N are not too large. However, for U/t =8 and N=8 , the value E 0 /N =4.211473 in Table 2 is significantly higher than E 0 /N =4.302603 in Table 1. Figure 2 illustrates the dependence of H ^ on the iteration number for the restricted Boltzmann machine with α=4 and N=8 . For the case U/t =8.0 , there are large fluctuations of H ^ with each iteration.

Figure 2. The dependence of H ^ of the Fermi-Hubbard model for half-filling case on the iteration for different U/t by restricted Boltzmann machine with α=4 and N=8 .

Table 2. The ground state energy E 0 /N of the Fermi-Hubbard model for half-filling case obtained from the last 10,000 sampling data (total 40,000 data). Using restricted Boltzmann machine with α=4 .

U/t

0

2

4

8

N=4

−1.112495

±

0.00458

−1.713604

±

0.00430

−2.482209

±

0.00468

−4.270301

±

0.00639

N=6

−1.154108

±

0.00698

−1.747218

±

0.00706

−2.502630

±

0.00775

−4.272329

±

0.01133

N=8

−1.172597

±

0.00820

−1.759270

±

0.00934

−2.507544

±

0.01090

−4.211473

±

0.01207

Table 3 displays the ground state energy per site, E 0 /N , obtained using the variational quantum eigensolver (VQE) with p=6 . The results from VQE show good agreement with those obtained using the DMRG algorithm. The largest deviation in E 0 /N between VQE and DMRG is 0.017611, which occurs for the case U/t =8 and N=8 . Figure 3 illustrates the dependence of H ^ on the iteration number for VQE with different values of U/t and N=8 . When compared with the fluctuation in H ^ shown in Figure 2 for the restricted Boltzmann machine, the fluctuation observed in Figure 3 is very small.

Figure 3. The dependence of H ^ of the Fermi-Hubbard model for half-filling case on the iteration by VQE with p=6 for different U/t , N=8 .

Table 3. The ground state energy E 0 /N of the Fermi-Hubbard model for half-filling case obtained by VQE after 2000 iterations, p=6 in quantum circuit U( θ ) , the learning rate η=0.01 .

U/t

0

2

4

8

N=4

−1.11802

±

0.000003

−1.718857

±

0.000036

−2.488273

±

0.000009

−4.274382

±

0.002363

N=6

−1.164649

±

0.000001

−1.757449

±

0.000014

−2.514657

±

0.000070

−4.284413

±

0.000717

N=8

−1.189618

±

0.000004

−1.776534

±

0.000159

−2.520144

±

0.001265

−4.284992

±

0.001337

The ground state energy per site, E 0 /N , of the Schwinger model (76) has been calculated using both the density matrix renormalization group (DMRG) algorithm and the variational quantum eigensolver (VQE). However, the restricted Boltzmann machine is not suitable for solving the Schwinger model as it fails to approach the ground state energy accurately. In this study, we have chosen x=100 and =0 . Table 4 presents the ground state energy per site obtained by the DMRG algorithm for different values of μ and N . Comparing the results to the exact values, we observe that E 0 /N for N=4 and 8 has an error less than O( 10 10 ) , while for N=16 the error is on the order of O( 10 4 ) . For fixed values of μ=0 and 0.5, E 0 /N tends to the thermodynamic limit as N . Table 5 displays the ground state energy per site obtained by VQE for different values of μ and N=4,8 , and 16 due to computational limitations. It is worth noting that E 0 /N obtained by VQE is slightly larger than those obtained by the DMRG algorithm.

Table 4. The ground state energy E 0 /N of the Schwinger model with x=100 obtained by DMRG algorithm.

μ

0.0

2.5

N=4

−55.627908

−54.403737

N=8

−59.184968

−57.966911

N=16

−61.162808

−59.954053

N=32

−62.209047

−61.012423

N=64

−62.752515

−61.564360

Table 5. The ground state energy E 0 /N of the Schwinger model with x=100 obtained by VQE. The last 1000 iterations are used (total 3000 iterations), p=6 in quantum circuit U( θ ) , and the learning rate η=0.01 .

μ

0.0

2.5

N=4

−55.513396 ± 0.000435

−54.263672 ± 0.000295

N=8

−58.831446 ± 0.000582

−57.581606 ± 0.000463

N=16

−60.318314 ± 0.000503

−59.068237 ± 0.000498

8. Discussion

We have used three variational methods to calculate the ground state energy for Fermi-Hubbard model at half filling and Schwinger model. The DMRG algorithm has proven to be successful for these two models, while the VQE algorithm, although less accurate, is also effective for calculating ground state energies. However, it seems that the restricted Boltzmann learning method is not as accurate as the DMRG algorithm for the Fermi-Hubbard model. It’s unfortunate that the restricted Boltzmann does not work for solving the ground state energy of Schwinger model. We also used mean field ansatz, Jastrow ansatz, multi-layer dense network, group convolutional neural networks [75] [121] and autoregressive networks [62], etc., but it also does not work. The authors in [122] used the transformer quantum state (TQS) to study the ground state of 1D transverse field Ising model and showed the power of TQS in expressing the quantum states for quantum many-body systems. We used TQS to calculate the ground state energy of Schwinger model with N=20 for different μ in Figure 4. TQS is trained for many randomly chosen μ[ 1.5,3.5 ] and then the TQS model is extrapolated to the other values of μ=[ 0,1.5 ][ 3.5,5 ] . The trained TQS model can also be fine-tuned. The calculated result in Figure 4 should be comparable with the ground state energy obtained by DMRG algorithm.

Figure 4. The ground state energy E 0 /N of Schwinger model with N=20 obtained by transformer quantum state (TQS).

Variational methods can indeed be applied to various other aspects of quantum systems, such as excited states, thermal states, real-time dynamics, dissipative dynamics, and quantum control. It’s beneficial to learn from algorithms and ideas used in one variational method and apply them to other variational methods. This cross-pollination of ideas can lead to further advancements in the field.

Acknowledgements

Daming Li was supported by National Key Research and Development Program of China (No. 2024YFA1014104), and Shanghai Science and Technology Innovation Action Plan Project (No. 22JC1401500).

Appendix

The decomposition in (7)

For the sake of notation convenience, s i =1,,d for i=0,,N1 . Combining the last N1 indices { s i } i=1 N1 together: ( s 1 s N1 )=( s 1 1 ) d N2 ++( s N1 1 ) d 0 +1 d N1 , the tensor ψ s 0 ,, s N1 can be regarded as d× d N1 matrix

ψ s 0 ,, s N1 ψ s 0 ,( s 1 s N1 ) (77)

The SVD of d× d N1 matrix ψ s 0 ,( s 1 s N1 ) is

ψ s 0 ,( s 1 s N1 ) = α 1 =1 χ 1 U s 0 , α 1 S α 1 V α 1 ,( s 1 s N1 ) (78)

with χ 1 d , S α 1 is the singular value, U and V are d× χ 1 and d N1 × χ 1 unitary matrix (the column vectors with unit length are orthogonal to each other), respectively. Let ( M [ 0 ] s 0 ) α 0 , α 1 = U s 0 , α 1 , which is a 1× χ 1 matrix ( α 0 =1 and s 0 fixed). The left two parts in SVD are combined to be ( χ 1 d )× d N2 matrix

S α 1 V α 1 ,( s 1 s N1 ) ψ ( α 1 s 1 ),( s 2 s N1 ) (79)

where ( α 1 s 1 )=( α 1 1 )d+ s 1 ( χ 1 1 )d+d= χ 1 d , ( s 2 s N1 )=( s 2 1 ) d N3 ++( s N1 1 ) d 0 +1 d N2 . So, we have

ψ s 0 ,( s 1 s N1 ) = α 1 =1 χ 1 ( M [ 0 ] s 0 ) α 0 , α 1 ψ ( α 1 s 1 ),( s 2 s N1 )

The SVD of ψ ( α 1 s 1 ),( s 2 s N1 ) is

ψ ( α 1 s 1 ),( s 2 s N1 ) = α 2 =1 χ 2 U ( α 1 s 1 ), α 2 S α 2 V α 2 ,( s 2 s N1 ) (80)

Let ( M [ 1 ] s 1 ) α 1 , α 2 = U ( α 1 s 1 ), α 2 , which is a χ 1 × χ 2 matrix ( s 1 fixed). The remaining two parts are combined as ( χ 2 d )× d N3 matrix

S α 2 V α 2 ,( s 2 s N1 ) ψ ( α 2 s 2 ),( s 3 s N1 ) (81)

After N2 steps of SVD, we get ( χ N2 d )×d matrix ψ ( α N2 s N2 ), s N1 , and use SVD again

ψ ( α N2 s N2 ), s N1 = α N1 =1 χ N1 U ( α N2 s N2 ), α N1 S α N1 V α N1 , s N1 (82)

Let ( M [ N2 ] s N2 ) α N2 , α N1 = U ( α N2 s N2 ), α N1 , which is a χ N2 × χ N1 matrix. Let ( M [ N1 ] s N1 ) α N1 , α N = S α N1 V α N1 , s N1 , which is a χ N1 ×1 matrix ( α N =1 and s N1 =1 fixed). Thus after N1 steps of SVD, the decomposition in (7) is obtained.

From the above SVD processes, { M [ i ] } i=0 N2 satisfy the left canonical condition. For example,

s 0 ( M [ 0 ] s 0 ) M [ 0 ] s 0 = I χ 1 s 0 ,k ( M [ 0 ] s 0 ) ki ¯ ( M [ 0 ] s 0 ) kj = s 0 U s 0 i ¯ U s 0 j = δ ij ,1i,j χ 1 (83)

due to the unitary matrix U where I χ 1 is the χ 1 × χ 1 identity matrix. Here the summation over k=1 can be ignored. Since { M [ i ] } i=0 N2 satisfy the left canonical condition, one has

ψ|ψ= s | ψ s 0 ,, s N1 | 2 = s ( M [ 0 ] s 0 ) 1, β 1 ( M [ 1 ] s 1 ) β 1 β 2 ( M [ N1 ] s N1 ) β N1 ,1 ( M [ 0 ] s 0 ) 1, γ 1 ¯ ( M [ 1 ] s 1 ) γ 1 γ 2 ¯ ( M [ N1 ] s N1 ) γ N1 ,1 ¯ = s N1 , α N1 ( M [ N1 ] s N1 ) α N1 ,1 ¯ ( M [ N1 ] s N1 ) α N1 ,1 = s N1 , α N1 S α N1 V α N1 , s N1 ¯ S α N1 V α N1 , s N1 = s N1 , α N1 S α N1 2 V s N1 , α N1 V s N1 , α N1 ¯ = α N1 =1 χ N1 S α N1 2 (84)

If s 0 ,, s N1 | ψ s 0 ,, s N1 | 2 =1 , the left canonical condition for M [ N1 ] is also satisfied.

Conflicts of Interest

The author declares no conflicts of interest regarding the publication of this paper.

References

[1] Feynman, R.P. (1954) Atomic Theory of the Two-Fluid Model of Liquid Helium. Physical Review, 94, 262-277.
https://doi.org/10.1103/physrev.94.262
[2] Feynman, R.P. and Cohen, M. (1956) Energy Spectrum of the Excitations in Liquid Helium. Physical Review, 102, 1189-1204.
https://doi.org/10.1103/physrev.102.1189
[3] Tsui, D.C., Stormer, H.L. and Gossard, A.C. (1982) Two-Dimensional Magnetotransport in the Extreme Quantum Limit. Physical Review Letters, 48, 1559-1562.
https://doi.org/10.1103/physrevlett.48.1559
[4] Laughlin, R.B. (1983) Anomalous Quantum Hall Effect: An Incompressible Quantum Fluid with Fractionally Charged Excitations. Physical Review Letters, 50, 1395-1398.
https://doi.org/10.1103/physrevlett.50.1395
[5] Haldane, F.D.M. (1983) Continuum Dynamics of the 1-D Heisenberg Antiferromagnet: Identification with the O(3) Nonlinear Sigma Model. Physics Letters A, 93, 464-468.
https://doi.org/10.1016/0375-9601(83)90631-x
[6] Haldane, F.D.M. (1983) Nonlinear Field Theory of Large-Spin Heisenberg Antiferromagnets: Semiclassically Quantized Solitons of the One-Dimensional Easy-Axis Néel State. Physical Review Letters, 50, 1153-1156.
https://doi.org/10.1103/physrevlett.50.1153
[7] Anderson, P.W. (1973) Resonating Valence Bonds: A New Kind of Insulator? Materials Research Bulletin, 8, 153-160.
https://doi.org/10.1016/0025-5408(73)90167-0
[8] Bednorz, J.G. and Muller, K.A. (1986) Possible Hight C Superconductivity in the Ba-La-Cu-O System. Zeitschrift für Physik B Condensed Matter, 64, 189-193.
https://doi.org/10.1007/bf01303701
[9] Li, D. (2016) Fermion Bag Approach for the Massive Thirring Model at Finite Density. Physical Review D, 94, Article 114501.
https://doi.org/10.1103/physrevd.94.114501
[10] Hastings, M.B. (2007) An Area Law for One-Dimensional Quantum Systems. Journal of Statistical Mechanics: Theory and Experiment, 2007, P08024.
https://doi.org/10.1088/1742-5468/2007/08/p08024
[11] White, S.R. (1992) Density Matrix Formulation for Quantum Renormalization Groups. Physical Review Letters, 69, 2863-2866.
https://doi.org/10.1103/physrevlett.69.2863
[12] Schollwöck, U. (2011) The Density-Matrix Renormalization Group in the Age of Matrix Product States. Annals of Physics, 326, 96-192.
https://doi.org/10.1016/j.aop.2010.09.012
[13] White, S.R. and Feiguin, A.E. (2004) Real-Time Evolution Using the Density Matrix Renormalization Group. Physical Review Letters, 93, Article 076401.
https://doi.org/10.1103/physrevlett.93.076401
[14] Zaletel, M.P., Mong, R.S.K., Karrasch, C., Moore, J.E. and Pollmann, F. (2015) Time-Evolving a Matrix Product State with Long-Ranged Interactions. Physical Review B, 91, Article 165112.
https://doi.org/10.1103/physrevb.91.165112
[15] Haegeman, J., Cirac, J.I., Osborne, T.J., Pižorn, I., Verschelde, H. and Verstraete, F. (2011) Time-Dependent Variational Principle for Quantum Lattices. Physical Review Letters, 107, Article 070601.
https://doi.org/10.1103/physrevlett.107.070601
[16] Haegeman, J., Lubich, C., Oseledets, I., Vandereycken, B. and Verstraete, F. (2016) Unifying Time Evolution and Optimization with Matrix Product States. Physical Review B, 94, Article 165116.
https://doi.org/10.1103/physrevb.94.165116
[17] Pollmann, F., Khemani, V., Cirac, J.I. and Sondhi, S.L. (2016) Efficient Variational Diagonalization of Fully Many-Body Localized Hamiltonians. Physical Review B, 94, Article 041116.
https://doi.org/10.1103/physrevb.94.041116
[18] Khemani, V., Pollmann, F. and Sondhi, S.L. (2016) Obtaining Highly Excited Eigenstates of Many-Body Localized Hamiltonians by the Density Matrix Renormalization Group Approach. Physical Review Letters, 116, Article 247204.
https://doi.org/10.1103/physrevlett.116.247204
[19] Yu, X., Pekker, D. and Clark, B.K. (2017) Finding Matrix Product State Representations of Highly Excited Eigenstates of Many-Body Localized Hamiltonians. Physical Review Letters, 118, Article 017201.
https://doi.org/10.1103/physrevlett.118.017201
[20] Liang, S. and Pang, H. (1994) Approximate Diagonalization Using the Density Matrix Renormalization-Group Method: A Two-Dimensional-Systems Perspective. Physical Review B, 49, 9214-9217.
https://doi.org/10.1103/physrevb.49.9214
[21] McCulloch, I.P. and Gulácsi, M. (2002) The Non-Abelian Density Matrix Renormalization Group Algorithm. Europhysics Letters (EPL), 57, 852-858.
https://doi.org/10.1209/epl/i2002-00393-0
[22] Singh, S., Pfeifer, R.N.C. and Vidal, G. (2010) Tensor Network Decompositions in the Presence of a Global Symmetry. Physical Review A, 82, Article 050301.
https://doi.org/10.1103/physreva.82.050301
[23] Singh, S., Pfeifer, R.N.C. and Vidal, G. (2011) Tensor Network States and Algorithms in the Presence of a Global U(1) Symmetry. Physical Review B, 83, Article 115125.
https://doi.org/10.1103/physrevb.83.115125
[24] Singh, S. and Vidal, G. (2012) Tensor Network States and Algorithms in the Presence of a Global SU(2) Symmetry. Physical Review B, 86, Article 195114.
https://doi.org/10.1103/physrevb.86.195114
[25] Weichselbaum, A. (2012) Non-abelian Symmetries in Tensor Networks: A Quantum Symmetry Space Approach. Annals of Physics, 327, 2972-3047.
https://doi.org/10.1016/j.aop.2012.07.009
[26] White, S.R. (2005) Density Matrix Renormalization Group Algorithms with a Single Center Site. Physical Review B, 72, Article 180403.
https://doi.org/10.1103/physrevb.72.180403
[27] Hubig, C., McCulloch, I.P., Schollwöck, U. and Wolf, F.A. (2015) Strictly Single-Site DMRG Algorithm with Subspace Expansion. Physical Review B, 91, Article 155115.
https://doi.org/10.1103/physrevb.91.155115
[28] Motruk, J., Zaletel, M.P., Mong, R.S.K. and Pollmann, F. (2016) Density Matrix Renormalization Group on a Cylinder in Mixed Real and Momentum Space. Physical Review B, 93, Article 155139.
https://doi.org/10.1103/physrevb.93.155139
[29] Ehlers, G., White, S.R. and Noack, R.M. (2017) Hybrid-Space Density Matrix Renormalization Group Study of the Doped Two-Dimensional Hubbard Model. Physical Review B, 95, Article 125125.
https://doi.org/10.1103/physrevb.95.125125
[30] Stoudenmire, E.M. and White, S.R. (2013) Real-Space Parallel Density Matrix Renormalization Group. Physical Review B, 87, Article 155137.
https://doi.org/10.1103/physrevb.87.155137
[31] Verstraete, F. and Cirac, J.I. (2010) Continuous Matrix Product States for Quantum Fields. Physical Review Letters, 104, Article 190405.
https://doi.org/10.1103/physrevlett.104.190405
[32] Haegeman, J., Cirac, J.I., Osborne, T.J. and Verstraete, F. (2013) Calculus of Continuous Matrix Product States. Physical Review B, 88, Article 085118.
https://doi.org/10.1103/physrevb.88.085118
[33] Rincón, J., Ganahl, M. and Vidal, G. (2015) Lieb-Liniger Model with Exponentially Decaying Interactions: A Continuous Matrix Product State Study. Physical Review B, 92, Article 115107.
https://doi.org/10.1103/physrevb.92.115107
[34] Ganahl, M., Rincón, J. and Vidal, G. (2017) Continuous Matrix Product States for Quantum Fields: An Energy Minimization Algorithm. Physical Review Letters, 118, Article 220402.
https://doi.org/10.1103/physrevlett.118.220402
[35] Chung, S.S., Bauman, S., Sun, K. and Bolech, C.J. (2016) On the New Continuous Matrix Product Ansatz. Journal of Physics: Conference Series, 702, Article 012004.
https://doi.org/10.1088/1742-6596/702/1/012004
[36] Draxler, D., Haegeman, J., Verstraete, F. and Rizzi, M. (2017) Continuous Matrix Product States with Periodic Boundary Conditions and an Application to Atomtronics. Physical Review B, 95, Article 045145.
https://doi.org/10.1103/physrevb.95.045145
[37] Tilloy, A. (2021) Relativistic Continuous Matrix Product States for Quantum Fields without Cutoff. Physical Review D, 104, Article 096007.
https://doi.org/10.1103/physrevd.104.096007
[38] Carleo, G., Cirac, I., Cranmer, K., Daudet, L., Schuld, M., Tishby, N., et al. (2019) Machine Learning and the Physical Sciences. Reviews of Modern Physics, 91, Article 045002.
https://doi.org/10.1103/revmodphys.91.045002
[39] Carleo, G. and Troyer, M. (2017) Solving the Quantum Many-Body Problem with Artificial Neural Networks. Science, 355, 602-606.
https://doi.org/10.1126/science.aag2302
[40] Gao, X. and Duan, L. (2017) Efficient Representation of Quantum Many-Body States with Deep Neural Networks. Nature Communications, 8, Article No. 662.
https://doi.org/10.1038/s41467-017-00705-2
[41] Carleo, G., Nomura, Y. and Imada, M. (2018) Constructing Exact Representations of Quantum Many-Body Systems with Deep Neural Networks. Nature Communications, 9, Article No. 5322.
https://doi.org/10.1038/s41467-018-07520-3
[42] Freitas, N., Morigi, G. and Dunjko, V. (2018) Neural Network Operations and Susuki-Trotter Evolution of Neural Network States. International Journal of Quantum Information, 16, Article 1840008.
https://doi.org/10.1142/s0219749918400087
[43] Glasser, I., Pancotti, N., August, M., Rodriguez, I.D. and Cirac, J.I. (2018) Neural-Network Quantum States, String-Bond States, and Chiral Topological States. Physical Review X, 8, Article 011006.
https://doi.org/10.1103/physrevx.8.011006
[44] Nomura, Y., Darmawan, A.S., Yamaji, Y. and Imada, M. (2017) Restricted Boltzmann Machine Learning for Solving Strongly Correlated Quantum Systems. Physical Review B, 96, Article 205152.
https://doi.org/10.1103/physrevb.96.205152
[45] Vieijra, T., Casert, C., Nys, J., De Neve, W., Haegeman, J., Ryckebusch, J., et al. (2020) Restricted Boltzmann Machines for Quantum States with Non-Abelian or Anyonic Symmetries. Physical Review Letters, 124, Article 097201.
https://doi.org/10.1103/physrevlett.124.097201
[46] Golubeva, A. and Melko, R.G. (2022) Pruning a Restricted Boltzmann Machine for Quantum State Reconstruction. Physical Review B, 105, Article 125124.
https://doi.org/10.1103/physrevb.105.125124
[47] Pilati, S. and Pieri, P. (2020) Simulating Disordered Quantum Ising Chains via Dense and Sparse Restricted Boltzmann Machines. Physical Review E, 101, Article 063308.
https://doi.org/10.1103/physreve.101.063308
[48] Lu, S., Gao, X. and Duan, L.-. (2019) Efficient Representation of Topologically Ordered States with Restricted Boltzmann Machines. Physical Review B, 99, Article 155136.
https://doi.org/10.1103/physrevb.99.155136
[49] Nomura, Y., Yoshioka, N. and Nori, F. (2021) Purifying Deep Boltzmann Machines for Thermal Quantum States. Physical Review Letters, 127, Article 060601.
https://doi.org/10.1103/physrevlett.127.060601
[50] Vicentini, F., Biella, A., Regnault, N. and Ciuti, C. (2019) Variational Neural-Network Ansatz for Steady States in Open Quantum Systems. Physical Review Letters, 122, Article 250503.
https://doi.org/10.1103/physrevlett.122.250503
[51] Yoshioka, N. and Hamazaki, R. (2019) Constructing Neural Stationary States for Open Quantum Many-Body Systems. Physical Review B, 99, Article 214306.
https://doi.org/10.1103/physrevb.99.214306
[52] Nagy, A. and Savona, V. (2019) Variational Quantum Monte Carlo Method with a Neural-Network Ansatz for Open Quantum Systems. Physical Review Letters, 122, Article 250501.
https://doi.org/10.1103/physrevlett.122.250501
[53] Hartmann, M.J. and Carleo, G. (2019) Neural-Network Approach to Dissipative Quantum Many-Body Dynamics. Physical Review Letters, 122, Article 250502.
https://doi.org/10.1103/physrevlett.122.250502
[54] Nomura, Y. (2021) Helping Restricted Boltzmann Machines with Quantum-State Representation by Restoring Symmetry. Journal of Physics: Condensed Matter, 33, Article 174003.
https://doi.org/10.1088/1361-648x/abe268
[55] Park, C. and Kastoryano, M.J. (2022) Expressive Power of Complex-Valued Restricted Boltzmann Machines for Solving Nonstoquastic Hamiltonians. Physical Review B, 106, Article 134437.
https://doi.org/10.1103/physrevb.106.134437
[56] Park, C. and Kastoryano, M.J. (2020) Geometry of Learning Neural Quantum States. Physical Review Research, 2, Article 023232.
https://doi.org/10.1103/physrevresearch.2.023232
[57] Choo, K., Carleo, G., Regnault, N. and Neupert, T. (2018) Symmetries and Many-Body Excitations with Neural-Network Quantum States. Physical Review Letters, 121, Article 167204.
https://doi.org/10.1103/physrevlett.121.167204
[58] Torlai, G. and Melko, R.G. (2018) Latent Space Purification via Neural Density Operators. Physical Review Letters, 120, Article 240503.
https://doi.org/10.1103/physrevlett.120.240503
[59] Zen, R., My, L., Tan, R., Hébert, F., Gattobigio, M., Miniatura, C., et al. (2020) Transfer Learning for Scalability of Neural-Network Quantum States. Physical Review E, 101, Article 053301.
https://doi.org/10.1103/physreve.101.053301
[60] Cai, Z. and Liu, J. (2018) Approximating Quantum Many-Body Wave Functions Using Artificial Neural Networks. Physical Review B, 97, Article 035116.
https://doi.org/10.1103/physrevb.97.035116
[61] Luo, D. and Clark, B.K. (2019) Backflow Transformations via Neural Networks for Quantum Many-Body Wave Functions. Physical Review Letters, 122, Article 226401.
https://doi.org/10.1103/physrevlett.122.226401
[62] Sharir, O., Levine, Y., Wies, N., Carleo, G. and Shashua, A. (2020) Deep Autoregressive Models for the Efficient Variational Simulation of Many-Body Quantum Systems. Physical Review Letters, 124, Article 020503.
https://doi.org/10.1103/physrevlett.124.020503
[63] Kessler, J., Calcavecchia, F. and Kühne, T.D. (2021) Artificial Neural Networks as Trial Wave Functions for Quantum Monte Carlo. Advanced Theory and Simulations, 4, Article 200069.
https://doi.org/10.1002/adts.202000269
[64] Hibat-Allah, M., Ganahl, M., Hayward, L.E., Melko, R.G. and Carrasquilla, J. (2020) Recurrent Neural Network Wave Functions. Physical Review Research, 2, Article 023358.
https://doi.org/10.1103/physrevresearch.2.023358
[65] Roth, C. (2020) Iterative Retraining of Quantum Spin Models Using Recurrent Neural Networks.
[66] Chen, Z., Newhouse, L., Chen, E., Luo, D. and Soljačić, M. (2023) ANTN: Bridging Autoregressive Neural Networks and Tensor Networks for Quantum Many-Body Simulation.
[67] Schmitt, M. and Heyl, M. (2020) Quantum Many-Body Dynamics in Two Dimensions with Artificial Neural Networks. Physical Review Letters, 125, Article 100503.
https://doi.org/10.1103/physrevlett.125.100503
[68] Gutiérrez, I.L. and Mendl, C.B. (2022) Real Time Evolution with Neural-Network Quantum States. Quantum, 6, 627.
https://doi.org/10.22331/q-2022-01-20-627
[69] Yang, L., Leng, Z., Yu, G., Patel, A., Hu, W. and Pu, H. (2020) Deep Learning-Enhanced Variational Monte Carlo Method for Quantum Many-Body Physics. Physical Review Research, 2, Article 012039.
https://doi.org/10.1103/physrevresearch.2.012039
[70] Irikura, N. and Saito, H. (2020) Neural-Network Quantum States at Finite Temperature. Physical Review Research, 2, Article 013284.
https://doi.org/10.1103/physrevresearch.2.013284
[71] Vieijra, T. and Nys, J. (2021) Many-body Quantum States with Exact Conservation of Non-Abelian and Lattice Symmetries through Variational Monte Carlo. Physical Review B, 104, Article 045123.
https://doi.org/10.1103/physrevb.104.045123
[72] Liang, X., Liu, W., Lin, P., Guo, G., Zhang, Y. and He, L. (2018) Solving Frustrated Quantum Many-Particle Models with Convolutional Neural Networks. Physical Review B, 98, Article 104426.
https://doi.org/10.1103/physrevb.98.104426
[73] Liu, C. and Wang, D. (2021) Random Sampling Neural Network for Quantum Many-Body Problems. Physical Review B, 103, Article 205107.
https://doi.org/10.1103/physrevb.103.205107
[74] Saito, H. and Kato, M. (2018) Machine Learning Technique to Find Quantum Many-Body Ground States of Bosons on a Lattice. Journal of the Physical Society of Japan, 87, Article 014001.
https://doi.org/10.7566/jpsj.87.014001
[75] Roth, C. and MacDonald, A.H. (2021) Group Convolutional Neural Networks Improve Quantum State Accuracy.
[76] Fu, C., Zhang, X., Zhang, H., Ling, H., Xu, S. and Ji, S. (2021) Lattice Convolutional Networks for Learning Ground States of Quantum Many-Body Systems.
[77] Liang, X., Li, M., Xiao, Q., An, H., et al. (2022) 21296 Exponentially Complex Quantum Many-Body Simulation via Scalable Deep Learning Method.
[78] Choo, K., Neupert, T. and Carleo, G. (2019) Two-Dimensional Frustrated J1-J2 Model Studied with Neural Network Quantum States. Physical Review B, 100, Article 125124.
https://doi.org/10.1103/physrevb.100.125124
[79] Mikolov, T., Kombrink, S., Burget, L., Cernocky, J. and Khudanpur, S. (2011) Extensions of Recurrent Neural Network Language Model. 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Prague, 22-27 May 2011, 5528-5531.
https://doi.org/10.1109/icassp.2011.5947611
[80] Graves, A., Mohamed, A. and Hinton, G. (2013) Speech Recognition with Deep Recurrent Neural Networks. 2013 IEEE International Conference on Acoustics, Speech and Signal Processing, Vancouver, 26-31 May 2013, 6645-6649.
https://doi.org/10.1109/icassp.2013.6638947
[81] Gregor, K., Danihelka, I., Graves, A., Rezende, D.J. and Wierstra, D. (2015) Draw: A Recurrent Neural Network for Image Generation.
[82] Oord, A.V.D., Kalchbrenner, N. and Kavukcuoglu, K. (2016) Pixel Recurrent Neural Networks.
[83] Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., et al. (2017) Attention Is All You Need. 2017 31st Conference on Neural Information Processing Systems, Long Beach, 4-9 December 2017, 1-11.
[84] Devlin, J., Chang, M.W., Lee, K. and Toutanova, K. (2018) BERT: Pre-Training of Deep Bidirectional Transformers for Language Understanding.
[85] Brown, T.B., Mann, B., Ryder, N., et al. (2020) Language Models Are Few-Shot Learners. Advances in Neural Information Processing Systems, 33, 1877-1901.
[86] Dosovitskiy, A., Beyer, L., Kolesnikov, A., et al. (2020) An Image Is Worth 16x16 Words: Transformers for Image Recognition at Scale.
[87] Jumper, J., Evans, R., Pritzel, A., et al. (2021) Highly Accurate Protein Structure Prediction with AlphaFold. Nature, 596, Article 583589.
[88] Luo, D., Chen, Z., Hu, K., Zhao, Z., et al. (2021) Gauge Invariant and Anyonic Symmetric Transformer and RNN Quantum States for Quantum Lattice Models.
[89] Luo, D., Chen, Z., Carrasquilla, J. and Clark, B.K. (2022) Autoregressive Neural Network for Simulating Open Quantum Systems via a Probabilistic Formulation. Physical Review Letters, 128, Article 090501.
https://doi.org/10.1103/physrevlett.128.090501
[90] Cha, P., Ginsparg, P., Wu, F., Carrasquilla, J., McMahon, P.L. and Kim, E. (2021) Attention-Based Quantum Tomography. Machine Learning: Science and Technology, 3, 01LT01.
https://doi.org/10.1088/2632-2153/ac362b
[91] Carrasquilla, J., Luo, D., Pérez, F., Milsted, A., Clark, B.K., Volkovs, M., et al. (2021) Probabilistic Simulation of Quantum Circuits Using a Deep-Learning Architecture. Physical Review A, 104, Article 032610.
https://doi.org/10.1103/physreva.104.032610
[92] Abrams, D.S. and Lloyd, S. (1999) Quantum Algorithm Providing Exponential Speed Increase for Finding Eigenvalues and Eigenvectors. Physical Review Letters, 83, 5162-5165.
https://doi.org/10.1103/physrevlett.83.5162
[93] Aspuru-Guzik, A., Dutoi, A.D., Love, P.J. and Head-Gordon, M. (2005) Simulated Quantum Computation of Molecular Energies. Science, 309, 1704-1707.
https://doi.org/10.1126/science.1113479
[94] Kandala, A., Temme, K., Córcoles, A.D., Mezzacapo, A., Chow, J.M. and Gambetta, J.M. (2019) Error Mitigation Extends the Computational Reach of a Noisy Quantum Processor. Nature, 567, 491-495.
https://doi.org/10.1038/s41586-019-1040-7
[95] Higgott, O., Wang, D. and Brierley, S. (2019) Variational Quantum Computation of Excited States. Quantum, 3, 156.
https://doi.org/10.22331/q-2019-07-01-156
[96] McClean, J.R., Kimchi-Schwartz, M.E., Carter, J. and de Jong, W.A. (2017) Hybrid Quantum-Classical Hierarchy for Mitigation of Decoherence and Determination of Excited States. Physical Review A, 95, Article 042308.
https://doi.org/10.1103/physreva.95.042308
[97] Heya, K., Nakanishi, K.M., Mitarai, K. and Fujii, K. (2019) Subspace Variational Quantum Simulator.
[98] Nakanishi, K.M., Mitarai, K. and Fujii, K. (2019) Subspace-Search Variational Quantum Eigensolver for Excited States. Physical Review Research, 1, Article 033062.
https://doi.org/10.1103/physrevresearch.1.033062
[99] Parrish, R.M., Hohenstein, E.G., McMahon, P.L. and Martínez, T.J. (2019) Quantum Computation of Electronic Transitions Using a Variational Quantum Eigensolver. Physical Review Letters, 122, Article 230401.
https://doi.org/10.1103/physrevlett.122.230401
[100] Garcia-Saez, A. and Latorre, J. (2018) Addressing Hard Classical Problems with Adiabatically Assisted Variational Quantum Eigensolvers.
[101] Cerezo, M., Sharma, K., Arrasmith, A. and Coles, P.J. (2020) Variational Quantum State Eigensolver.
[102] Wang, D., Higgott, O. and Brierley, S. (2019) Accelerated Variational Quantum Eigensolver. Physical Review Letters, 122, Article 140504.
https://doi.org/10.1103/physrevlett.122.140504
[103] Wang, G., Koh, D.E., Johnson, P.D. and Cao, Y. (2021) Minimizing Estimation Runtime on Noisy Quantum Computers. PRX Quantum, 2, Article 010346.
https://doi.org/10.1103/prxquantum.2.010346
[104] Wang, G., Koh, D.E., Johnson, P.D. and Cao, Y. (2006) Bayesian Inference with Engineered Likelihood Functions for Robust Amplitude Estimation.
[105] Wang, Y. (2012) Quantum Computation and Quantum Information. Statistical Science, 27, 373-394.
https://doi.org/10.1214/11-sts378
[106] Li, Y. and Benjamin, S.C. (2017) Efficient Variational Quantum Simulator Incorporating Active Error Minimization. Physical Review X, 7, Article 021050.
https://doi.org/10.1103/physrevx.7.021050
[107] Yuan, X., Endo, S., Zhao, Q., Li, Y. and Benjamin, S.C. (2019) Theory of Variational Quantum Simulation. Quantum, 3, 191.
https://doi.org/10.22331/q-2019-10-07-191
[108] McArdle, S., Jones, T., Endo, S., Li, Y., Benjamin, S.C. and Yuan, X. (2019) Variational Ansatz-Based Quantum Simulation of Imaginary Time Evolution. NPJ Quantum Information, 5, Article No. 75.
https://doi.org/10.1038/s41534-019-0187-2
[109] Endo, S., Sun, J., Li, Y., Benjamin, S.C. and Yuan, X. (2020) Variational Quantum Simulation of General Processes. Physical Review Letters, 125, Article 010501.
https://doi.org/10.1103/physrevlett.125.010501
[110] Yao, Y., Gomes, N., Zhang, F., Wang, C., Ho, K., Iadecola, T., et al. (2021) Adaptive Variational Quantum Dynamics Simulations. PRX Quantum, 2, Article 030307.
https://doi.org/10.1103/prxquantum.2.030307
[111] Zhang, Z.J., Sun, J., Yuan, X. and Yung, M.H. (2020) Low-Depth Hamiltonian Simulation by Adaptive Product Formula.
[112] Cîrstoiu, C., Holmes, Z., Iosue, J., Cincio, L., Coles, P.J. and Sornborger, A. (2020) Variational Fast Forwarding for Quantum Simulation beyond the Coherence Time. npj Quantum Information, 6, Article No. 82.
https://doi.org/10.1038/s41534-020-00302-0
[113] Gibbs, J., Gili, K., Holmes, Z., Commeau, B., Arrasmith, A., Cincio, L., et al. (2022) Long-Time Simulations for Fixed Input States on Quantum Hardware. npj Quantum Information, 8, Article No. 135.
https://doi.org/10.1038/s41534-022-00625-0
[114] Khatri, S., LaRose, R., Poremba, A., Cincio, L., Sornborger, A.T. and Coles, P.J. (2019) Quantum-Assisted Quantum Compiling. Quantum, 3, 140.
https://doi.org/10.22331/q-2019-05-13-140
[115] Commeau, B., Cerezo, M., Holmes, Z., Cincio, L., et al. (2020) Variational Hamiltonian Diagonalization for Dynamical Quantum Simulation.
[116] Wecker, D., Hastings, M.B. and Troyer, M. (2015) Progress towards Practical Quantum Variational Algorithms. Physical Review A, 92, Article 042303.
https://doi.org/10.1103/physreva.92.042303
[117] Wiersema, R., Zhou, C., de Sereville, Y., Carrasquilla, J.F., Kim, Y.B. and Yuen, H. (2020) Exploring Entanglement and Optimization within the Hamiltonian Variational Ansatz. PRX Quantum, 1, Article 020319.
https://doi.org/10.1103/prxquantum.1.020319
[118] Ho, W.W. and Hsieh, T.H. (2019) Efficient Variational Simulation of Non-Trivial Quantum States. Sci Post Physics, 6, 10-19.
https://doi.org/10.21468/scipostphys.6.3.029
[119] Hamer, C.J., Weihong, Z. and Oitmaa, J. (1997) Series Expansions for the Massive Schwinger Model in Hamiltonian Lattice Theory. Physical Review D, 56, 55-67.
https://doi.org/10.1103/physrevd.56.55
[120] Bañuls, M.C., Cichy, K., Cirac, J.I. and Jansen, K. (2013) The Mass Spectrum of the Schwinger Model with Matrix Product States. Journal of High Energy Physics, 2013, Article No. 158.
https://doi.org/10.1007/jhep11(2013)158
[121] Cohen, T. and Welling, M. (2016) Group Equivariant Convolutional Networks.
[122] Zhang, Y. and Di Ventra, M. (2023) Transformer Quantum State: A Multipurpose Model for Quantum Many-Body Problems. Physical Review B, 107, Article 075147.
https://doi.org/10.1103/physrevb.107.075147

Copyright © 2025 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.