arXiv:2502. 09928v2 Announce Type: replace-cross Abstract: Originating in quantum physics, tensor networks (TNs) have been widely adopted as exponential machines and parametric decomposers for recognition tasks.
arXiv:2408.02111v4 Announce Type: replace-cross Abstract: Despite the extreme popularity of deep learning in science and industry, its formal understanding is limited. This thesis puts forth notions...
The paper introduces Tensor Network-based Quantum Data Encoding (TNQE), a framework that uses structured unitary tensor network representations to encode classical data into quantum states efficiently. TNQE decomposes each input into tensor cores and compiles them into encoding circuits via two core-to-circuit strategies, with learnable block unitaries ensuring trainability while maintaining unitarity. The method achieves significantly shallower circuits—down to 0.04× the depth of amplitude encoding—and scales to high‑resolution images, demonstrating practical feasibility on real quantum hardware.
The paper applies parameterised graph theory to tensor networks, showing that cutwidth and tree‑cutwidth bound the bond‑dimension overhead needed to represent a tensor‑network state as a matrix product state or tree tensor network. It derives graph‑dependent upper bounds on the sample and computational complexity of tensor‑network tomography, introducing a new graph parameter called learning complexity. Finally, it extends the framework to an agnostic learner that approximates any state with a tensor‑network state of given bond dimension, providing explicit graph‑dependent complexity bounds.
The paper introduces a quantum tensor network learning framework that employs matrix product states (MPS) as a machine‑learning architecture, adding a global normalization condition to interpret the MPS as a quantum state. It compares two optimization strategies—gradient descent and a DMRG‑adapted method—to identify locally optimal tensors and evaluates their effectiveness.
The paper presents a formal analysis of the quotient geometry of tree tensor networks (TTNs) and introduces efficient first- and second-order optimization algorithms that leverage this geometry. It also develops a backpropagation method for training TTNs in a kernel learning context. Numerical experiments on a digit classification task demonstrate a tradeoff between two horizontal distributions: one provides clearer geometric insights, while the other yields more efficient algorithms.
arXiv:2507.21135v2 Announce Type: replace Abstract: We demonstrate how Quantum Cognition Machine Learning (QCML) encodes data as quantum geometry. In QCML, features of the data are represented by lea...
arXiv:2608. 17135v1 Announce Type: cross Abstract: Tensor networks are powerful formats for compressing large-scale data.
arXiv:2606. 26873v1 Announce Type: cross Abstract: Graphs provide a natural language for relational data in chemistry, biology and optimisation.
arXiv:2609.23774v1 Announce Type: new Abstract: Probabilistic inference is generally only tractable in low-treewidth graphical models, limiting its effective applicability in high-treewidth settings....
arXiv:2506. 09398v4 Announce Type: replace Abstract: We consider the task of predicting Hamiltonian matrices to accelerate electronic structure calculations, which plays an important role in physics, chemistry, and materials science.
The paper discusses tensorizing neural networks by reshaping dense weight matrices into higher-order tensors and approximating them with low-rank tensor network decompositions. This approach offers promising model compression and introduces bond indices that create new latent spaces, potentially enhancing interpretability. Despite encouraging empirical results, tensorized neural networks remain underused, and the authors call for more research to address practical scaling and adoption challenges.