Benchmarking treewidth as a practical component of tensor network simulations.
Tensor networks are powerful factorization techniques which reduce resource requirements for numerically simulating principal quantum many-body systems and algorithms. The computational complexity of a tensor network simulation depends on the tensor ranks and the order in which they are contracted....
Main Authors: | Eugene F Dumitrescu, Allison L Fisher, Timothy D Goodrich, Travis S Humble, Blair D Sullivan, Andrew L Wright |
---|---|
Format: | Article |
Language: | English |
Published: |
Public Library of Science (PLoS)
2018-01-01
|
Series: | PLoS ONE |
Online Access: | https://doi.org/10.1371/journal.pone.0207827 |
Similar Items
-
Separating layered treewidth and row treewidth
by: Prosenjit Bose, et al.
Published: (2022-05-01) -
Validating quantum-classical programming models with tensor network simulations.
by: Alexander McCaskey, et al.
Published: (2018-01-01) -
Equivalence of Local Treewidth and Linear Local Treewidth and its Algorithmic Applications
by: Demaine, Erik D., et al.
Published: (2023) -
A note on domino treewidth
by: Hans L. Bodlaender
Published: (1999-01-01) -
A note on domino treewidth
by: Hans L. Bodlaender
Published: (1999-12-01)