Make compatible with ITensors 0.9

Project.toml

@@ -1,7 +1,7 @@
 name = "ITensorNetworks"
 uuid = "2919e153-833c-4bdc-8836-1ea460a35fc7"
 authors = ["Matthew Fishman <[email protected]>, Joseph Tindall <[email protected]> and contributors"]
-version = "0.12.0"
+version = "0.12.1"
 
 [deps]
 AbstractTrees = "1520ce14-60c1-5f80-bbc7-55ef81b5835c"
@@ -65,7 +65,7 @@ EinExprs = "0.6.4"
 Graphs = "1.8"
 GraphsFlows = "0.1.1"
 ITensorMPS = "0.3"
-ITensors = "0.7, 0.8"
+ITensors = "0.7, 0.8, 0.9"
 IsApprox = "0.1, 1, 2"
 IterTools = "1.4.0"
 KrylovKit = "0.6, 0.7, 0.8"

src/apply.jl

@@ -22,7 +22,6 @@ using ITensors:
   replaceinds,
   unioninds,
   uniqueinds
-using ITensors.ContractionSequenceOptimization: optimal_contraction_sequence
 using ITensorMPS: siteinds
 using KrylovKit: linsolve
 using LinearAlgebra: eigen, norm, svd
@@ -407,7 +406,7 @@ function fidelity(
     ],
     envs,
   )
-  term1 = ITensors.contract(term1_tns; sequence=optimal_contraction_sequence(term1_tns))
+  term1 = ITensors.contract(term1_tns; sequence="automatic")
 
   term2_tns = vcat(
     [
@@ -418,9 +417,9 @@ function fidelity(
     ],
     envs,
   )
-  term2 = ITensors.contract(term2_tns; sequence=optimal_contraction_sequence(term2_tns))
+  term2 = ITensors.contract(term2_tns; sequence="automatic")
   term3_tns = vcat([p_prev, q_prev, prime(dag(p_cur)), prime(dag(q_cur)), gate], envs)
-  term3 = ITensors.contract(term3_tns; sequence=optimal_contraction_sequence(term3_tns))
+  term3 = ITensors.contract(term3_tns; sequence="automatic")
 
   f = term3[] / sqrt(term1[] * term2[])
   return f * conj(f)
@@ -447,37 +446,13 @@ function optimise_p_q(
   qs_ind = setdiff(inds(q_cur), collect(Iterators.flatten(inds.(vcat(envs, p_cur)))))
   ps_ind = setdiff(inds(p_cur), collect(Iterators.flatten(inds.(vcat(envs, q_cur)))))
 
-  opt_b_seq = optimal_contraction_sequence(vcat(ITensor[p, q, o, dag(prime(q_cur))], envs))
-  opt_b_tilde_seq = optimal_contraction_sequence(
-    vcat(ITensor[p, q, o, dag(prime(p_cur))], envs)
-  )
-  opt_M_seq = optimal_contraction_sequence(
-    vcat(ITensor[q_cur, replaceinds(prime(dag(q_cur)), prime(qs_ind), qs_ind), p_cur], envs)
-  )
-  opt_M_tilde_seq = optimal_contraction_sequence(
-    vcat(ITensor[p_cur, replaceinds(prime(dag(p_cur)), prime(ps_ind), ps_ind), q_cur], envs)
-  )
-
-  function b(
-    p::ITensor,
-    q::ITensor,
-    o::ITensor,
-    envs::Vector{ITensor},
-    r::ITensor;
-    opt_sequence=nothing,
-  )
+  function b(p::ITensor, q::ITensor, o::ITensor, envs::Vector{ITensor}, r::ITensor;)
     return noprime(
-      ITensors.contract(vcat(ITensor[p, q, o, dag(prime(r))], envs); sequence=opt_sequence)
+      ITensors.contract(vcat(ITensor[p, q, o, dag(prime(r))], envs); sequence="automatic")
     )
   end
 
-  function M_p(
-    envs::Vector{ITensor},
-    p_q_tensor::ITensor,
-    s_ind,
-    apply_tensor::ITensor;
-    opt_sequence=nothing,
-  )
+  function M_p(envs::Vector{ITensor}, p_q_tensor::ITensor, s_ind, apply_tensor::ITensor;)
     return noprime(
       ITensors.contract(
         vcat(
@@ -488,20 +463,20 @@ function optimise_p_q(
           ],
           envs,
         );
-        sequence=opt_sequence,
+        sequence="automatic",
       ),
     )
   end
   for i in 1:nfullupdatesweeps
-    b_vec = b(p, q, o, envs, q_cur; opt_sequence=opt_b_seq)
-    M_p_partial = partial(M_p, envs, q_cur, qs_ind; opt_sequence=opt_M_seq)
+    b_vec = b(p, q, o, envs, q_cur)
+    M_p_partial = partial(M_p, envs, q_cur, qs_ind)
 
     p_cur, info = linsolve(
       M_p_partial, b_vec, p_cur; isposdef=envisposdef, ishermitian=false
     )
 
-    b_tilde_vec = b(p, q, o, envs, p_cur; opt_sequence=opt_b_tilde_seq)
-    M_p_tilde_partial = partial(M_p, envs, p_cur, ps_ind; opt_sequence=opt_M_tilde_seq)
+    b_tilde_vec = b(p, q, o, envs, p_cur)
+    M_p_tilde_partial = partial(M_p, envs, p_cur, ps_ind)
 
     q_cur, info = linsolve(
       M_p_tilde_partial, b_tilde_vec, q_cur; isposdef=envisposdef, ishermitian=false

src/caches/abstractbeliefpropagationcache.jl

@@ -17,8 +17,7 @@ using NDTensors: NDTensors
 abstract type AbstractBeliefPropagationCache end
 
 function default_message_update(contract_list::Vector{ITensor}; normalize=true, kwargs...)
-  sequence = optimal_contraction_sequence(contract_list)
-  updated_messages = contract(contract_list; sequence, kwargs...)
+  updated_messages = contract(contract_list; sequence="automatic", kwargs...)
   message_norm = norm(updated_messages)
   if normalize && !iszero(message_norm)
     updated_messages /= message_norm

test/test_gauging.jl

@@ -14,6 +14,7 @@ using ITensors.NDTensors: vector
 using LinearAlgebra: diag
 using NamedGraphs.NamedGraphGenerators: named_grid
 using StableRNGs: StableRNG
+using TensorOperations: TensorOperations
 using Test: @test, @testset
 
 @testset "gauging" begin