Network solvers redesign #242
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,12 +1,13 @@ | ||
| name = "ITensorNetworks" | ||
| uuid = "2919e153-833c-4bdc-8836-1ea460a35fc7" | ||
| authors = ["Matthew Fishman <[email protected]>, Joseph Tindall <[email protected]> and contributors"] | ||
| version = "0.14.0" | ||
|
|
||
| [deps] | ||
| AbstractTrees = "1520ce14-60c1-5f80-bbc7-55ef81b5835c" | ||
| Combinatorics = "861a8166-3701-5b0c-9a16-15d98fcdc6aa" | ||
| Compat = "34da2185-b29b-5c13-b0c7-acf172513d20" | ||
| ConstructionBase = "187b0558-2788-49d3-abe0-74a17ed4e7c9" | ||
| DataGraphs = "b5a273c3-7e6c-41f6-98bd-8d7f1525a36a" | ||
| DataStructures = "864edb3b-99cc-5e75-8d2d-829cb0a9cfe8" | ||
| Dictionaries = "85a47980-9c8c-11e8-2b9f-f7ca1fa99fb4" | ||
|
|
@@ -53,6 +54,7 @@ AbstractTrees = "0.4.4" | |
| Adapt = "4" | ||
| Combinatorics = "1" | ||
| Compat = "3, 4" | ||
| ConstructionBase = "1.6.0" | ||
| DataGraphs = "0.2.3" | ||
| DataStructures = "0.18" | ||
| Dictionaries = "0.4" | ||
|
|
||
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
|
|
@@ -2,4 +2,4 @@ | |
| ITensorNetworks = "2919e153-833c-4bdc-8836-1ea460a35fc7" | ||
|
|
||
| [compat] | ||
| ITensorNetworks = "0.14.0" | ||
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,32 @@ | ||
|
|
||
| # | ||
| # TupleRegionIterator | ||
| # | ||
| # Adapts outputs to be (region, region_kwargs) tuples | ||
| # | ||
| # More generic design? maybe just assuming RegionIterator | ||
| # or its outputs implement some interface function that | ||
| # generates each tuple? | ||
| # | ||
|
|
||
| mutable struct TupleRegionIterator{RegionIter} | ||
|
There was a problem hiding this comment. Maybe we can come up with a name that is more descriptive, like |
||
| region_iterator::RegionIter | ||
| end | ||
|
|
||
| region_iterator(T::TupleRegionIterator) = T.region_iterator | ||
|
|
||
| function Base.iterate(T::TupleRegionIterator, which=1) | ||
| state = iterate(region_iterator(T), which) | ||
| isnothing(state) && return nothing | ||
| (current_region, region_kwargs) = current_region_plan(region_iterator(T)) | ||
| return (current_region, region_kwargs), last(state) | ||
| end | ||
|
|
||
| """ | ||
| region_tuples(R::RegionIterator) | ||
|
|
||
| The `region_tuples` adapter converts a RegionIterator into an | ||
| iterator which outputs a tuple of the form (current_region, current_region_kwargs) | ||
| at each step. | ||
| """ | ||
| region_tuples(R::RegionIterator) = TupleRegionIterator(R) | ||
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change | ||||
|---|---|---|---|---|---|---|
| @@ -0,0 +1,16 @@ | ||||||
|
|
||||||
| function align_indices(tn) | ||||||
|
There was a problem hiding this comment.
Suggested change
since in general ITensor indices are referred to as |
||||||
| si = siteinds(tn) | ||||||
| ptn = copy(tn) | ||||||
| for v in vertices(tn) | ||||||
| is = inds(tn[v]) | ||||||
| ls = setdiff(is, si[v]) | ||||||
| isempty(ls) && continue | ||||||
| new_is = [first(ls), si[v]...] | ||||||
| if length(ls) >= 2 | ||||||
| new_is = vcat(new_is, ls[2:end]) | ||||||
| end | ||||||
| ptn[v] = permute(tn[v], new_is) | ||||||
| end | ||||||
| return ptn | ||||||
| end | ||||||
Oops, something went wrong.
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
A similar change to the function
function ITensors.apply( o, ψ::VidalITensorNetwork; ...)lower down (lime 322) will be necessary to avoid ambiguity and the current failing test.