Approximate Contraction of Arbitrary Tensor Networks with a Flexible and Efficient Density Matrix Algorithm.
Linjian MaMatthew FishmanEdwin Miles StoudenmireEdgar SolomonikPublished in: CoRR (2024)
Keyphrases
- detection algorithm
- single pass
- computational complexity
- computational cost
- np hard
- learning algorithm
- objective function
- preprocessing
- highly efficient
- search space
- k means
- worst case
- expectation maximization
- dynamic programming
- density function
- matching algorithm
- clustering method
- computationally efficient
- cost function
- optimal solution
- bayesian networks