Quantum Simulation/Density-Matrix Renormalization Group
Resource type: this resource contains a lecture or lecture notes. |
Variational method[edit | edit source]
While quantum Monte-Carlo methods provide very useful tools to study many-body systems, we have seen that the sign problem constitutes a significant challenge. In addition, the required quantum-classical mapping makes it difficult to implement direct computer algorithms taking only the Hamiltonian as their input. On the other hand, there is a conceptually simple but quite powerful method to approximate the ground state of arbitrary quantum systems which is known as the variational method. In a nutshell, one writes down an ansatz for the ground state as a trial wave function, which contains one or more variational parameters that are chosen such that the minimize the energy of the system.
As a specific example, let us study the Hamiltonian for the Helium atom,
where we have used atomic units, denotes the charge of the nucleus, and the positions and momenta satisfy the usual commutation relations for the components . Physically speaking, it makes sense that the interaction between the electrons shield the Coulomb potential of the nucleus, so we use as an ansatz a product wave function of the form given in position space by ^{[1]}
where the variational parameter accounts for the shielding of the core. Computing the expectation value of the Hamiltonian with respect to this trial wave function yields
This function has a minimum at the effective charge and leads to a ground state energy of , which is within 2% accuracy of the experimentally measured value of ^{[2]}.
Reduced density matrices[edit | edit source]
As the name implies, the Density-Matrix Renormalization Group (DMRG) method does not operate on pure quantum states, but on density matrices, which were originally discussed in the context of open quantum systems. Generally, we can think of a system decribed by a density matrix as a statistical mixture of pure quantum states , i.e.,
where can be interpreted as the probability to find the system in the pure quantum state . Density matrices have unit trace and are positive-semidefinite, and their time evolution is governed by the von Neumann equation,
Density matrices play an important role when looking at a smaller subsystem embedded in an environment. Consider a bipartite system composed of the subsystems and , with pure states being represented by
Then, we can define the reduced density matrix of as the partial trace over , given by
The DMRG algorithm[edit | edit source]
The key element of DMRG is to think of the many-body system of interest being composed of a system of size , attached to an environment of the size. Suppose we have already found a set of states , which allows us to give a good approximation to both the Hamiltonian and its ground state for this particular system size. Then, we can increase the system size to by the following procedure ^{[3]}:
- Form a new system of size by combining the states describing the system with the full Hilbert space describing the additional site. For spin , we have a new set of states according to .
- Build a superblock of size by combining the enlarged system with the enlarged environment. The Hilbert space of this dimension will be in the case of spins. If the Hamiltonian is reflection symmetric (i.e, left and right are identical), the basis states for the system and the environment will be the same.
- Find the ground state of the Hamiltonian of this superblock by exact diagonalization.
- Compute the reduced density matrix for the enlarged system
- .
- Diagonalize the reduced density matrix and keep only the eigenvectors corresponding to the largest eigenvalues. This set of states will serve as the input for the next iteration step.
- Express the Hamiltonian for system size in this new basis.
- Continue this iteration until sufficient convergence of observables (e.g, of the ground state energy) is obtained.
This procedure is commonly referred to as "infinite-system DMRG" ^{[3]}. In practice, one can often achieve significantly better results by accounting for finite size effects. This can be done in a relatively straightforward way by keeping track of the system and the environment separately. Once the infinite-system algorithm has reached the desired size, one can successively increase the system at the expense of the environment. When the environment reaches a minimum size, the procedure is reversed and the environment is increased at the expense of the system. Multiple sweeps of this kind can be performed until the ground state energy has converged to an even better value. During each step, we can also use the estimate for the ground state obtained during the previous step as the initial state of our exact diagonalization procedure, which will result in a drastically improved performance ^{[3]}. In general, the error of the DMRG procedure will be given by the truncation error , which is the weight of all the states that have been dropped during the DMRG step. Typical values are for .
As in the case of exact diagonalization, DMRG is not restricted to ground states, but due to the constraints imposed by the convergence of the exact diagonalization step, it works best for low-energy eigenvalues. It is also possible to compute the time evolution of a many-body system using DMRG, for instance by combining it with the Runge-Kutta scheme for the numerical integration of ordinary differential equations ^{[4]}. This is done by using the DMRG procedure to converge towards four different target states,
The state at the time then follows from ^{[5]}
Matrix product states[edit | edit source]
To understand the success of DMRG, it is instructive to look at the set of states that can be created using this method. It turns out that these are given by so-called "matrix product states" of the form
where is a matrix associated with every site and the corresponding basis vector . For translational invariant systems, the matrix elements will be identical for all sites, but each matrix will still act on its own (auxiliary) Hilbert space, i.e., we can express each as
for some orthonormal basis . During each DMRG step, we perform basis transforms of the form
which tell us how to go from the block of size to size by including an additional site, with for spin ^{[3]}. Applying this construction recursively, we see that the basis states obtained within DMRG indeed belong to the class of matrix product states. The variational character of the DMRG algorithm becomes apparent when we consider the state of a superblock,
where forms the largest block that can be solved exactly, i.e, . Then, we can interpret the coefficients as the variational parameters according to which the energy is being minimized. Further information about the relationship between DMRG and matrix product states can be found in a more recent review article ^{[6]}.
Entanglement and the area law[edit | edit source]
Having seen that DMRG implements a variational method based upon matrix product states, it is important to pose the question how generic these states will be in terms of ground states of many-body Hamiltonians. A key concept in answering this question is entanglement, i.e., nonclassical correlations between different parts of the system. Consider the two-spin state
which can be represented by the density matrix
As can be seen from the diagonal elements, this state possesses classical correlations, but its off-diagonal contributions are what is crucial here. It is instructive to look at the reduced density matrix of a single spin,
This state is proportional to the identity, so it is invariant under all unitary transformations, i.e., . Consequently, despite the two-spin state being pure, its local density matrix of a single spin is completely random and does not carry any information at all!
We can quantify this behavior using the von Neumann entropy, defined as
which vanishes for pure states and reaches its maximum , with being the Hilbert space dimension, for the "maximally mixed state",
which for a single spin is precisely the state we have obtained above. The von Neumann entropy is invariant under unitary transformations and therefore does not change under Hamiltonian dynamics. Additionally, it is subadditive with respect to its subsystems, i.e.,
where and are the density matrices of the individual subsystems and ^{[7]}. Consequently, by looking only at parts of the full system, we can only obtain partial information, as seen in the example above. Remarkably, for pure states of the full system, the entropies and are identical. This can be seen by looking at the Schmidt decomposition ^{[8]} of the wave function of the full system,
which results in the reduced matrices
As the coefficients are identical for both subsystems, the reduced density matrices have the same nonzero eigenvalues and therefore the same entropy. Therefore, we can define an "entanglement entropy" for any pure state simply as the entropy of the reduced density matrix . In general, the entanglement entropy will depend on the choice of the subsystems, however, we are mostly interested in the partitioning that maximizes the entanglement entropy. For translationally invariant systems, this is achieved simply by cutting the system in half.
Coming back to the question on the usefulness of DMRG, we take a look at the entanglement entropy of matrix product states. As the states are encoded in terms of a matrix, the entanglement entropy of matrix product states satisfies the relation
which does not change with the size of the subsystem. So how does this figure compare to typical ground states of many-body systems? For gapped one-dimensional systems with local interactions, it can be shown that the entanglement entropy of the ground state is constant, which can be understood as a consequence of a finite speed of information transfer ^{[9]}. Consequently, for this large class of systems, DMRG can be expected to produce accurate results. Furthermore, for critical (gapless) models or models with strong disorder, one typically finds a logarithmic divergence of the entanglement entropy with system size, which still allows for an efficient simulation with DMRG ^{[9]}. On the other hand, in higher-dimensional systems, the entanglement entropy typically satisfies a relation of the form
- ,
where is the surface area of the subsystem ^{[9]}. Thus, the constant scaling of the entanglement entropy in one-dimensional systems can be seen as the surface area being constant in this case. The consequences of this "area law" of the entanglement entropy for DMRG are disastrous: we cannot expect DMRG to be a useful method for anything beyond one-dimensional systems. While there have been various approaches to extend DMRG-style methods to higher dimensions, their success has been fairly limited.
References[edit | edit source]
- ↑ Schwabl, Franz (2010). Quantum mechanics. Berlin, Germany: Springer. ISBN 9783642091070.
- ↑ Sansonetti, J. E.; W. C. Martin (2005-09-28). "Handbook of Basic Atomic Spectroscopic Data". Journal of Physical and Chemical Reference Data 34 (4): 1559-2259. doi:doi:10.1063/1.1800011. ISSN 00472689. http://www.nist.gov/pml/data/handbook/index.cfm. Retrieved 2013-04-18.
- ↑ ^{3.0} ^{3.1} ^{3.2} ^{3.3} Schollwöck, U. (2005-04-26). "The density-matrix renormalization group". Reviews of Modern Physics 77 (1): 259-315. doi:10.1103/RevModPhys.77.259. http://link.aps.org/doi/10.1103/RevModPhys.77.259. Retrieved 2013-04-24.
- ↑ Feiguin, Adrian E.; Steven R. White (2005-07-18). "Time-step targeting methods for real-time dynamics using the density matrix renormalization group". Physical Review B 72 (2): 020404. doi:10.1103/PhysRevB.72.020404. http://link.aps.org/doi/10.1103/PhysRevB.72.020404. Retrieved 2013-04-24.
- ↑ Press, William H; Teukolsky, Saul A; Vetterling, William T; Flannery, Brian P (1992). Numerical recipes in C Book, C version / William H. Press. Cambridge: Cambridge Univ. Pr. ISBN 9780521431088.
- ↑ Schollwöck, Ulrich (2011-01). "The density-matrix renormalization group in the age of matrix product states". Annals of Physics 326 (1): 96-192. doi:10.1016/j.aop.2010.09.012. ISSN 0003-4916. http://www.sciencedirect.com/science/article/pii/S0003491610001752. Retrieved 2013-04-25.
- ↑ Araki, Huzihiro; Elliott H. Lieb (1970). "Entropy inequalities". Communications in Mathematical Physics (1965-1997) 18 (2): 160-170. ISSN 1432-0916 0010-3616, 1432-0916. http://projecteuclid.org/euclid.cmp/1103842506. Retrieved 2013-05-02.
- ↑ Nielsen, Michael A; Chuang, Isaac L (2010). Quantum computation and quantum information. Cambridge, UK: Cambridge University Press. ISBN 9781107002173.
- ↑ ^{9.0} ^{9.1} ^{9.2} Eisert, J.; M. Cramer, M. B. Plenio (2010-02-04). "Colloquium: Area laws for the entanglement entropy". Reviews of Modern Physics 82 (1): 277-306. doi:10.1103/RevModPhys.82.277. http://link.aps.org/doi/10.1103/RevModPhys.82.277. Retrieved 2013-05-02.