ITensor / ITensor/ITensorNetworks.jl
More functionality for `PartitionedGraph` wrapping `ITensorNetwork`
Nobody has claimed this yet.
- Dominant language
- Julia
- Stars
- 128
- Forks
- 23
- Avg merge
- 4d 7h
- Merged PRs (30d)
- 7
Description
A follow up to #126, which introduces PartitionedGraph wrapping an ITensorNetwork as a data structure to help with implementing the belief propagation code.
An unfortunate consequence of that design is that functions that work on regular ITensorNetwork may not work on one wrapped in a PartitionedGraph, such as:
-
scalartype
It would be good to assess how to make those functions work in an elegant way. scalartype could maybe work if we made ITensorNetwork iterable over the vertex data, in which case scalartype would iterate over the ITensors of the network.
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by reviewing #126 and the PartitionedGraph and ITensorNetwork designs described there. Investigate how scalartype currently operates on ITensorNetwork and whether wrapping or iteration can support it; done means documenting or implementing an elegant approach that makes scalartype work for PartitionedGraph and clarifies the treatment of similar functions.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- julia
- Domain
- data
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 35/100