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

t-J-U-V model #132

Closed
wants to merge 21 commits into from
Closed

t-J-U-V model #132

wants to merge 21 commits into from

Conversation

giovanni-br
Copy link
Collaborator

Draft of implementation of t-J-U-V model

Copy link
Collaborator

@RichRick1 RichRick1 left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Great job! We need to make sure that only one type of connectivity is provided. If user provides connectivity as list of tuples, we should build adjacency matrix and then use it to populate "heisenberg" part of the hamiltonian

Comment on lines 716 to 717
connectivity_ppp: Union[list, np.ndarray],
connectivity_heisenberg: np.ndarray,
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I think there is only one type of connectivity that needs to be provided. If connectivity is given as list of tuples, adjacency matrix needs to be build first. Once build, it can be used to populate "Heisenberg" part

@RichRick1
Copy link
Collaborator

I'm gonna close this PR for now, since we have equivalent PR on the PariserParr branch

@RichRick1 RichRick1 closed this Jul 15, 2024
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

Successfully merging this pull request may close these issues.

2 participants