2013
DOI: 10.15407/ujpe58.07.0657
|View full text |Cite
|
Sign up to set email alerts
|

Efficient MPS Algorithm for Periodic Boundary Conditions and Applications Section: Solid matter Original Author's Text: English Abstract: We present the implementation of an efficient algorithm for the calculation of the spectrum of one-dimensional quantum systems with periodic boundary conditions. This algorithm is based on a matrix product representation for quantum states (MPS) and a similar representation for Hamiltonians and other operators (MPO). It is significantly more efficient for systems of abou

Abstract: We present an implementation of an efficient algorithm for the calculation of the spectrum of one-dimensional quantum systems with periodic boundary conditions. This algorithm is based on a matrix product representation for quantum states (MPS), and a similar representation for Hamiltonians and other operators (MPO). It is significantly more efficient for systems of about 100 sites and more than for small quantum systems. We apply the formalism to calculate the ground state and first excited state of a spin-1 … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(3 citation statements)
references
References 8 publications
0
3
0
Order By: Relevance
“…An MPS formalism for PBC was originally proposed in [52] and extended in [21,53]. We summarized the algorithm in [54,55], and therefore we only briefly review here those aspects which are relevant for the present discussion.…”
Section: Review: the Mps Formalism For Pbcmentioning
confidence: 99%
“…An MPS formalism for PBC was originally proposed in [52] and extended in [21,53]. We summarized the algorithm in [54,55], and therefore we only briefly review here those aspects which are relevant for the present discussion.…”
Section: Review: the Mps Formalism For Pbcmentioning
confidence: 99%
“…Due to this reason, the usual approach of DMRG-MPS does not work efficiently for PBC, because the dimension of the local matrices is quite big due to long-range spin interactions. In this context, there is another approach based on the transfer-matrix [7][8][9] which has tackled the problem of dealing with PBC with encouraging results. In this paper, we will particularly talk about Hamiltonians of one-dimensional spin chain models with PBC and we will give a generalized universal approach of decomposing a Hamiltonian into MPOs, later these will be used in the DMRG algorithm to validate our results.…”
Section: Introductionmentioning
confidence: 99%
“…It is the purpose of the present paper to address this discrepancy using variants of both methods in parallel. To this end we determine both the spectrum as well as the order parameter at θ = − π 2 as a function of the Zeeman coupling D. Calculations will be performed for systems with periodic boundary conditions (spin rings) using our own matrix product state (MPS) algorithm for systems up to 100 sites [6][7][8].…”
Section: Introductionmentioning
confidence: 99%