Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Computational studies of quantum spin systems

Ling Wang

Published Jan 1, 2010• 0 citations
OpenAlex

Related papers

Two New Methods for Computing Finite Quantum Spin Systems

T. Oguchi, Hidetsugu Kitatani

Springer series in solid-state sciences•Jan 1, 1987•0 citations

Numerical Study of Quantum Spin Systems

Makoto Kaburagi, Takashi Tonegawa, T. Nishino

Springer proceedings in physics•Jan 1, 1992•5 citations

Decoherence in Quantum Spin Systems

Hans A. De Raedt, V. V. Dobrovitski

Abstract. Computer simulations of decoherence in quantum spin systems require the solution of the time-dependent Schrödinger equation for interacting quantum spin systems over extended periods of time. We use exact diagonalization, Chebyshev polynomial technique, four Suzukiformula 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. 1

•Jan 1, 2003•0 citations

Numerical Methods for Quantum Spin Systems

M. S. Makivić

Springer proceedings in physics•Jan 1, 1992•1 citation

Decoherence in quantum spin systems

Hans A. De Raedt, V. V. Dobrovitski

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.

arXiv:quant-ph/0301121•Jan 23, 2003•4 citations

基于量子自旋的分布式量子计算算法

Jincheng Zhang

This paper introduces a novel distributed quantum computing algorithm based on the inherent adaptability of quantum spin systems. We propose a 'Quantum Spin Distributed' algorithm that leverages quantum spin's adaptive properties to enable self-learning and optimization of quantum computers. This approach offers a paradigm shift in computational efficiency, addressing limitations of existing algorithms through a dynamically adjusted quantum state. The core mechanism centers around constructing a 'Quantum Spin Distributed' system, which uses the self-adaptive nature of quantum spin to improve the performance of quantum computations. We detail the algorithm's design, its advantages, and potential applications in diverse quantum computing tasks.

•Sep 6, 2026•0 citations
Abstract. Computer simulations of decoherence in quantum spin systems require the solution of the time-dependent Schrödinger equation for interacting quantum spin systems over extended periods of time. We use exact diagonalization, Chebyshev polynomial technique, four Suzukiformula 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. 1
This paper introduces a novel distributed quantum computing algorithm based on the inherent adaptability of quantum spin systems. We propose a 'Quantum Spin Distributed' algorithm that leverages quantum spin's adaptive properties to enable self-learning and optimization of quantum computers. This approach offers a paradigm shift in computational efficiency, addressing limitations of existing algorithms through a dynamically adjusted quantum state. The core mechanism centers around constructing a 'Quantum Spin Distributed' system, which uses the self-adaptive nature of quantum spin to improve the performance of quantum computations. We detail the algorithm's design, its advantages, and potential applications in diverse quantum computing tasks.