pith. sign in

arxiv: quant-ph/0301130 · v1 · submitted 2003-01-23 · 🪐 quant-ph

An efficient scheme for numerical simulations of the spin-bath decoherence

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

We demonstrate that the Chebyshev expansion method is a very efficient numerical tool for studying spin-bath decoherence of quantum systems. We consider two typical problems arising in studying decoherence of quantum systems consisting of few coupled spins: (i) determining the pointer states of the system, and (ii) determining the temporal decay of quantum oscillations. As our results demonstrate, for determining the pointer states, the Chebyshev-based scheme is at least a factor of 8 faster than existing algorithms based on the Suzuki-Trotter decomposition. For the problems of second type, the Chebyshev-based approach has been 3--4 times faster than the Suzuki-Trotter-based schemes. This conclusion holds qualitatively for a wide spectrum of systems, with different spin baths and different Hamiltonians.

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.