# The variational-relaxation algorithm for finding quantum bound states

**Authors:** Daniel V. Schroeder

arXiv: 1701.08934 · 2017-09-13

## TL;DR

This paper introduces a simple variational-relaxation algorithm for efficiently computing ground and excited states of 2D quantum systems with complex potentials, leveraging a relaxation method adapted from solving Poisson's equation.

## Contribution

It presents a novel, straightforward algorithm that extends relaxation techniques to quantum bound state problems, especially effective for nonseparable potentials in two dimensions.

## Key findings

- Efficiently finds quantum bound states in complex 2D systems.
- Applicable to nonseparable potentials where simpler methods fail.
- Minimal computation time for targeted states.

## Abstract

I describe a simple algorithm for numerically finding the ground state and low-lying excited states of a quantum system. The algorithm is an adaptation of the relaxation method for solving Poisson's equation, and is fundamentally based on the variational principle. It is especially useful for two-dimensional systems with nonseparable potentials, for which simpler techniques are inapplicable yet the computation time is minimal.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1701.08934/full.md

## Figures

4 figures with captions in the complete paper: https://tomesphere.com/paper/1701.08934/full.md

## References

28 references — full list in the complete paper: https://tomesphere.com/paper/1701.08934/full.md

---
Source: https://tomesphere.com/paper/1701.08934