Jump to content

Variational method (quantum mechanics)

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 128.175.112.3 (talk) at 18:42, 17 January 2005 (stub). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In quantum mechanics, the variational method is one way of finding approximations for the lowest energy eigenstate.

Suppose we're given a Hilbert space and a Hermitian operator over it, called the Hamiltonian H.

Ignoring complications about continuous spectra, we look at the spectrum of H and the corresponding eigenspaces for each eigenvalue.

So,

The completeness relation.

"Physical" states are normalized, meaning their norm is 1. (once again, we ignore complications involving a continuous spectrum)

Suppose the spectrum of H is bounded from below and its greatest lower bound is E0.

Suppose we have such a state |ψ>. Let's look at the expectation value of H.

Obviously, if we were to vary over all possible states with norm 1 trying to minimize the expectation value of H, the lowest value would be E0 and the corresponding state would be an eigenstate of E0.

But varying over the entire Hilbert space is often too complicated for physical calculations. So, let's look at a subspace of the entire Hilbert space, parametrized by some (real) differentiable parameters α. The choice of the subspace is called the ansatz. Some choices of ansatzes lead to better approximations than others, so it's important to choose the ansatz carefully.

Let's assume there is some overlap between the ansatz and the ground state. Otherwise, it's simply a bad ansatz. We still wish to normalize the ansatz, so we have the constraints

We wish to minimize

subject to the constraint above.

Using the method of Lagrange multipliers,

where λ is the Lagrange multiplier. Of course, this only gives the stationary points and we still have to check if we have the global minimum.

The lowest expectation value we get is an upper bound to E0. Better ansatzes give better bounds.