Graphs.connected_components(::ITensorNetwork)- Shortest path algorithms:
Graphs.a_star.
- https://arxiv.org/abs/1304.6112 (Faster identification of optimal contraction sequences for tensor networks)
- https://arxiv.org/abs/1310.8023 (Improving the efficiency of variational tensor network algorithms)
- https://arxiv.org/abs/quant-ph/0511069 (Simulating quantum computation by contracting tensor networks)
- https://journals.aps.org/pre/abstract/10.1103/PhysRevE.100.043309 (Towards a polynomial algorithm for optimal contraction sequence of tensor networks from trees)
- https://arxiv.org/abs/2001.08063 (Algorithms for Tensor Network Contraction Ordering)
- https://arxiv.org/abs/2002.01935 (Hyper-optimized tensor network contraction)
- https://arxiv.org/abs/1709.07460 (Renormalization of tensor networks using graph independent local truncations)
- https://arxiv.org/abs/1801.05390 (Gauge fixing, canonical forms and optimal truncations in tensor networks with closed loops)
- https://arxiv.org/abs/1912.03014 (Contracting Arbitrary Tensor Networks: General Approximate Algorithm and Applications in Graphical Models and Quantum Circuit Simulations)
- https://arxiv.org/abs/1903.09650 (Differentiable Programming Tensor Networks)
- https://arxiv.org/abs/1912.02780 (Automatic Differentiation for Second Renormalization of Tensor Networks)
- https://arxiv.org/abs/2001.04121 (Automatic differentiation of dominant eigensolver and its applications in quantum physics)
- https://arxiv.org/abs/2007.03638 (Riemannian optimization of isometric tensor networks)
- https://arxiv.org/abs/2101.03935 (Generating Function for Tensor Network Diagrammatic Summation)