pith. sign in

arxiv: quant-ph/0301121 · v3 · submitted 2003-01-23 · 🪐 quant-ph

Decoherence in quantum spin systems

classification 🪐 quant-ph
keywords quantumspindecoherencesystemsalgorithmsadvantageschebyshevcompare
0
0 comments X
read the original abstract

Computer simulations of decoherence in quantum spin systems require the solution of the time-dependent Schrodinger equation for interacting quantum spin systems over extended periods of time. We use exact diagonalization, Chebyshev polynomial technique, four Suzuki-formula algorithms, and the short-iterative-Lanczos method to solve a simple model for decoherence of a quantum spin system by an environment consisting of quantum spins, and compare advantages and limitations of different algorithms.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.