Quick Navigation
Topics
Quantum Simulation
Quantum Thermodynamics
Hybrid infinite time-evolving block decimation algorithm for long-range multi-dimensional quantum many-body systems
arXiv
Authors: Tomohiro Hashizume, Jad C. Halimeh, Ian P. McCulloch
Year
2019
Paper ID
15337
Status
Preprint
Abstract Read
~2 min
Abstract Words
172
Citations
N/A
Abstract
In recent years, the infinite time-evolution block decimation (iTEBD) method has been demonstrated to be one of the most efficient and powerful numerical schemes for time-evolution in one-dimensional quantum many-body systems. However, a major shortcoming of the method, along with other state-of-the-art algorithms for many-body dynamics, has been their restriction to one spatial dimension. We present an algorithm based on a hybrid extension of iTEBD where finite blocks of a chain are first locally time-evolved before an iTEBD-like method combines these processes globally. This in turn permits simulating the dynamics of many-body systems in the thermodynamic limit in dgeq1 dimensions including in the presence of long-range interactions. Our work paves the way for simulating the dynamics of many-body phenomena that occur exclusively in higher dimensions, and whose numerical treatments have hitherto been limited to exact diagonalization of small systems, which fundamentally limits a proper investigation of dynamical criticality. We expect the algorithm presented here to be of significant importance to validating and guiding investigations in state-of-the-art ion-trap and ultracold-atom experiments.
Why This Paper Matters
- This paper contributes to the Quantum Simulation research area in the Quantum Articles archive.
- It adds a 2019 reference point for readers tracking recent quantum research.
- In recent years, the infinite time-evolution block decimation (iTEBD) method has been demonstrated to be one of the most efficient and powerful numerical schemes for...
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.