Skip to content
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

Wish list for alternating_update #115

Open
13 tasks
mtfishman opened this issue Nov 8, 2023 · 0 comments
Open
13 tasks

Wish list for alternating_update #115

mtfishman opened this issue Nov 8, 2023 · 0 comments

Comments

@mtfishman
Copy link
Member

mtfishman commented Nov 8, 2023

Algorithms we want to be able to implement with the alternating_update and BP code:

  • TNS addition (direct sum, density matrix, fitting, gauging)
  • TNS contraction (density matrix, fitting, gauging)
  • TNS compression (density matrix, fitting, gauging)
  • TNS eigensolving
  • TNS linear solving
  • TNS evolution with TDVP and gates
  • TNS METTS
  • TCI
  • Quantics optima
  • Non-quadratic optimization
  • Infinite TNS
  • Subspace expansion
  • Parallelization over regions

An initial goal will be to either implement these, or make it easy to implement these, through callback functions or function overloading, and have them work for MPS, TTN, and general tensor networks (at first using the BP approximation though allow an interface for customizing that). See also #112.

@emstoudenmire @JoeyT1994

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant