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:2609.30066

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

Song Cheng

quant-phcond-mat.str-elSubmitted Sep 24, 2026• Announced Sep 25, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

AI Summary

The paper asks whether infinitesimal virtual-bond gauge transformations exhaust tensor variations that leave a PEPS state unchanged, and which physical variations the same representation cannot produce. It treats weighted graph states (WGS) on finite graphs with equal physical and bond dimension $d=D=q\ge2$, invertible nonzero phase weights, and arbitrary independent tensor variations. Dividing a single-tensor variation by the WGS amplitude identifies it with an arbitrary function on that vertex’s closed neighborhood. Product Fourier characters then give the exact differential image, rank, and kernel: accessible supports lie inside at least one closed neighborhood, while repeated supports generate kernel relations. Ordinary bond gauge has rank $E(q^2-1)+N-1$. On periodic regular-polygon tilings, non-bond relations are generated by triangles, chordless squares, and shared-edge diamonds; honeycomb has none. Blocking arguments, injectivity witnesses, and exact integer minors establish generic gauge completeness for 33 studied graph families at every $q\ge2$ and six more at $q=2$, under specified period conditions, identifying the WGS excess nullity as a parametrization rank drop. The image yields an exact TDVP projector and residual. Transverse-field Ising velocities are tangent at every admissible WGS point, whereas nearest-neighbor $XX$ and $YY$ velocities are absent at graph states on all eleven Archimedean tilings. Schmidt bounds additionally exclude any same-graph bond-two representation after a small single-edge coherent $XX$ error on sufficiently large honeycomb and square tori. These are representation-specific, instantaneous tangent results; unequal dimensions, degenerate weights, general triangle-relation integrability, and six higher-$q$ generic-completeness cases remain unresolved.

Little sign of AI-generated text

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
84 pages including appendices, 15 figures

Related papers

Beyond Bond Gauge: Exact Tensor-Network Tangent Spaces at Weighted Graph States — E8 Intelligence Research

Andrew Stewart Caldin

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 identifi Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 13, 2026•0 citations

Internal structure of gauge-invariant projected entangled pair states

David Blanik, José Garre-Rubio, András Molnár +1 more

Abstract Projected entangled pair states (PEPS) are very useful in the description of strongly correlated systems, partly because they allow encoding symmetries, either global or local (gauge), naturally. In recent years, PEPS with local symmetries have increasingly been used in the study of non-perturbative regimes of lattice gauge theories, most prominently as a way to construct variational ansatz states depending only on a small number of parameters and yet capturing the relevant physical properties. For the case of one-dimensional PEPS (matrix product states—MPS) a bidirectional connection was established between the internal structure of the tensor network, i.e. the mathematical properties of the constituent tensors, and the symmetry. In higher dimensions this has only been done for global symmetries, where in the local (gauge) case it is known only how to construct gauge-invariant states, but not what the symmetry implies on the internal structure of the PEPS. In the present work we complete this missing piece and study the internal structure of PEPS with a gauge symmetry. The PEPS we consider consist of matter and gauge field tensors placed on the vertices and edges, respectively, of arbitrary graphs.

arXiv:2410.18947•Journal of Physics A Mathematical and Theoretical•Jan 27, 2025•7 citations

Isometrization of Tensor Network States via Gauge Propagation

Zhiyu Jiang, Hiroshi Ueda

We introduce a gauge-propagation approach for approximately converting generic tensor-network states into an isometric tensor-network form with a prescribed orthogonality center. In one dimension, this propagation is exact because the non-isometric factor produced by a QR or singular-value decomposition is supported on a single virtual bond. In higher-dimensional networks, however, a local step can have several outgoing directions, and the residual factor is generally not separable into independent single-bond contributions. We address this local obstruction by approximating a local tensor, or a contracted local cluster, by structured terms consisting of an isometric factor multiplied by a tensor product of output-leg factors. The isometric factor is retained at the current site or cluster, while the output-leg factors are absorbed into neighboring tensors along the propagation directions. This construction applies to general local input-output partitions for which the input-side dimension is no smaller than the output-side dimension and provides a local truncation criterion for gauge propagation. Benchmarks on random tensors show that the proposed decomposition is effective in the low-term regime and that the residual decreases for larger local clusters. For the loop-gas tensor representation of the Kitaev spin liquid, two structured terms reduce the local residual to numerical precision, and the same cluster refinement further lowers the leading-term truncation error and reduces error accumulation during gauge propagation on a finite honeycomb network. These results identify a propagation-compatible local decomposition as a useful building block for approximate isometrization and as a potential initializer or preconditioner for variational isoTNS algorithms.

cond-mat.str-elCross-listedarXiv:2606.22816•Jun 23, 2026•0 citations

Single-layer framework of variational tensor network states

Hongyu Chen, Yangfeng Fu, Weiqiang Yu +2 more

We propose a single-layer tensor network framework for the variational determination of ground states in two-dimensional quantum lattice models. By combining the nested tensor network method [Phys. Rev. B 96, 045128 (2017)] with the automatic differentiation technique, our approach can reduce the computational cost by three orders of magnitude in bond dimension, and therefore enables highly efficient variational ground-state calculations. We demonstrate the capability of this framework through two quantum spin models: the antiferromagnetic Heisenberg model on a square lattice and the frustrated Shastry-Sutherland model. Even without GPU acceleration or symmetry implementation, we have achieved a bond dimension of nine and obtained accurate ground-state energy and consistent order parameters compared to prior studies. In particular, we confirm the existence of an intermediate empty-plaquette valence bond solid ground state in the Shastry-Sutherland model. We have further discussed the convergence of the algorithm and its potential improvements. Our work provides a promising route for large-scale tensor network calculations of two-dimensional quantum systems.

arXiv:2512.14414•Physical review. B./Physical review. B•Mar 26, 2026•2 citations

The minimal canonical form of a tensor network

Arturo Acuaviva, Visu Makam, Harold A. Nieuwboer +4 more

Tensor networks have a gauge degree of freedom on the virtual degrees of freedom that are contracted. A canonical form is a choice of fixing this degree of freedom. For matrix product states, choosing a canonical form is a powerful tool, both for theoretical and numerical purposes. On the other hand, for tensor networks in dimension two or greater there is only limited understanding of the gauge symmetry. Here we introduce a new canonical form, the minimal canonical form, which applies to projected entangled pair states (PEPS) in any dimension, and prove a corresponding fundamental theorem. Already for matrix product states this gives a new canonical form, while in higher dimensions it is the first rigorous definition of a canonical form valid for any choice of tensor. We show that two tensors have the same minimal canonical forms if and only if they are gauge equivalent up to taking limits; moreover, this is the case if and only if they give the same quantum state for any geometry. In particular, this implies that the latter problem is decidable – in contrast to the well-known undecidability for equality of PEPS on grids. We also provide rigorous algorithms for computing minimal canonical forms. To achieve this we draw on geometric invariant theory and recent progress in theoretical computer science in non-commutative group optimization.

arXiv:2209.14358•Annual Symposium on Foundations of Computer Science•Nov 6, 2023•33 citations

Dimensions and generic recovery of matching tensors

Ignoramus

Give each vertex i of a graph a complex vector space V_i, place a tensor W_ij in V_i ⊗ V_j on each edge, and sum the tensor products of these edge tensors over all perfect matchings. We study the image of this matching-tensor map and the recovery of the edge tensors from its output. For every support graph with a perfect matching and all local dimensions at least three, the image closure has dimension N_* - |E_*| + dim P(G) + 1, where E_* is the set of edges lying in some perfect matching, N_* is the number of parameters on those edges and P(G) is the perfect matching polytope; on those edges the generic differential kernel consists of the edge rescalings that preserve every matching term. For complete support at every even order at least four and all local dimensions at least three, the entire fibre over a general output is a single vertex-rescaling orbit, and a normalized representative is a rational function of the output. The proof recovers cofactor lines from tangent spaces and glues lower-order representations, allowing vanishing cofactors. For complete support at every even order at least six, the dimension formula and the vertex-rescaling kernel remain valid when the local dimensions are only two. At four vertices we determine the dimension in every format with local dimensions at least two. Files. paper.pdf is the manuscript, revision 4 (25 pages). paper.tex is its LaTeX source. The other ten files are the contents of the directory verification/ that the paper refers to: five standard-library Python programs (verify_qubit_certificates.py, verify_qubit_from_matchings.py, check_graph.py, independent_rank_check.py, verify_four.py) and five JSON files holding their certificates and recorded results. The SHA-256 values of the five programs are printed in the final section of the paper. To run the programs, keep the ten files together in one folder. Prior work. Earlier results are credited in Section 1 and in the references of the paper. Disclosure. AI systems from OpenAI, working under the direction of the person who publishes as Ignoramus, developed the statements and proofs, performed the computations and wrote the first three versions; each version was reviewed by Claude (Anthropic), also an AI system, and the edits of this fourth version were written and checked by Claude agents. The final section of the paper sets this out in full. No AI system is an author; the author publishes under a pseudonym. The author has not checked the proofs, and no human mathematician has checked the manuscript. Two determinant computations in one proof can be replayed with the accompanying programs; the remaining arguments are analytic. The AI reviews are not human refereeing, peer review or a certification of originality, and novelty and significance are not established. The manuscript is a draft for mathematical review. Corrections are welcome at ignoramus110926@gmail.com.

•Nov 10, 2026•0 citations
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.
The paper asks whether infinitesimal virtual-bond gauge transformations exhaust tensor variations that leave a PEPS state unchanged, and which physical variations the same representation cannot produce. It treats weighted graph states (WGS) on finite graphs with equal physical and bond dimension d=D=q≥2d=D=q\ge2d=D=q≥2, invertible nonzero phase weights, and arbitrary independent tensor variations.
Dividing a single-tensor variation by the WGS amplitude identifies it with an arbitrary function on that vertex’s closed neighborhood. Product Fourier characters then give the exact differential image, rank, and kernel: accessible supports lie inside at least one closed neighborhood, while repeated supports generate kernel relations. Ordinary bond gauge has rank E(q2−1)+N−1E(q^2-1)+N-1E(q2−1)+N−1. On periodic regular-polygon tilings, non-bond relations are generated by triangles, chordless squares, and shared-edge diamonds; honeycomb has none. Blocking arguments, injectivity witnesses, and exact integer minors establish generic gauge completeness for 33 studied graph families at every q≥2q\ge2q≥2 and six more at q=2q=2q=2, under specified period conditions, identifying the WGS excess nullity as a parametrization rank drop.
The image yields an exact TDVP projector and residual. Transverse-field Ising velocities are tangent at every admissible WGS point, whereas nearest-neighbor XXXXXX and YYYYYY velocities are absent at graph states on all eleven Archimedean tilings. Schmidt bounds additionally exclude any same-graph bond-two representation after a small single-edge coherent XXXXXX error on sufficiently large honeycomb and square tori. These are representation-specific, instantaneous tangent results; unequal dimensions, degenerate weights, general triangle-relation integrability, and six higher-qqq generic-completeness cases remain unresolved.
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 identifi Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Abstract Projected entangled pair states (PEPS) are very useful in the description of strongly correlated systems, partly because they allow encoding symmetries, either global or local (gauge), naturally. In recent years, PEPS with local symmetries have increasingly been used in the study of non-perturbative regimes of lattice gauge theories, most prominently as a way to construct variational ansatz states depending only on a small number of parameters and yet capturing the relevant physical properties. For the case of one-dimensional PEPS (matrix product states—MPS) a bidirectional connection was established between the internal structure of the tensor network, i.e. the mathematical properties of the constituent tensors, and the symmetry. In higher dimensions this has only been done for global symmetries, where in the local (gauge) case it is known only how to construct gauge-invariant states, but not what the symmetry implies on the internal structure of the PEPS. In the present work we complete this missing piece and study the internal structure of PEPS with a gauge symmetry. The PEPS we consider consist of matter and gauge field tensors placed on the vertices and edges, respectively, of arbitrary graphs.
We introduce a gauge-propagation approach for approximately converting generic tensor-network states into an isometric tensor-network form with a prescribed orthogonality center. In one dimension, this propagation is exact because the non-isometric factor produced by a QR or singular-value decomposition is supported on a single virtual bond. In higher-dimensional networks, however, a local step can have several outgoing directions, and the residual factor is generally not separable into independent single-bond contributions. We address this local obstruction by approximating a local tensor, or a contracted local cluster, by structured terms consisting of an isometric factor multiplied by a tensor product of output-leg factors. The isometric factor is retained at the current site or cluster, while the output-leg factors are absorbed into neighboring tensors along the propagation directions. This construction applies to general local input-output partitions for which the input-side dimension is no smaller than the output-side dimension and provides a local truncation criterion for gauge propagation. Benchmarks on random tensors show that the proposed decomposition is effective in the low-term regime and that the residual decreases for larger local clusters. For the loop-gas tensor representation of the Kitaev spin liquid, two structured terms reduce the local residual to numerical precision, and the same cluster refinement further lowers the leading-term truncation error and reduces error accumulation during gauge propagation on a finite honeycomb network. These results identify a propagation-compatible local decomposition as a useful building block for approximate isometrization and as a potential initializer or preconditioner for variational isoTNS algorithms.
We propose a single-layer tensor network framework for the variational determination of ground states in two-dimensional quantum lattice models. By combining the nested tensor network method [Phys. Rev. B 96, 045128 (2017)] with the automatic differentiation technique, our approach can reduce the computational cost by three orders of magnitude in bond dimension, and therefore enables highly efficient variational ground-state calculations. We demonstrate the capability of this framework through two quantum spin models: the antiferromagnetic Heisenberg model on a square lattice and the frustrated Shastry-Sutherland model. Even without GPU acceleration or symmetry implementation, we have achieved a bond dimension of nine and obtained accurate ground-state energy and consistent order parameters compared to prior studies. In particular, we confirm the existence of an intermediate empty-plaquette valence bond solid ground state in the Shastry-Sutherland model. We have further discussed the convergence of the algorithm and its potential improvements. Our work provides a promising route for large-scale tensor network calculations of two-dimensional quantum systems.
Tensor networks have a gauge degree of freedom on the virtual degrees of freedom that are contracted. A canonical form is a choice of fixing this degree of freedom. For matrix product states, choosing a canonical form is a powerful tool, both for theoretical and numerical purposes. On the other hand, for tensor networks in dimension two or greater there is only limited understanding of the gauge symmetry. Here we introduce a new canonical form, the minimal canonical form, which applies to projected entangled pair states (PEPS) in any dimension, and prove a corresponding fundamental theorem. Already for matrix product states this gives a new canonical form, while in higher dimensions it is the first rigorous definition of a canonical form valid for any choice of tensor. We show that two tensors have the same minimal canonical forms if and only if they are gauge equivalent up to taking limits; moreover, this is the case if and only if they give the same quantum state for any geometry. In particular, this implies that the latter problem is decidable – in contrast to the well-known undecidability for equality of PEPS on grids. We also provide rigorous algorithms for computing minimal canonical forms. To achieve this we draw on geometric invariant theory and recent progress in theoretical computer science in non-commutative group optimization.
Give each vertex i of a graph a complex vector space V_i, place a tensor W_ij in V_i ⊗ V_j on each edge, and sum the tensor products of these edge tensors over all perfect matchings. We study the image of this matching-tensor map and the recovery of the edge tensors from its output. For every support graph with a perfect matching and all local dimensions at least three, the image closure has dimension N_* - |E_*| + dim P(G) + 1, where E_* is the set of edges lying in some perfect matching, N_* is the number of parameters on those edges and P(G) is the perfect matching polytope; on those edges the generic differential kernel consists of the edge rescalings that preserve every matching term. For complete support at every even order at least four and all local dimensions at least three, the entire fibre over a general output is a single vertex-rescaling orbit, and a normalized representative is a rational function of the output. The proof recovers cofactor lines from tangent spaces and glues lower-order representations, allowing vanishing cofactors. For complete support at every even order at least six, the dimension formula and the vertex-rescaling kernel remain valid when the local dimensions are only two. At four vertices we determine the dimension in every format with local dimensions at least two. Files. paper.pdf is the manuscript, revision 4 (25 pages). paper.tex is its LaTeX source. The other ten files are the contents of the directory verification/ that the paper refers to: five standard-library Python programs (verify_qubit_certificates.py, verify_qubit_from_matchings.py, check_graph.py, independent_rank_check.py, verify_four.py) and five JSON files holding their certificates and recorded results. The SHA-256 values of the five programs are printed in the final section of the paper. To run the programs, keep the ten files together in one folder. Prior work. Earlier results are credited in Section 1 and in the references of the paper. Disclosure. AI systems from OpenAI, working under the direction of the person who publishes as Ignoramus, developed the statements and proofs, performed the computations and wrote the first three versions; each version was reviewed by Claude (Anthropic), also an AI system, and the edits of this fourth version were written and checked by Claude agents. The final section of the paper sets this out in full. No AI system is an author; the author publishes under a pseudonym. The author has not checked the proofs, and no human mathematician has checked the manuscript. Two determinant computations in one proof can be replayed with the accompanying programs; the remaining arguments are analytic. The AI reviews are not human refereeing, peer review or a certification of originality, and novelty and significance are not established. The manuscript is a draft for mathematical review. Corrections are welcome at ignoramus110926@gmail.com.