Quantum Simulation/Quantum Monte-Carlo
We have seen in the previous chapter that exact diagonalization is an impossible task for more than a few particles. In quantum Monte-Carlo simulations, the goal is to avoid considering the full Hilbert space, but randomly sample the most relevant degrees of freedom and try to extract the quantities of interest such as the magnetization by averaging over a stochastic process. To pursue this goal, we first need to establish a framework in which we can interpet quantum-mechanical observables in terms of (classical) probabilities. This process is called a "quantum-classical mapping" and allows us to reformulate quantum many-body problems in terms of models from classical statistical mechanic, albeit in higher dimensions.
Suppose we wish to calculate the partition function of the transverse Ising model, as knowledge of the partition function allows us to calculate all thermodynamic quanties that may be of interest. Specifically, we have
where in the last line we have used the Suzuki-Trotter expansion
which can be proved using the Baker-Campbell-Hausdorff formula. Using the same expansion, we can replace the exponential of the product by a product of the exponentials, i.e.,
The exponentiation to the power of can be written as a product, and we can insert identity operators according to
Let us now look more closely at the product involving the spin-flip operators , where we will encounter terms of the form
The crucial part of the quantum-classical mapping is to interpret the partition function of the one-dimensional chain containing spins as the partition function of a corresponding two-dimensional spin model containing spin . In this interpretation, we can rewrite the spin-flip operators in terms of an Ising interaction in the direction (plus a constant energy shift),
We now want to cast these terms back into an exponential form,
where we find for the coefficents and
We can now insert this expression back into the partition function Eq.(1) and carry out the multiplications. The boundary conditions for the Ising interaction along the direction are fixed by the final trace operation; as the trace is implemented by multiplying from the left and from the right, we have periodic boundary conditions. In total, we obtain
The constant prefactor in the partition function is irrelevant as it will drop out when calculating thermodynamic observables. Consequently, we can identify a corresponding two-dimensional classical Ising model with anisotropic interactions which reproduces the same thermodynamics as the one-dimensional quantum Ising model in a transverse field. The Hamiltonian for the classical model is given by
Note, however, that the classical temperature is different from the quantum temperature . Nevertheless, we can now proceed to calculate the thermodynamic properties of the quantum model by performing classical Monte-Carlo simulations.
When trying to evaluate thermodynamic observables for a classical spin model, we still find ourselves in considerable difficulties as also the classical configuration space grows exponentially with system size. However, we are not really interested in a solution that incorporates all microscopic details, but rather we want to obtain information about macroscopic observables. So, we will be fine with any microscopic description of the model of interest, as long as it gets the macroscopic statistics right. Here, the goal is to find a microscopic description which can be efficiently (i.e., using resources that only grow polynomially with system size) implemented on a computer.
The most famous method for the Monte-Carlo simulation of statistical mechanics models is the Metropolis algorithm . Let us first state the basic steps of the algorithm for the Ising model and then analyze it in more detail.
- Pick an arbitrary initial state (e.g., all spins polarized) and compute its energy .
- Flip a random spin and calculate the energy of the new configuration
- If , always accept the new configuration.
- If , accept the new configuration with probability .
- Continue at step 2 until the macroscopic observables (averaged over a fixed number of steps) are equilibrated.
To evaluate the algorithm, let us consider two configurations and with energies and ,respectively. The probalities for these configurations are denoted by , and . Let us assume that , so the transition probability satisfy and for the inverse process. In equilibrium, the system will satisfy detailed balance (absence of currents), i.e,
which reproduces the Boltzmann distribution and thus gives rise to the correct thermodynamic behavior. The convergence of the Metropolis algorithm can be improved by also including unphysical processes that flip a large domain of spins at once (so-called "cluster updates") , as constructing these processes from individual spin flips will consume a lot of time. Fig. 1 shows results of Monte-Carlo simulations for two different values of for the isotropic two-dimensional Ising model.
From classical to quantum phase transitions
Let us now come back to the anisotropic Ising model that we obtained using the quantum-classical mapping. If we play around with and , we find that the phase transition between the paramagnet and the ferromagnet occurs on a critical line that is given by
where is the critical inverse temperature . Remarkably, the condition at a fixed classical temperature means that the corresponding quantum phase transition takes place at , i.e., at zero temperature. At finite temperature, the extension in the direction will be finite and the classical model belongs to the universality class of the one-dimensional Ising model, which does not exhibit a phase transition. If we substitute the definitions for the coupling constants into the equation for the critical line, we obtain
which immediately gives us the critical transverse field , in agreement with the exact solution of the quantum model. From our knowledge of the classical 2D Ising model, we can also immediate extract the scaling of observables close to the critical point, e.g., for the magnetization
as the critical exponents for the 1D quantum model are identical to the ones of the classical 2D model.
The sign problem
While quantum Monte-Carlo methods are indeed very powerful for tackling a large variety of many-body problems, they are also constrained by inherent limitations. One possible problem we can run into is that the partition function of the classical model cannot be computed efficiently. For example, consider the classical Hamiltonian
on a three-dimensional cubic lattice, where the nearest-neighbor interactions are randomly chosen from the values . This model exhibits glassy behavior and finding its ground state is known to be NP-complete , i.e., it is widely believed that there is no efficient way to simulate this model. On the other hand, we can safely assume that precisely due to the glassy properties that makes the model hard to study, the ground state is irrelevant as a physical state as the system will take exponentially long to reach it even if we put it into heat bath at zero temperature. A more subtle issue can arise as the result of the quantum-classical mapping, which is known as the "sign problem".
To be explicit, let us assume that during our quantum-classical mapping procedure, we encounter the following term in the Hamiltonian:
where we have used the spin-flip operators and . Within the quantum-classical mapping, we will encounter terms of the form
The constant term and the Ising interaction are unproblematic and can be cast into the classical partition function as in the case of the transverse Ising model. Whether we can do the same for the spin-flip term (which will ultimately result in a four-body interaction for the classical Ising spins), depends on the sign of . For the ferromagnetic case, , the coefficient will be positive and we can turn this interaction into a term of the form with being positive so the interpretation in terms of a classical partition function remains valid. On the other hand, for an antiferromagnetic interaction with , we find to be negative and therefore we do not obtain the equivalent of a classical partition function. In some cases, we can work around this by using a unitary transformation that maps onto a model that does not exhibit this problem. For instance on a bipartite lattice, we can fix this problem by flipping spins on one of the sublattices by transforming , turning the antiferromagnetic interaction into a ferromagnetic one. However, this does not work in general, nevertheless there is still a way to perform classical Monte-Carlo sampling. When sampling over our classical configuration space, the problematic contributions correspond to negative probabilities, i.e., when we compute the value of an observable ,
we find some of the to be negative. This can be resolved by taking the absolute value of these probabilities and dividing by the expectation value of the sign, i.e.,
However, this modification comes at a hefty price: as the uncertainty of the denominator will typically increase exponentially with the size of the system , we will no longer have an efficient algorithm.
Despite these difficulties, it may sometimes still be more favorable to perform Monte-Carlo simulation than performing exact diagonalization, but this certainly depends on details of the model at hand. Finally, the sign problem is not limited to models of the type outlined above. As a rough guidance, frustrated spin models and fermionic models tend to have a sign problem, while bosonic models tend to be free of it.
- Batrouni, G.G; Scalettar, R. T. (2011-05-05). "Quantum phase transitions". In Christian Miniatura, Leong-Chuan Kwek, Martial Ducloy, Benoît Grémaud, Berthold-Georg Englert, Leticia Cugliandolo, Artur Ekert, and Kok Khoo Phua (eds.). Ultracold Gases and Quantum Information. Oxford University Press. ISBN 9780199603657. Retrieved 2013-04-09.CS1 maint: Uses editors parameter (link)
- Metropolis, Nicholas; Arianna W. Rosenbluth, Marshall N. Rosenbluth, Augusta H. Teller, Edward Teller (1953-06-01). "Equation of State Calculations by Fast Computing Machines". The Journal of Chemical Physics 21 (6): 1087-1092. doi:doi:10.1063/1.1699114. ISSN 00219606. http://jcp.aip.org/resource/1/jcpsa6/v21/i6/p1087_s1. Retrieved 2013-04-11.
- Krauth, Werner (2004). "Cluster Monte Carlo algorithms". In Alexander K Hartmann and Heiko Rieger (ed.). New optimization algorithms in physics. Weinheim; Chichester: Wiley-VCH ; John Wiley. ISBN 3527404066 9783527404063 Check
|isbn=value: length (help).CS1 maint: Uses editors parameter (link)
- Barahona, F. (1982-10-01). "On the computational complexity of Ising spin glass models". Journal of Physics A: Mathematical and General 15 (10): 3241. doi:10.1088/0305-4470/15/10/028. ISSN 0305-4470. http://iopscience.iop.org/0305-4470/15/10/028. Retrieved 2013-04-16.
- Troyer, Matthias; Uwe-Jens Wiese (2005-05-04). "Computational Complexity and Fundamental Limitations to Fermionic Quantum Monte Carlo Simulations". Physical Review Letters 94 (17): 170201. doi:10.1103/PhysRevLett.94.170201. http://link.aps.org/doi/10.1103/PhysRevLett.94.170201. Retrieved 2013-04-16.