Numerical Optimization for Tensor Disentanglement
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866918131248660480 |
|---|---|
| author | Wei, Julia Dektor, Alec Shen, Chungen Wen, Zaiwen Yang, Chao |
| author_facet | Wei, Julia Dektor, Alec Shen, Chungen Wen, Zaiwen Yang, Chao |
| contents | Tensor networks provide compact and scalable representations of high-dimensional data, enabling efficient computation in fields such as quantum physics, numerical partial differential equations (PDEs), and machine learning. This paper focuses on tensor disentangling, the task of identifying transformations that reduce bond dimensions by exploiting gauge freedom in the network. We formulate this task as an optimization problem over orthogonal matrices acting on a single tensor's indices, aiming to minimize the rank of its matricized form. We present Riemannian optimization methods and a joint optimization framework that alternates between optimizing the orthogonal transformation for a fixed low-rank approximation and optimizing the low-rank approximation for a fixed orthogonal transformation, offering a competitive alternative when the target rank is known. To seek the often unknown optimal rank, we introduce a binary search strategy integrated with the disentangling procedure. Numerical experiments on random tensors and tensors in an approximate isometric tensor network state are performed to compare different optimization methods and explore the possibility of combining different methods in a hybrid approach. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_19409 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Numerical Optimization for Tensor Disentanglement Wei, Julia Dektor, Alec Shen, Chungen Wen, Zaiwen Yang, Chao Numerical Analysis Quantum Physics Tensor networks provide compact and scalable representations of high-dimensional data, enabling efficient computation in fields such as quantum physics, numerical partial differential equations (PDEs), and machine learning. This paper focuses on tensor disentangling, the task of identifying transformations that reduce bond dimensions by exploiting gauge freedom in the network. We formulate this task as an optimization problem over orthogonal matrices acting on a single tensor's indices, aiming to minimize the rank of its matricized form. We present Riemannian optimization methods and a joint optimization framework that alternates between optimizing the orthogonal transformation for a fixed low-rank approximation and optimizing the low-rank approximation for a fixed orthogonal transformation, offering a competitive alternative when the target rank is known. To seek the often unknown optimal rank, we introduce a binary search strategy integrated with the disentangling procedure. Numerical experiments on random tensors and tensors in an approximate isometric tensor network state are performed to compare different optimization methods and explore the possibility of combining different methods in a hybrid approach. |
| title | Numerical Optimization for Tensor Disentanglement |
| topic | Numerical Analysis Quantum Physics |
| url | https://arxiv.org/abs/2508.19409 |