Matches in UGent Biblio for { <https://biblio.ugent.be/publication/5807443#aggregation> ?p ?o. }
Showing items 1 to 32 of
32
with 100 items per page.
- aggregation classification "A1".
- aggregation creator B1030963.
- aggregation creator person.
- aggregation creator person.
- aggregation date "2014".
- aggregation format "application/pdf".
- aggregation hasFormat 5807443.bibtex.
- aggregation hasFormat 5807443.csv.
- aggregation hasFormat 5807443.dc.
- aggregation hasFormat 5807443.didl.
- aggregation hasFormat 5807443.doc.
- aggregation hasFormat 5807443.json.
- aggregation hasFormat 5807443.mets.
- aggregation hasFormat 5807443.mods.
- aggregation hasFormat 5807443.rdf.
- aggregation hasFormat 5807443.ris.
- aggregation hasFormat 5807443.txt.
- aggregation hasFormat 5807443.xls.
- aggregation hasFormat 5807443.yaml.
- aggregation isPartOf urn:issn:1539-3755.
- aggregation language "eng".
- aggregation rights "I have transferred the copyright for this publication to the publisher".
- aggregation subject "Physics and Astronomy".
- aggregation title "Faster identification of optimal contraction sequences for tensor networks".
- aggregation abstract "The efficient evaluation of tensor expressions involving sums over multiple indices is of significant importance to many fields of research, including quantum many-body physics, loop quantum gravity, and quantum chemistry. The computational cost of evaluating an expression may depend strongly on the order in which the index sums are evaluated, and determination of the operation-minimizing contraction sequence for a single tensor network (single term, in quantum chemistry) is known to be NP-hard. The current preferred solution is an exhaustive search, using either an iterative depth-first approach with pruning or dynamic programming and memoization, but these approaches are impractical for many of the larger tensor network ansatze encountered in quantum many-body physics. We present a modified search algorithm with enhanced pruning which exhibits a performance increase of several orders of magnitude while still guaranteeing identification of an optimal operation-minimizing contraction sequence for a single tensor network.".
- aggregation authorList BK1446038.
- aggregation issue "3".
- aggregation volume "90".
- aggregation aggregates 5807477.
- aggregation isDescribedBy 5807443.
- aggregation similarTo PhysRevE.90.033315.
- aggregation similarTo LU-5807443.