A Strictly Single-Site DMRG Algorithm with Subspace Expansion
arXiv:1501.05504 · doi:10.1103/PhysRevB.91.155115
Abstract
We introduce a strictly single-site DMRG algorithm based on the subspace expansion of the Alternating Minimal Energy (AMEn) method. The proposed new MPS basis enrichment method is sufficient to avoid local minima during the optimisation, similarly to the density matrix perturbation method, but computationally cheaper. Each application of to in the central eigensolver is reduced in cost for a speed-up of , with the physical site dimension. Further speed-ups result from cheaper auxiliary calculations and an often greatly improved convergence behaviour. Runtime to convergence improves by up to a factor of 2.5 on the Fermi-Hubbard model compared to the previous single-site method and by up to a factor of 3.9 compared to two-site DMRG. The method is compatible with real-space parallelisation and non-abelian symmetries.
9 pages, 6 figures; added comparison with two-site DMRG
References in corpus (4)
Cited by in corpus (11)
- Generic Construction of Efficient Matrix Product Operators
- Time Dependent Variational Principle with Ancillary Krylov Subspace
- Plaquette versus ordinary -wave pairing in the -Hubbard model on a width 4 cylinder
- Error estimates for extrapolations with matrix-product states
- Charge-density-wave melting in the one-dimensional Holstein model
- Ultrafast ab-initio Quantum Chemistry Using Matrix Product States
- Bosonic Pfaffian State in the Hofstadter-Bose-Hubbard Model
- Many-body localization of spinless fermions with attractive interactions in one dimension
- Probabilistic low-rank factorization accelerates tensor network simulations of critical quantum many-body ground states
- Tensor-network approach to thermalization in open quantum many-body systems
- Phase diagram of the Kondo model on the zigzag ladder