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:2210.12151 · Quantum

Quantum Gauge Networks: A New Kind of Tensor Network

Kevin Slagle

Published Sep 14, 2023• 3 citations
arXivHTMLPDF

Abstract

Although tensor networks are powerful tools for simulating low-dimensional quantum physics, tensor network algorithms are very computationally costly in higher spatial dimensions. We introduce quantum gauge networks : a different kind of tensor network ansatz for which the computation cost of simulations does not explicitly increase for larger spatial dimensions. We take inspiration from the gauge picture of quantum dynamics, which consists of a local wavefunction for each patch of space, with neighboring patches related by unitary connections. A quantum gauge network (QGN) has a similar structure, except the Hilbert space dimensions of the local wavefunctions and connections are truncated. We describe how a QGN can be obtained from a generic wavefunction or matrix product state (MPS). All 2k -point correlation functions of any wavefunction for M many operators can be encoded exactly by a QGN with bond dimension O(Mk) . In comparison, for just k=1 , an exponentially larger bond dimension of 2M/6 is generically required for an MPS of qubits. We provide a simple QGN algorithm for approximate simulations of quantum dynamics in any spatial dimension. The approximate dynamics can achieve exact energy conservation for time-independent Hamiltonians, and spatial symmetries can also be maintained exactly. We benchmark the algorithm by simulating the quantum quench of fermionic Hamiltonians in up to three spatial dimensions.

DOI
10.22331/q-2023-09-14-1113

Related papers

The Gauge Picture of Quantum Dynamics

Kevin Slagle

Although local Hamiltonians exhibit local time dynamics, this locality is not explicit in the Schrödinger picture in the sense that the wavefunction amplitudes do not obey a local equation of motion. We show that geometric locality can be achieved explicitly in the equations of motion by "gauging" the global unitary invariance of quantum mechanics into a local gauge invariance. That is, expectation values ⟨ψ|A|ψ⟩ are invariant under a global unitary transformation acting on the wavefunction |ψ⟩→U|ψ⟩ and operators A→UAU† , and we show that it is possible to gauge this global invariance into a local gauge invariance. To do this, we replace the wavefunction with a collection of local wavefunctions |ψJ⟩ , one for each patch of space J . The collection of spatial patches is chosen to cover the space; e.g. we could choose the patches to be single qubits or nearest-neighbor sites on a lattice. Local wavefunctions associated with neighboring pairs of spatial patches I and J are related to each other by dynamical unitary transformations UIJ . The local wavefunctions are local in the sense that their dynamics are local. That is, the equations of motion for the local wavefunctions |ψJ⟩ and connections UIJ are explicitly local in space and only depend on nearby Hamiltonian terms. (The local wavefunctions are many-body wavefunctions and have the same Hilbert space dimension as the usual wavefunction.) We call this picture of quantum dynamics the gauge picture since it exhibits a local gauge invariance. The local dynamics of a single spatial patch is related to the interaction picture, where the interaction Hamiltonian consists of only nearby Hamiltonian terms. We can also generalize the explicit locality to include locality in local charge and energy densities.

arXiv:2210.09314•Quantum•Mar 21, 2024•3 citations

A Parallel Tensor Network Contraction Algorithm and Its Applications in Quantum Computation

Fang Zhang

Tensors are a natural generalization of matrices, and tensor networks are a natural generalization of matrix products. Despite the simple definition of tensor networks, they are versatile enough to represent many different kinds of "products" that arise in various theoretical and practical problems. In particular, the powerful computational model of quantum computation can be defined almost entirely in terms of matrix products and tensor products, both of which are special cases of tensor networks. As such, (classical) algorithms for evaluating tensor networks have profound importance in the study of quantum computation. In this thesis, we design and implement a parallel algorithm for tensor network contraction. In addition to finding efficient contraction orders for a tensor network, we also dynamically slice it into multiple sub-tasks with lower space and time costs, in order to evaluate the tensor network in parallel. We refer to such an evaluation strategy as a contraction scheme for the tensor network. In addition, we introduce a local optimization procedure that improves the efficiency of the contraction schemes we find. We also investigate the applications of our parallel tensor network contraction algorithm in quantum computation. The most ready application is the simulation of random quantum supremacy circuits, where we benchmark our algorithm to demonstrate its advantage over other similar tensor network based simulators. Other applications we found include evaluating the energy function of a Quantum Approximate Optimization Algorithm (QAOA), and simulating surface codes under a realistic error model with crosstalk.

•Jan 1, 2020•0 citations

Classical versus quantum: Comparing tensor-network-based quantum circuits on Large Hadron Collider data

Jack Y. Araz, Michael Spannowsky

Tensor networks (TN) are approximations of high-dimensional tensors designed to represent locally entangled quantum many-body systems efficiently. This paper provides a comprehensive comparison between classical TNs and TN-inspired quantum circuits in the context of machine learning on highly complex, simulated Large Hadron Collider data. We show that classical TNs require exponentially large bond dimensions and higher Hilbert-space mapping to perform comparably to their quantum counterparts. While such an expansion in the dimensionality allows better performance, we observe that, with increased dimensionality, classical TNs lead to a highly flat loss landscape, rendering the usage of gradient-based optimization methods highly challenging. Furthermore, by employing quantitative metrics, such as the Fisher information and effective dimensions, we show that classical TNs require a more extensive training sample to represent the data as efficiently as TN-inspired quantum circuits. We also engage with the idea of hybrid classical-quantum TNs and show possible architectures to employ a larger phase space from the data. We offer our results using three main TN Ans\"atze: Tree tensor networks, matrix product states, and multiscale entanglement renormalization Ans\"atze.

arXiv:2202.10471•Physical Review A•Dec 19, 2022•44 citations

Exact tensor network ansatz for strongly interacting systems

Michael P. Zaletel

It appears that the tensor network ansatz, while not quite complete, is an efficient coordinate system for the tiny subset of a many-body Hilbert space which can be realized as a low energy state of a local Hamiltonian.However, we don't fully understand precisely which phases are captured by the tensor network ansatz, how to compute their physical observables (even numerically), or how to compute a tensor network representation for a ground state given a microscopic Hamiltonian. These questions are algorithmic in nature, but their resolution is intimately related to understanding the nature of quantum entanglement in many-body systems.For this reason it is useful to compute the tensor network representation of various `model' wavefunctions representative of different phases of matter; this allows us to understand how the entanglement properties of each phase are expressed in the tensor network ansatz, and can serve as test cases for algorithm development.Condensed matter physics has many illuminating model wavefunctions, such as Laughlin's celebrated wave function for the fractional quantum Hall effect, the Bardeen-Cooper-Schrieffer wave function for superconductivity, and Anderson's resonating valence bond ansatz for spin liquids.This thesis presents some results on exact tensor network representations of these model wavefunctions. In addition, a tensor network representation is given for the time evolution operator of a long-range one-dimensional Hamiltonian, which allows one to numerically simulate the time evolution of power-law interacting spin chains as well as two-dimensional strips and cylinders.

•Jan 1, 2014•0 citations

Efficient Simulation of the 2D Hubbard Model via Hilbert Space-Filling Curve Mapping

Ashkan Abedi, Vittorio Giovannetti, Dario De Santis

We investigate tensor network simulations of the two-dimensional Hubbard model by mapping the lattice onto a one-dimensional chain using space-filling curves. In particular, we focus on the Hilbert curve, whose locality-preserving structure minimizes the range of effective interactions in the mapped model. This enables a more compact matrix product state (MPS) representation compared to conventional snake mapping. Through systematic benchmarks, we show that the Hilbert curve consistently yields lower ground-state energies at fixed bond dimension, with the advantage increasing for larger system sizes and in physically relevant interaction regimes. Our implementation reaches clusters up to $32\times32$ sites with open and periodic boundary conditions, delivering reliable ground-state energies and correlation functions in agreement with established results, but at significantly reduced computational cost. These findings establish space-filling curve mappings, particularly the Hilbert curve, as a powerful tool for extending tensor-network studies of strongly correlated two-dimensional quantum systems beyond the limits accessible with standard approaches.

quant-pharXiv:2512.02666•New Journal of Physics•Dec 3, 2025•2 citations

Tensor network approaches: Ground states and dynamics in quantum many-body systems

Ho N. Phien

The study of interacting quantum many-body systems is one of the central challenges in modern physics. Interestingly, by understanding the physical properties of such systems from a microscopic description, one can explain many complex quantum phenomena such as the high-temperature superconductivity, fractional quantum Hall effect, etc. However, due to high complexity of these systems, theoretical investigations such as analytical and perturbation theories are limited to studying only a small subset of problems. In the past few decades, numerical simulation has emerged as an indispensable method for studying many phenomena, and has led to immense success and progress in recent years. The main obstacle in addressing quantum many-body systems is that the number of parameters required to represent a state of the system scales exponentially with the system size. However, one hardly needs the full Hilbert space but only a small subspace to describe physical properties of the system. From the point of view in quantum information theory, quantum entanglement is one of the main factors that is responsible for the complexity of studying quantum many-body systems. In particular, the amount of quantum entanglement in such system quantifies the correlation between constituents and therefore it determines how big the subspace is required to represent the system. In this thesis, we are interested in using tensor network states, a new emerging numerical technique to study dynamical and ground state properties of the system. The key ingredient is that a tensor network state which consists of a fairly small number of parameters can represent very well the complete wave function of a system. In one spatial dimension, Matrix Product State (MPS) has become a standard tool, combined with related algorithms such as Time Evolving Block Decimation algorithm (TEBD) to study dynamical properties of a locally-perturbed quantum lattice system. In this thesis, we introduce a technique called ``infinite boundary conditions'' that allows us to use a finite-size MPS to represent the state of an infinite-size system. As a result, one can simulate dynamics of a system for a longer time with a significant computational cost reduction compared to traditional methods. In two spatial dimensions, the tensor network known as Projected Entangled Pair States (PEPS) is emerging as a useful approach. However algorithms for optimizing the matrix elements of these tensors are complex and not very efficient. In particular, the efficiency of the optimization depends critically on the quality of the so-called ``environment'', which is expensive to compute. We have introduced a new method to accelerate the convergence of calculating the PEPS ground state by recycling the environment tensors for many optimization steps, vastly reducing the number of times that the full environment needs to be calculated.

•Jan 1, 2013•0 citations
Although tensor networks are powerful tools for simulating low-dimensional quantum physics, tensor network algorithms are very computationally costly in higher spatial dimensions. We introduce quantum gauge networks : a different kind of tensor network ansatz for which the computation cost of simulations does not explicitly increase for larger spatial dimensions. We take inspiration from the gauge picture of quantum dynamics, which consists of a local wavefunction for each patch of space, with neighboring patches related by unitary connections. A quantum gauge network (QGN) has a similar structure, except the Hilbert space dimensions of the local wavefunctions and connections are truncated. We describe how a QGN can be obtained from a generic wavefunction or matrix product state (MPS). All 2k -point correlation functions of any wavefunction for M many operators can be encoded exactly by a QGN with bond dimension O(Mk) . In comparison, for just k=1 , an exponentially larger bond dimension of 2M/6 is generically required for an MPS of qubits. We provide a simple QGN algorithm for approximate simulations of quantum dynamics in any spatial dimension. The approximate dynamics can achieve exact energy conservation for time-independent Hamiltonians, and spatial symmetries can also be maintained exactly. We benchmark the algorithm by simulating the quantum quench of fermionic Hamiltonians in up to three spatial dimensions.
Although local Hamiltonians exhibit local time dynamics, this locality is not explicit in the Schrödinger picture in the sense that the wavefunction amplitudes do not obey a local equation of motion. We show that geometric locality can be achieved explicitly in the equations of motion by "gauging" the global unitary invariance of quantum mechanics into a local gauge invariance. That is, expectation values ⟨ψ|A|ψ⟩ are invariant under a global unitary transformation acting on the wavefunction |ψ⟩→U|ψ⟩ and operators A→UAU† , and we show that it is possible to gauge this global invariance into a local gauge invariance. To do this, we replace the wavefunction with a collection of local wavefunctions |ψJ⟩ , one for each patch of space J . The collection of spatial patches is chosen to cover the space; e.g. we could choose the patches to be single qubits or nearest-neighbor sites on a lattice. Local wavefunctions associated with neighboring pairs of spatial patches I and J are related to each other by dynamical unitary transformations UIJ . The local wavefunctions are local in the sense that their dynamics are local. That is, the equations of motion for the local wavefunctions |ψJ⟩ and connections UIJ are explicitly local in space and only depend on nearby Hamiltonian terms. (The local wavefunctions are many-body wavefunctions and have the same Hilbert space dimension as the usual wavefunction.) We call this picture of quantum dynamics the gauge picture since it exhibits a local gauge invariance. The local dynamics of a single spatial patch is related to the interaction picture, where the interaction Hamiltonian consists of only nearby Hamiltonian terms. We can also generalize the explicit locality to include locality in local charge and energy densities.
Tensors are a natural generalization of matrices, and tensor networks are a natural generalization of matrix products. Despite the simple definition of tensor networks, they are versatile enough to represent many different kinds of "products" that arise in various theoretical and practical problems. In particular, the powerful computational model of quantum computation can be defined almost entirely in terms of matrix products and tensor products, both of which are special cases of tensor networks. As such, (classical) algorithms for evaluating tensor networks have profound importance in the study of quantum computation. In this thesis, we design and implement a parallel algorithm for tensor network contraction. In addition to finding efficient contraction orders for a tensor network, we also dynamically slice it into multiple sub-tasks with lower space and time costs, in order to evaluate the tensor network in parallel. We refer to such an evaluation strategy as a contraction scheme for the tensor network. In addition, we introduce a local optimization procedure that improves the efficiency of the contraction schemes we find. We also investigate the applications of our parallel tensor network contraction algorithm in quantum computation. The most ready application is the simulation of random quantum supremacy circuits, where we benchmark our algorithm to demonstrate its advantage over other similar tensor network based simulators. Other applications we found include evaluating the energy function of a Quantum Approximate Optimization Algorithm (QAOA), and simulating surface codes under a realistic error model with crosstalk.
Tensor networks (TN) are approximations of high-dimensional tensors designed to represent locally entangled quantum many-body systems efficiently. This paper provides a comprehensive comparison between classical TNs and TN-inspired quantum circuits in the context of machine learning on highly complex, simulated Large Hadron Collider data. We show that classical TNs require exponentially large bond dimensions and higher Hilbert-space mapping to perform comparably to their quantum counterparts. While such an expansion in the dimensionality allows better performance, we observe that, with increased dimensionality, classical TNs lead to a highly flat loss landscape, rendering the usage of gradient-based optimization methods highly challenging. Furthermore, by employing quantitative metrics, such as the Fisher information and effective dimensions, we show that classical TNs require a more extensive training sample to represent the data as efficiently as TN-inspired quantum circuits. We also engage with the idea of hybrid classical-quantum TNs and show possible architectures to employ a larger phase space from the data. We offer our results using three main TN Ans\"atze: Tree tensor networks, matrix product states, and multiscale entanglement renormalization Ans\"atze.
It appears that the tensor network ansatz, while not quite complete, is an efficient coordinate system for the tiny subset of a many-body Hilbert space which can be realized as a low energy state of a local Hamiltonian.However, we don't fully understand precisely which phases are captured by the tensor network ansatz, how to compute their physical observables (even numerically), or how to compute a tensor network representation for a ground state given a microscopic Hamiltonian. These questions are algorithmic in nature, but their resolution is intimately related to understanding the nature of quantum entanglement in many-body systems.For this reason it is useful to compute the tensor network representation of various `model' wavefunctions representative of different phases of matter; this allows us to understand how the entanglement properties of each phase are expressed in the tensor network ansatz, and can serve as test cases for algorithm development.Condensed matter physics has many illuminating model wavefunctions, such as Laughlin's celebrated wave function for the fractional quantum Hall effect, the Bardeen-Cooper-Schrieffer wave function for superconductivity, and Anderson's resonating valence bond ansatz for spin liquids.This thesis presents some results on exact tensor network representations of these model wavefunctions. In addition, a tensor network representation is given for the time evolution operator of a long-range one-dimensional Hamiltonian, which allows one to numerically simulate the time evolution of power-law interacting spin chains as well as two-dimensional strips and cylinders.
We investigate tensor network simulations of the two-dimensional Hubbard model by mapping the lattice onto a one-dimensional chain using space-filling curves. In particular, we focus on the Hilbert curve, whose locality-preserving structure minimizes the range of effective interactions in the mapped model. This enables a more compact matrix product state (MPS) representation compared to conventional snake mapping. Through systematic benchmarks, we show that the Hilbert curve consistently yields lower ground-state energies at fixed bond dimension, with the advantage increasing for larger system sizes and in physically relevant interaction regimes. Our implementation reaches clusters up to 32×3232\times3232×32 sites with open and periodic boundary conditions, delivering reliable ground-state energies and correlation functions in agreement with established results, but at significantly reduced computational cost. These findings establish space-filling curve mappings, particularly the Hilbert curve, as a powerful tool for extending tensor-network studies of strongly correlated two-dimensional quantum systems beyond the limits accessible with standard approaches.
The study of interacting quantum many-body systems is one of the central challenges in modern physics. Interestingly, by understanding the physical properties of such systems from a microscopic description, one can explain many complex quantum phenomena such as the high-temperature superconductivity, fractional quantum Hall effect, etc. However, due to high complexity of these systems, theoretical investigations such as analytical and perturbation theories are limited to studying only a small subset of problems. In the past few decades, numerical simulation has emerged as an indispensable method for studying many phenomena, and has led to immense success and progress in recent years. The main obstacle in addressing quantum many-body systems is that the number of parameters required to represent a state of the system scales exponentially with the system size. However, one hardly needs the full Hilbert space but only a small subspace to describe physical properties of the system. From the point of view in quantum information theory, quantum entanglement is one of the main factors that is responsible for the complexity of studying quantum many-body systems. In particular, the amount of quantum entanglement in such system quantifies the correlation between constituents and therefore it determines how big the subspace is required to represent the system. In this thesis, we are interested in using tensor network states, a new emerging numerical technique to study dynamical and ground state properties of the system. The key ingredient is that a tensor network state which consists of a fairly small number of parameters can represent very well the complete wave function of a system. In one spatial dimension, Matrix Product State (MPS) has become a standard tool, combined with related algorithms such as Time Evolving Block Decimation algorithm (TEBD) to study dynamical properties of a locally-perturbed quantum lattice system. In this thesis, we introduce a technique called ``infinite boundary conditions'' that allows us to use a finite-size MPS to represent the state of an infinite-size system. As a result, one can simulate dynamics of a system for a longer time with a significant computational cost reduction compared to traditional methods. In two spatial dimensions, the tensor network known as Projected Entangled Pair States (PEPS) is emerging as a useful approach. However algorithms for optimizing the matrix elements of these tensors are complex and not very efficient. In particular, the efficiency of the optimization depends critically on the quality of the so-called ``environment'', which is expensive to compute. We have introduced a new method to accelerate the convergence of calculating the PEPS ground state by recycling the environment tensors for many optimization steps, vastly reducing the number of times that the full environment needs to be calculated.