You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: docs/src/ContractionSequenceOptimization.md
+1-1Lines changed: 1 addition & 1 deletion
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -2,7 +2,7 @@
2
2
3
3
When contracting a tensor network, the sequence of contraction makes a big difference in the computational cost. However, the complexity of determining the optimal sequence grows exponentially with the number of tensors, but there are many heuristic algorithms available for computing optimal sequences for small networks[^1][^2][^3][^4][^5][^6]. ITensors.jl provides some functionality for helping you find the optimal contraction sequence for small tensor network, as we will show below.
4
4
5
-
The algorithm in ITensors.jl currently uses a modified version of[^1] with simplifications for outer product contractions similar to those used in [TensorOperations.jl](https://github.com/Jutho/TensorOperations.jl).
5
+
The algorithm in ITensors.jl currently uses a modified version of[^1] with simplifications for outer product contractions and is based on the implementation in [TensorOperations.jl](https://github.com/Jutho/TensorOperations.jl).
6
6
7
7
[^1]: [Faster identification of optimal contraction sequences for tensor networks](https://arxiv.org/abs/1304.6112)
8
8
[^2]: [Improving the efficiency of variational tensor network algorithms](https://arxiv.org/abs/1310.8023)
Copy file name to clipboardExpand all lines: docs/src/getting_started/NextSteps.md
+1-3Lines changed: 1 addition & 3 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -1,12 +1,10 @@
1
1
# Next Steps
2
2
3
-
* Try one of the [Tutorials](@ref dmrg_tutorial) in the next section of the ITensor documentation
4
-
5
3
* Browse the [Code Examples](@ref itensor_examples).
6
4
7
5
* Read the [ITensor Paper](https://www.scipost.org/SciPostPhysCodeb.4) for a long-form introduction to the design and main features of the ITensor library
8
6
9
-
*Read the [Advanced ITensor Usage Guide](@ref advanced_usage_guide)
7
+
*Refer to the [ITensorMPS.jl documentation](https://itensor.github.io/ITensorDocs/ITensorMPS) for information on running finite MPS/MPO calculations such as DMRG.
10
8
11
9
* More Julia language tutorials and resources
12
10
-[From zero to Julia!](https://techytok.com/from-zero-to-julia/)
The source code for ITensor can be found [on Github](https://github.com/ITensor/ITensors.jl).
14
+
The source code for ITensors.jl can be found [on Github](https://github.com/ITensor/ITensors.jl).
15
15
16
-
Additional documentation can be found on the ITensor website [itensor.org](https://itensor.org/).
16
+
Additional documentation can be found on the ITensor website [itensor.org](https://itensor.org).
17
17
18
18
An ITensor is a tensor whose interface
19
19
is independent of its memory layout. ITensor indices are
20
20
objects which carry extra information and which
21
21
'recognize' each other (compare equal to each other).
22
22
23
-
The ITensor library also includes composable and extensible
24
-
algorithms for optimizing and transforming tensor networks, such as
25
-
matrix product state and matrix product operators, such as
26
-
the DMRG algorithm.
23
+
The [ITensorMPS.jl library](https://github.com/ITensor/ITensorMPS.jl)
24
+
includes composable and extensible algorithms for optimizing and transforming
25
+
tensor networks, such as matrix product state and matrix product operators, such as
26
+
the DMRG algorithm. If you are looking for information on running finite MPS/MPO
27
+
calculations such as DMRG, take a look at the [ITensorMPS.jl documentation](https://itensor.github.io/ITensorDocs/ITensorMPS).
27
28
28
29
Development of ITensor is supported by the Flatiron Institute, a division of the Simons Foundation.
29
30
@@ -46,7 +47,7 @@ Development of ITensor is supported by the Flatiron Institute, a division of the
46
47
- March 25, 2022: ITensors.jl v0.3 has been released. The main breaking change is that we no longer support versions of Julia below 1.6. Julia 1.6 is the long term support version of Julia (LTS), which means that going forward versions below Julia 1.6 won't be as well supported with bug fixes and improvements. Additionally, Julia 1.6 introduced many improvements including syntax improvements that we would like to start using with ITensors.jl, which becomes challenging if we try to support Julia versions below 1.6. See [here](https://www.oxinabox.net/2021/02/13/Julia-1.6-what-has-changed-since-1.0.html) and [here](https://julialang.org/blog/2021/03/julia-1.6-highlights/) for some nice summaries of the Julia 1.6 release.
47
48
48
49
- Jun 09, 2021: ITensors.jl v0.2 has been released, with a few breaking changes as well as a variety of bug fixes
49
-
and new features. Take a look at the [upgrade guide](https://itensor.github.io/ITensors.jl/stable/UpgradeGuide_0.1_to_0.2.html)
50
+
and new features. Take a look at the [upgrade guide](https://itensor.github.io/ITensorDocs/ITensors/dev/UpgradeGuide_0.1_to_0.2.html)
0 commit comments