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.

Sign up for GitHub

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

Remove flatten networks and refactor test #170

Merged
merged 1 commit into from
May 7, 2024
Merged

Remove flatten networks and refactor test #170

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
32 changes: 0 additions & 32 deletions src/abstractitensornetwork.jl
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -663,38 +663,6 @@ function split_index(
return tn
end

function flatten_networks(
tn1::AbstractITensorNetwork,
tn2::AbstractITensorNetwork;
map_bra_linkinds=sim,
flatten=true,
combine_linkinds=true,
kwargs...,
)
@assert issetequal(vertices(tn1), vertices(tn2))
tn1 = map_bra_linkinds(tn1; sites=[])
flattened_net = ⊗(tn1, tn2; kwargs...)
if flatten
for v in vertices(tn1)
flattened_net = contract(flattened_net, (v, 2) => (v, 1); merged_vertex=v)
end
end
if combine_linkinds
flattened_net = ITensorNetworks.combine_linkinds(flattened_net)
end
return flattened_net
end

function flatten_networks(
tn1::AbstractITensorNetwork,
tn2::AbstractITensorNetwork,
tn3::AbstractITensorNetwork,
tn_tail::AbstractITensorNetwork...;
kwargs...,
)
return flatten_networks(flatten_networks(tn1, tn2; kwargs...), tn3, tn_tail...; kwargs...)
end

function inner_network(x::AbstractITensorNetwork, y::AbstractITensorNetwork; kwargs...)
return BilinearFormNetwork(x, y; kwargs...)
end
Expand Down
16 changes: 6 additions & 10 deletions test/test_contraction_sequence_to_graph.jl
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -5,9 +5,7 @@ using ITensorNetworks:
contraction_sequence_to_digraph,
contraction_sequence_to_graph,
contraction_tree_leaf_bipartition,
flatten_networks,
random_tensornetwork,
siteinds
random_tensornetwork
using Test: @test, @testset
using NamedGraphs.GraphsExtensions:
is_leaf_vertex, leaf_vertices, non_leaf_edges, root_vertex
Expand All @@ -17,12 +15,10 @@ using NamedGraphs.NamedGraphGenerators: named_grid
n = 3
dims = (n, n)
g = named_grid(dims)
s = siteinds("S=1/2", g)

ψ = random_tensornetwork(s; link_space=2)
ψψ = flatten_networks(ψ, ψ)
tn = random_tensornetwork(g; link_space=2)

seq = contraction_sequence(ψψ)
seq = contraction_sequence(tn)

g_directed_seq = contraction_sequence_to_digraph(seq)
g_seq_leaves = leaf_vertices(g_directed_seq)
Expand All @@ -37,16 +33,16 @@ using NamedGraphs.NamedGraphGenerators: named_grid
for eb in non_leaf_edges(g_seq)
vs = contraction_tree_leaf_bipartition(g_seq, eb)
@test length(vs) == 2
@test Set([v.I for v in vcat(vs[1], vs[2])]) == Set(vertices(ψψ))
@test Set([v.I for v in vcat(vs[1], vs[2])]) == Set(vertices(tn))
end
#Check all internal vertices define a correct tripartition and all leaf vertices define a bipartition (tensor on that leafs vs tensor on rest of tree)
for v in vertices(g_seq)
if (!is_leaf_vertex(g_seq, v))
@test length(v) == 3
@test Set([vsi.I for vsi in vcat(v[1], v[2], v[3])]) == Set(vertices(ψψ))
@test Set([vsi.I for vsi in vcat(v[1], v[2], v[3])]) == Set(vertices(tn))
else
@test length(v) == 2
@test Set([vsi.I for vsi in vcat(v[1], v[2])]) == Set(vertices(ψψ))
@test Set([vsi.I for vsi in vcat(v[1], v[2])]) == Set(vertices(tn))
end
end
end
Expand Down
Loading