scholarly journals Simulating strongly correlated quantum systems with tree tensor networks

2010 ◽  
Vol 82 (20) ◽  
Author(s):  
V. Murg ◽  
F. Verstraete ◽  
Ö. Legeza ◽  
R. M. Noack
1994 ◽  
Vol 05 (06) ◽  
pp. 987-995 ◽  
Author(s):  
S.V. MESHKOV ◽  
D.V. BERKOV

The fast algorithm of the Maximum Entropy (MaxEnt) numerical solution of the linear inverse problem is described. The minimization of a general functional intrinsic to the MaxEnt approach is reduced to an iteration procedure with each step being a constrained least-squares problem (minimization of a quadratic functional with linear inequality constraints). The algorithm is structurally simple and can be assembled from blocks available in standard program libraries. The algorithm is tested on “toy” tasks with exponential kernel, as well as on practical problems of the recovery of the spectral density of strongly correlated quantum systems from the imaginary time Green’s functions obtained by Monte Carlo.


2009 ◽  
Vol 79 (3) ◽  
Author(s):  
Frank Verstraete ◽  
J. Ignacio Cirac ◽  
José I. Latorre

2020 ◽  
Vol 9 (3) ◽  
Author(s):  
Matthias Christandl ◽  
Angelo Lucia ◽  
Peter Vrana ◽  
Albert H. Werner

Tensor networks provide descriptions of strongly correlated quantum systems based on an underlying entanglement structure given by a graph of entangled states along the edges that identify the indices of the local tensors to be contracted. Considering a more general setting, where entangled states on edges are replaced by multipartite entangled states on faces, allows us to employ the geometric properties of multipartite entanglement in order to obtain representations in terms of superpositions of tensor network states with smaller effective dimension, leading to computational savings.


2013 ◽  
Vol 87 (23) ◽  
Author(s):  
J. J. Mendoza-Arenas ◽  
T. Grujic ◽  
D. Jaksch ◽  
S. R. Clark

Sign in / Sign up

Export Citation Format

Share Document