-
Notifications
You must be signed in to change notification settings - Fork 22
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
InfiniteITensorSum and MPO representations of local Hamiltonians #32
Comments
I was going to suggest that as an option based on our discussion in #31. We could always convert an However, I don't see why it would be impossible to represent long range interactions with an |
In the end, it would be best to directly use just a single MPO, so I think it is up to you. It sounds like you've made good progress on implementing the sum-of-local-terms approach, in which case I would vote for getting that working as generally as you can internally using an |
I think it is indeed the best. The MPO method is quite tricky to implement. |
For the case I am interested in (FQHE-like Hamiltonians), the local Hamiltonian can be very long range (approximately 15-20 sites would be good to reach). Writing the full local Hamiltonian is therefore impossible.
Instead, it is possible to write a finite MPO representation of the local Hamiltonian. It is not currently possible with the current definition of the InfiniteITensorSum.
Proposition: would a InfiniteMPOSum class interesting to anyone else? Essentially identical to the InfiniteITensorSum, except it has a Cell of MPOs instead of ITensors.
It probably only requires one or two days of work to interface all the code.
Drawback: quite a lot of code repeat. Another possibility is: an abstract class AbstractInfiniteITensorSum which is inherited by both, and a few definitions of functions (for left environment typically) which would be class dependent.
Of course, this problem could be moot: it might be more efficient to directly go with a full MPO representation of the Hamiltonian.
The text was updated successfully, but these errors were encountered: