EinExprs: Contraction Paths of Tensor Networks as Symbolic Expressions
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917623588978688 |
|---|---|
| author | Sanchez-Ramirez, Sergio Vallès-Muns, Jofre Garcia-Saez, Artur |
| author_facet | Sanchez-Ramirez, Sergio Vallès-Muns, Jofre Garcia-Saez, Artur |
| contents | Tensor Networks are graph representations of summation expressions in which vertices represent tensors and edges represent tensor indices or vector spaces. In this work, we present EinExprs.jl, a Julia package for contraction path optimization that offers state-of-art optimizers. We propose a representation of the contraction path of a Tensor Network based on symbolic expressions. Using this package the user may choose among a collection of different methods such as Greedy algorithms, or an approach based on the hypergraph partitioning problem. We benchmark this library with examples obtained from the simulation of Random Quantum Circuits (RQC), a well known example where Tensor Networks provide state-of-the-art methods. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_18030 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | EinExprs: Contraction Paths of Tensor Networks as Symbolic Expressions Sanchez-Ramirez, Sergio Vallès-Muns, Jofre Garcia-Saez, Artur Quantum Physics Mathematical Software 81-04 G.4; J.2; I.1.1 Tensor Networks are graph representations of summation expressions in which vertices represent tensors and edges represent tensor indices or vector spaces. In this work, we present EinExprs.jl, a Julia package for contraction path optimization that offers state-of-art optimizers. We propose a representation of the contraction path of a Tensor Network based on symbolic expressions. Using this package the user may choose among a collection of different methods such as Greedy algorithms, or an approach based on the hypergraph partitioning problem. We benchmark this library with examples obtained from the simulation of Random Quantum Circuits (RQC), a well known example where Tensor Networks provide state-of-the-art methods. |
| title | EinExprs: Contraction Paths of Tensor Networks as Symbolic Expressions |
| topic | Quantum Physics Mathematical Software 81-04 G.4; J.2; I.1.1 |
| url | https://arxiv.org/abs/2403.18030 |