Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Adaptive Grid Refinement for a Model of Two Confined and Interacting Atoms

Published

Author(s)

William F. Mitchell, Eite Tiesinga

Abstract

We have applied adaptive grid refinement to solve a two-dimensional Schroedinger equation in order to study the feasibility of a quantum computer based on extremely-cold neutral alkali-metal atoms. Qubits are implemented as motional states of an atom trapped in a single well of an optical lattice of counter-propagating laser beams. Quantum gates are constructed by bringing two atoms together in a single well leaving the interaction between the atoms to cause entanglement. For special geometries of the optical lattices and thus shape of the wells, quantifying the entanglement reduces to solving for selected eigenfunctions of a Schroedinger equation that contains a two-dimensional Laplacian, a trapping potential that describes the optical well, and a short-ranged interaction potential. The desired eigenfunctions correspond to eigenvalues that are deep in the interior of the spectrum where the trapping potential becomes significant. The spatial range of the interaction potential is three orders of magnitude smaller than the spatial range of the trapping potential, necessitating the use of adaptive grid refinement.
Citation
Applied Numerical Mathematics
Volume
52
Issue
2-3

Keywords

adaptive grid refinement, elliptic eigenvalue problems, quantum computing, Schroediner's equation

Citation

Mitchell, W. and Tiesinga, E. (2005), Adaptive Grid Refinement for a Model of Two Confined and Interacting Atoms, Applied Numerical Mathematics, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=150876 (Accessed February 25, 2024)
Created February 1, 2005, Updated June 2, 2021