Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2602.15114

Triangular tensor networks, pencils of matrices and beyond

Alessandra Bernardi, Fulvio Gesmundo

math.AGquant-phSubmitted Feb 16, 2026• Announced Feb 18, 2026
arXivHTMLPDF

Abstract

We study tensor network varieties associated with the triangular graph, with a focus on the case where one of the physical dimensions is 2. This allows us to interpret the tensors as pencils of matrices. We provide a complete characterization of these varieties in terms of the Kronecker invariants of pencils. We determine their dimension, identifying the cases for which the dimension is smaller than the expected parameter count. We provide necessary conditions for membership in these varieties, in terms of the geometry of classical determinantal varieties, coincident root loci and plane cubic curves. We address some extensions to arbitrary graphs.

Comments
30 pages. Comments are welcome!

Related papers

Dimension of tensor network varieties

Alessandra Bernardi, Claudia De Lazzari, Fulvio Gesmundo

The tensor network variety is a variety of tensors associated to a graph and a set of positive integer weights on its edges, called bond dimensions. We determine an upper bound on the dimension of the tensor network variety. A refined upper bound is given in cases relevant for applications such as varieties of matrix product states and projected entangled pairs states. We provide a range (the “supercritical range”) of the parameters where the upper bound is sharp.

arXiv:2101.03148•Communications in Contemporary Mathematics•Aug 19, 2022•13 citations

Tensor network representations from the geometry of entangled states

Matthias Christandl, Ángelo Lucia, Péter Vrana +1 more

Tensor networks provide descriptions of strongly correlated quantum systems based on an underlying entanglement structure given by a graph of entangled states along the edges that identify the indices of the local tensors to be contracted. Considering a more general setting, where entangled states on edges are replaced by multipartite entangled states on faces, allows us to employ the geometric properties of multipartite entanglement in order to obtain representations in terms of superpositions of tensor network states with smaller effective dimension, leading to computational savings.

arXiv:1809.08185•SciPost Physics•Sep 30, 2020•22 citations

Determinantal Kernel Schemes of Matrix Nets and Applications to Positive Maps

Trung Hoa Dinh, Ho Minh Toan, Công Trình Lê +1 more

For a linear map on a matrix space, we study the projective schemes obtained by intersecting its projectivized kernel with determinantal rank loci. For matrix nets, that is, three dimensional matrix spaces, we classify every positive dimensional intersection with the rank one Segre variety in arbitrary rectangular size. The possibilities are a ruling plane, a smooth conic, two Segre lines from opposite rulings, a reduced Segre line, or a Segre line with one reduced or embedded residual point. The smooth conic case is contained in a $2\times2$ compression. For $a,b\ge3$, the corresponding locus in $\mbox{Gr}(3,M_{a,b})$ has exactly three irreducible components, whose geometry and intersections are determined explicitly. For nets in $M_3(\mathbb C)$, every finite rank one scheme has length at most three; the adjugate identity gives an intrinsic determinantal obstruction to the length four case allowed for general systems of plane quadrics. As an application, a four parameter family arising from the merging construction admits exact positivity and decomposability criteria. After normalization, positivity is the unit square and decomposability is the quarter disk. The remaining region is atomic and carries explicit PPT entangled states of birank $(5,5)$ and Schmidt number two. The point of this application is that the exact phase boundary is realized on a smooth conic determinantal kernel stratum selected independently by the projective classification.

arXiv:2609.09675•Sep 9, 2026•0 citations

Tensor Networks in a Nutshell

Jacob Biamonte, Ville Bergholm

Tensor network methods are taking a central role in modern quantum physics and beyond. They can provide an efficient approximation to certain classes of quantum states, and the associated graphical language makes it easy to describe and pictorially reason about quantum circuits, channels, protocols, open systems and more. Our goal is to explain tensor networks and some associated methods as quickly and as painlessly as possible. Beginning with the key definitions, the graphical tensor network language is presented through examples. We then provide an introduction to matrix product states. We conclude the tutorial with tensor contractions evaluating combinatorial counting problems. The first one counts the number of solutions for Boolean formulae, whereas the second is Penrose's tensor contraction algorithm, returning the number of $3$-edge-colorings of $3$-regular planar graphs.

arXiv:1708.00006•Jul 31, 2017•299 citations

Beyond Bond Gauge: Exact Tensor-Network Tangent Spaces at Weighted Graph States

Song Cheng

For normal PEPS, the fundamental theorem settles at the finite level whether virtual-bond gauge exhausts a tensor network's representation freedom. We ask the first-order question at a fixed representation, from both sides of the differential: which tensor variations leave the state unchanged without being bond gauges, and which physical directions can no variation reach? We answer both exactly for weighted graph state (WGS) tensor networks with equal physical and bond dimension $q\ge2$, which include the graph-state resources of measurement-based quantum computation. Dividing a single-tensor variation by the nonvanishing amplitude turns it into an arbitrary function on the closed neighborhood of its vertex. Overlapping neighborhoods give the complete kernel. Its non-bond part is generated on periodic regular-polygon tilings by triangles, chordless squares, and edge-sharing diamonds. Under stated period conditions, generic gauge completeness on all thirty-nine families studied identifies this nullity as a WGS rank drop: for thirty-three families at every $q\ge2$, and for six at $q=2$. Supports outside every neighborhood give the missing directions: at qubit graph states on the eleven Archimedean tilings every nearest-neighbor $XX$ and $YY$ direction is missing, including on honeycomb, where the non-bond kernel is empty. On large honeycomb and square tori, small nonzero coherent $XX$ errors leave the bond-two PEPS set on the same graph. Removing redundant parameters and supplying missing directions are therefore distinct operations.

quant-pharXiv:2609.30066•Sep 25, 2026•0 citations

Quantum algorithms for invariants of triangulated manifolds

Gorjan Alagic, Edgar A. Bering

One of the apparent advantages of quantum computers over their classical counterparts is their ability to efficiently contract tensor networks. In this article, we study some implications of this fact in the case of topological tensor networks. The graph underlying these networks is given by the triangulation of a manifold, and the structure of the tensors ensures that the overall tensor is independent of the choice of internal triangulation. This leads to quantum algorithms for additively approximating certain invariants of triangulated manifolds. We discuss the details of this construction in two specific cases. In the first case, we consider triangulated surfaces, where the triangle tensor is defined by the multiplication operator of a finite group; the resulting invariant has a simple closed-form expression involving the dimensions of the irreducible representations of the group and the Euler characteristic of the surface. In the second case, we consider triangulated 3-manifolds, where the tetrahedral tensor is defined by the so-called Fibonacci anyon model; the resulting invariant is the well-known Turaev-Viro invariant of 3-manifolds.

arXiv:1108.5424•Quantum Information and Computation•Sep 1, 2012•4 citations
We study tensor network varieties associated with the triangular graph, with a focus on the case where one of the physical dimensions is 2. This allows us to interpret the tensors as pencils of matrices. We provide a complete characterization of these varieties in terms of the Kronecker invariants of pencils. We determine their dimension, identifying the cases for which the dimension is smaller than the expected parameter count. We provide necessary conditions for membership in these varieties, in terms of the geometry of classical determinantal varieties, coincident root loci and plane cubic curves. We address some extensions to arbitrary graphs.
Tensor networks provide descriptions of strongly correlated quantum systems based on an underlying entanglement structure given by a graph of entangled states along the edges that identify the indices of the local tensors to be contracted. Considering a more general setting, where entangled states on edges are replaced by multipartite entangled states on faces, allows us to employ the geometric properties of multipartite entanglement in order to obtain representations in terms of superpositions of tensor network states with smaller effective dimension, leading to computational savings.
For a linear map on a matrix space, we study the projective schemes obtained by intersecting its projectivized kernel with determinantal rank loci. For matrix nets, that is, three dimensional matrix spaces, we classify every positive dimensional intersection with the rank one Segre variety in arbitrary rectangular size. The possibilities are a ruling plane, a smooth conic, two Segre lines from opposite rulings, a reduced Segre line, or a Segre line with one reduced or embedded residual point. The smooth conic case is contained in a 2×22\times22×2 compression. For a,b≥3a,b\ge3a,b≥3, the corresponding locus in $\mbox{Gr}(3,M_{a,b})$ has exactly three irreducible components, whose geometry and intersections are determined explicitly. For nets in M3(C)M_3(\mathbb C)M3​(C), every finite rank one scheme has length at most three; the adjugate identity gives an intrinsic determinantal obstruction to the length four case allowed for general systems of plane quadrics. As an application, a four parameter family arising from the merging construction admits exact positivity and decomposability criteria. After normalization, positivity is the unit square and decomposability is the quarter disk. The remaining region is atomic and carries explicit PPT entangled states of birank (5,5)(5,5)(5,5) and Schmidt number two. The point of this application is that the exact phase boundary is realized on a smooth conic determinantal kernel stratum selected independently by the projective classification.
Tensor network methods are taking a central role in modern quantum physics and beyond. They can provide an efficient approximation to certain classes of quantum states, and the associated graphical language makes it easy to describe and pictorially reason about quantum circuits, channels, protocols, open systems and more. Our goal is to explain tensor networks and some associated methods as quickly and as painlessly as possible. Beginning with the key definitions, the graphical tensor network language is presented through examples. We then provide an introduction to matrix product states. We conclude the tutorial with tensor contractions evaluating combinatorial counting problems. The first one counts the number of solutions for Boolean formulae, whereas the second is Penrose's tensor contraction algorithm, returning the number of 333-edge-colorings of 333-regular planar graphs.
For normal PEPS, the fundamental theorem settles at the finite level whether virtual-bond gauge exhausts a tensor network's representation freedom. We ask the first-order question at a fixed representation, from both sides of the differential: which tensor variations leave the state unchanged without being bond gauges, and which physical directions can no variation reach? We answer both exactly for weighted graph state (WGS) tensor networks with equal physical and bond dimension q≥2q\ge2q≥2, which include the graph-state resources of measurement-based quantum computation. Dividing a single-tensor variation by the nonvanishing amplitude turns it into an arbitrary function on the closed neighborhood of its vertex. Overlapping neighborhoods give the complete kernel. Its non-bond part is generated on periodic regular-polygon tilings by triangles, chordless squares, and edge-sharing diamonds. Under stated period conditions, generic gauge completeness on all thirty-nine families studied identifies this nullity as a WGS rank drop: for thirty-three families at every q≥2q\ge2q≥2, and for six at q=2q=2q=2. Supports outside every neighborhood give the missing directions: at qubit graph states on the eleven Archimedean tilings every nearest-neighbor XXXXXX and YYYYYY direction is missing, including on honeycomb, where the non-bond kernel is empty. On large honeycomb and square tori, small nonzero coherent XXXXXX errors leave the bond-two PEPS set on the same graph. Removing redundant parameters and supplying missing directions are therefore distinct operations.
One of the apparent advantages of quantum computers over their classical counterparts is their ability to efficiently contract tensor networks. In this article, we study some implications of this fact in the case of topological tensor networks. The graph underlying these networks is given by the triangulation of a manifold, and the structure of the tensors ensures that the overall tensor is independent of the choice of internal triangulation. This leads to quantum algorithms for additively approximating certain invariants of triangulated manifolds. We discuss the details of this construction in two specific cases. In the first case, we consider triangulated surfaces, where the triangle tensor is defined by the multiplication operator of a finite group; the resulting invariant has a simple closed-form expression involving the dimensions of the irreducible representations of the group and the Euler characteristic of the surface. In the second case, we consider triangulated 3-manifolds, where the tetrahedral tensor is defined by the so-called Fibonacci anyon model; the resulting invariant is the well-known Turaev-Viro invariant of 3-manifolds.