Skip to content

Commit 146e661

Browse files
committed
Formatting
1 parent 632aeb0 commit 146e661

File tree

2 files changed

+15
-4
lines changed

2 files changed

+15
-4
lines changed

ext/ITensorNetworksEinExprsExt/ITensorNetworksEinExprsExt.jl

Lines changed: 6 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,12 @@ module ITensorNetworksEinExprsExt
22

33
using ITensors: Index, ITensor, @Algorithm_str, inds, noncommoninds
44
using ITensorNetworks:
5-
ITensorNetworks, ITensorList, ITensorNetwork, vertextype, vertex_data, contraction_sequence
5+
ITensorNetworks,
6+
ITensorList,
7+
ITensorNetwork,
8+
vertextype,
9+
vertex_data,
10+
contraction_sequence
611
using EinExprs: EinExprs, EinExpr, einexpr, SizedEinExpr
712

813
function to_einexpr(ts::ITensorList)

ext/ITensorNetworksOMEinsumContractionOrdersExt/ITensorNetworksOMEinsumContractionOrdersExt.jl

Lines changed: 9 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -124,7 +124,9 @@ Optimize the einsum contraction pattern using the simulated annealing on tensor
124124
### References
125125
* [Recursive Multi-Tensor Contraction for XEB Verification of Quantum Circuits](https://arxiv.org/abs/2108.05665)
126126
"""
127-
function ITensorNetworks.contraction_sequence(::Algorithm"tree_sa", tn::ITensorList; kwargs...)
127+
function ITensorNetworks.contraction_sequence(
128+
::Algorithm"tree_sa", tn::ITensorList; kwargs...
129+
)
128130
return optimize_contraction_sequence(
129131
tn; optimizer=OMEinsumContractionOrders.TreeSA(; kwargs...)
130132
)
@@ -151,7 +153,9 @@ Then finds the contraction order inside each group with the greedy search algori
151153
### References
152154
* [Hyper-optimized tensor network contraction](https://arxiv.org/abs/2002.01935)
153155
"""
154-
function ITensorNetworks.contraction_sequence(::Algorithm"sa_bipartite", tn::ITensorList; kwargs...)
156+
function ITensorNetworks.contraction_sequence(
157+
::Algorithm"sa_bipartite", tn::ITensorList; kwargs...
158+
)
155159
return optimize_contraction_sequence(
156160
tn; optimizer=OMEinsumContractionOrders.SABipartite(; kwargs...)
157161
)
@@ -175,7 +179,9 @@ Then finds the contraction order inside each group with the greedy search algori
175179
* [Hyper-optimized tensor network contraction](https://arxiv.org/abs/2002.01935)
176180
* [Simulating the Sycamore quantum supremacy circuits](https://arxiv.org/abs/2103.03074)
177181
"""
178-
function ITensorNetworks.contraction_sequence(::Algorithm"kahypar_bipartite", tn::ITensorList; kwargs...)
182+
function ITensorNetworks.contraction_sequence(
183+
::Algorithm"kahypar_bipartite", tn::ITensorList; kwargs...
184+
)
179185
return optimize_contraction_sequence(
180186
tn; optimizer=OMEinsumContractionOrders.KaHyParBipartite(; kwargs...)
181187
)

0 commit comments

Comments
 (0)