Entangling Machine Learning with Quantum Tensor Networks
Not on the map. Why?
Abstract (arXiv)
This paper examines the use of tensor networks, which can efficiently represent high-dimensional quantum states, in language modeling. It is a distillation and continuation of the work done in (van der Poel, 2023). To do so, we will abstract the problem down to modeling Motzkin spin chains, which exhibit long-range correlations reminiscent of those found in language. The Matrix Product State (MPS), also known as the tensor train, has a bond dimension which scales as the length of the sequence it models. To combat this, we use the factored core MPS, whose bond dimension scales sub-linearly. We find that the tensor models reach near perfect classifying ability, and maintain a stable level of performance as the number of valid training examples is decreased.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 8 of its 19 references that are in the map. First posted on arXiv 9 Jan 2024.
Builds on
8 of 19 references.
References · 8
- 2017Machine Learning by Unitary Tensor Network of Hierarchical Tree Structurecited by 39
- 2016Supervised Learning with Quantum-Inspired Tensor Networkscited by 35
- 2016Criticality in Formal Languages and Statistical Physicscited by 33
- 2019Modeling Sequences with Quantum States: A Look Under the Hoodcited by 19
- 2020Entanglement and Tensor Networks for Supervised Image Classificationcited by 18
- 2019Probabilistic Modeling with Matrix Product Statescited by 11
- 2017Language as a matrix product statecited by 7
- 2020At the Interface of Algebra and Statisticscited by 6
Built on by
Not cited yet.