@@ -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