Calculating the Projective Norm of higher-order tensors using a gradient descent algorithm
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_ | 1866915702651224064 |
|---|---|
| author | Rudra, Aaditya Jivulescu, Maria Anastasia |
| author_facet | Rudra, Aaditya Jivulescu, Maria Anastasia |
| contents | Projective Norms are a class of tensor norms that map on the input and output spaces. These norms are useful for providing a measure of entanglement. Calculating the projective norms is an NP-hard problem, which creates challenges in computing due to the complexity of the exponentially growing parameter space for higher-order tensors. We develop a novel gradient descent algorithm to estimate the projective norm of higher-order tensors. The algorithm guarantees convergence to a minimum nuclear rank decomposition of our given tensor. We extend our algorithm to symmetric tensors and density matrices. We demonstrate the performance of our algorithm by computing the nuclear rank and the projective norm for both pure and mixed states and provide numerical evidence for the same. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_07933 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Calculating the Projective Norm of higher-order tensors using a gradient descent algorithm Rudra, Aaditya Jivulescu, Maria Anastasia Quantum Physics 65Kxx G.1 Projective Norms are a class of tensor norms that map on the input and output spaces. These norms are useful for providing a measure of entanglement. Calculating the projective norms is an NP-hard problem, which creates challenges in computing due to the complexity of the exponentially growing parameter space for higher-order tensors. We develop a novel gradient descent algorithm to estimate the projective norm of higher-order tensors. The algorithm guarantees convergence to a minimum nuclear rank decomposition of our given tensor. We extend our algorithm to symmetric tensors and density matrices. We demonstrate the performance of our algorithm by computing the nuclear rank and the projective norm for both pure and mixed states and provide numerical evidence for the same. |
| title | Calculating the Projective Norm of higher-order tensors using a gradient descent algorithm |
| topic | Quantum Physics 65Kxx G.1 |
| url | https://arxiv.org/abs/2508.07933 |