Cargando…
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....
Autores principales: | Dumitrescu, Eugene F., Fisher, Allison L., Goodrich, Timothy D., Humble, Travis S., Sullivan, Blair D., Wright, Andrew L. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6298732/ https://www.ncbi.nlm.nih.gov/pubmed/30562341 http://dx.doi.org/10.1371/journal.pone.0207827 |
Ejemplares similares
-
Validating quantum-classical programming models with tensor network simulations
por: McCaskey, Alexander, et al.
Publicado: (2018) -
On the Treewidths of Graphs of Bounded Degree
por: Song, Yinglei, et al.
Publicado: (2015) -
Counting Linear Extensions: Parameterizations by Treewidth
por: Eiben, E., et al.
Publicado: (2018) -
Treewidth-based algorithms for the small parsimony problem on networks
por: Scornavacca, Celine, et al.
Publicado: (2022) -
Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology
por: Hecher, Markus, et al.
Publicado: (2020)