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:0904.1925 · New Journal of Physics

Concatenated tensor network states

R Hübener, V Nebendahl, Wolfgang Dür

Published Feb 26, 2010• 45 citations
arXivHTMLPDF

Abstract

We introduce the concept of concatenated tensor networks to efficiently describe quantum states. We show that the corresponding concatenated tensor network states can efficiently describe time evolution and possess arbitrary block-wise entanglement and long-ranged correlations. We illustrate the approach for the enhancement of matrix product states, i.e. one-dimensional (1D) tensor networks, where we replace each of the matrices of the original matrix product state with another 1D tensor network. This procedure yields a 2D tensor network, which includes—already for tensor dimension 2—all states that can be prepared by circuits of polynomially many (possibly non-unitary) two-qubit quantum operations, as well as states resulting from time evolution with respect to Hamiltonians with short-ranged interactions. We investigate the possibility of efficiently extracting information from these states, which serves as the basic step in a variational optimization procedure. To this aim, we utilize the known exact and approximate methods for 2D tensor networks and demonstrate some improvements thereof, which are also applicable e.g. in the context of 2D projected entangled pair states. We generalize the approach to higher dimensional and tree tensor networks.

DOI
10.1088/1367-2630/12/2/025004

Related papers

Tensor operators: Constructions and applications for long-range interaction systems

Florian Fröwis, Volckmar Nebendahl, Wolfgang Dür

We consider the representation of operators in terms of tensor networks and their application to the ground-state approximation and time evolution of systems with long-range interactions. We provide an explicit construction to represent an arbitrary many-body Hamilton operator in terms of a one-dimensional tensor network (i.e., as a matrix product operator). For pairwise interactions, we show that such a representation is always efficient and requires a tensor dimension growing only linearly with the number of particles. For systems obeying certain symmetries or restrictions we find optimal representations with minimal tensor dimension. We discuss the analytic and numerical approximation of operators in terms of low-dimensional tensor operators. We demonstrate applications for time evolution and the ground-state approximation, in particular for long-range interaction with inhomogeneous couplings. The operator representations are also generalized to other geometries such as trees and two-dimensional lattices, where we show how to obtain and use efficient tensor network representations respecting a given geometry.

arXiv:1003.1047•Physical Review A•Jun 25, 2010•98 citations

Tensor-network-assisted variational quantum algorithm

Junxiang Huang, Wenhao He, Yukun Zhang +3 more

Near-term quantum devices generally suffer from shallow circuit depth and hence limited expressivity due to noise and decoherence. To address this, we propose tensor-network-assisted parametrized quantum circuits, which concatenate a classical tensor-network operator with a quantum circuit to effectively increase the circuit's expressivity without requiring a physically deeper circuit. We present a framework for tensor-network-assisted variational quantum algorithms that can solve quantum many-body problems using shallower quantum circuits. We demonstrate the efficiency of this approach by considering two examples of unitary matrix-product operators and unitary tree tensor networks, showing that they can both be implemented efficiently. Through numerical simulations, we show that the expressivity of these circuits is greatly enhanced with the assistance of tensor networks. We apply our method to two-dimensional Ising models and one-dimensional time-crystal Hamiltonian models with up to 16 qubits and demonstrate that our approach consistently outperforms conventional methods using shallow quantum circuits.

arXiv:2212.10421•Physical Review A•Nov 7, 2023•19 citations

Simplified and improved approach to tensor network operators in two dimensions

Matthew J. O’Rourke, Garnet Kin‐Lic Chan

Matrix product states and matrix product operators (MPOs) are one-dimensional tensor networks that underlie the modern density matrix renormalization group (DMRG) algorithm. The use of MPOs accounts for the high level of generality and wide range of applicability of DMRG. However, current algorithms for two-dimensional (2D) tensor network states, known as projected entangled-pair states, rarely employ the associated 2D tensor network operators, projected entangled-pair operators (PEPOs), due to their computational cost and conceptual complexity. To lower these two barriers, we describe how to reformulate a PEPO into a set of tensor network operators that resemble MPOs by considering the different sets of local operators that are generated from sequential bipartitions of the 2D system. The expectation value of a PEPO can then be evaluated on the fly using only the action of MPOs and generalized MPOs at each step of the approximate contraction of the 2D tensor network. This technique allows for the simpler construction and more efficient energy evaluation of 2D Hamiltonians that contain finite-range interactions, and provides an improved strategy to encode long-range interactions that is orders of magnitude more accurate and efficient than existing schemes.

arXiv:1911.04592•Physical review. B./Physical review. B•May 22, 2020•10 citations

Introduction to matrix-product states and tensor networks

Grégoire Misguich

These notes provide an introduction to tensor-network methods in quantum many-body physics, with an emphasis on matrix-product states (MPS). They develop the basic tensor-network language, including graphical notation, virtual indices, bond dimensions, gauge freedom, canonical forms, QR and singular-value decompositions, and the role of entanglement in controlling the efficiency of the representation. The main MPS algorithms are then introduced, including contractions, correlation functions, matrix-product operators, DMRG, and time-evolution methods. The notes also briefly discuss projected entangled-pair states (PEPS) as a higher-dimensional generalization of MPS, together with the basic ideas behind approximate PEPS contraction. Finally, tensor-network representations of mixed states, quantum channels, and Lindblad dynamics are presented, with applications to thermal states and open quantum systems. The presentation is accompanied by short Julia code examples based on ITensor, ITensorMPS, and TensorMixedStates. These notes were written for the 9th Les Houches Summer School on Computational Physics: Open Quantum Systems, held in June 2026.

cond-mat.str-elCross-listedarXiv:2606.24803•Jun 24, 2026•3 citations

Efficient 2D Tensor Network Simulation of Quantum Systems

Yuchen Pang, Tianyi Hao, Annika Dugad +2 more

Simulation of quantum systems is challenging due to the exponential size of the state space. Tensor networks provide a systematically improvable approximation for quantum states. 2D tensor networks such as Projected Entangled Pair States (PEPS) are well-suited for key classes of physical systems and quantum circuits. However, direct contraction of PEPS networks has exponential cost, while approximate algorithms require computations with large tensors. We propose new scalable algorithms and software abstractions for PEPS-based methods, accelerating the bottleneck operation of contraction and refactorization of a tensor subnetwork. We employ randomized SVD with an implicit matrix to reduce cost and memory footprint asymptotically. Further, we develop a distributed-memory PEPS library and study accuracy and efficiency of alternative algorithms for PEPS contraction and evolution on the Stampede2 supercomputer. We also simulate a popular near-term quantum algorithm, the Variational Quantum Eigensolver (VQE), and benchmark Imaginary Time Evolution (ITE), which compute ground states of Hamiltonians.

arXiv:2006.15234•International Conference for High Performance Computing, Networking, Storage and Analysis (SC)•Nov 1, 2020•21 citations

Application of Tensor Network State Method to 1D Quantum Systems

蕭仲評

In this thesis, we use the new numerical method multiscale entanglement renormalization ansatz (MERA) to study the one dimensional spin system. This method, MERA, utilizes a network of tensors to represent quantum many-body systems on a lattice. Other examples of tensor network state are matrix product states (MPSs) for 1D systems, tree tensor networks (TTNs) for systems with a tree shape, and projected entangled-pair states (PEPSs) for 2D systems and be- yond. The three structures dier in the graph that denes how the tensors are interconnected into a network: The graphs for MPSs, TTNs, and 2D PEPSs are, respectively, a chain, a tree, and a 2D lattice. Importantly, from these tensor networks the expectation value of local observables can be computed eciently. Developing algorithms to simulate quantum many-body systems is important for understanding and studying the physical principles. And these may become powerful tools for the analysis of quantum computation and quantum information theory. But in general ecient simulation is dicult, due to the fundamental quantum physical laws. The main method we have studied and worked on is multiscale entangle- ment renormalization ansatz (MERA) which is a variational ansatz for many- body states. MERA is a tree tensor network for 1D, 2D systems and beyond. We have developed code of ternary-MERA to compute the ground state energy, expected values of local observables, and correlators for 1D lattice systems. In a nutshell, MERA is an algorithm for entanglement renormalization which is a numerical technique based on locally reorganizing the Hilbert space of a quantum many-body system with the aim to reduce the amount of entanglement in its wave function. We use this method to study 1D Ising model, XXZ model, and J1 - J2 model, and then comparing the numerical results with exact diagonalization (ED) and density matrix renormalization group (DMRG).

•Jan 1, 2010•0 citations
We introduce the concept of concatenated tensor networks to efficiently describe quantum states. We show that the corresponding concatenated tensor network states can efficiently describe time evolution and possess arbitrary block-wise entanglement and long-ranged correlations. We illustrate the approach for the enhancement of matrix product states, i.e. one-dimensional (1D) tensor networks, where we replace each of the matrices of the original matrix product state with another 1D tensor network. This procedure yields a 2D tensor network, which includes—already for tensor dimension 2—all states that can be prepared by circuits of polynomially many (possibly non-unitary) two-qubit quantum operations, as well as states resulting from time evolution with respect to Hamiltonians with short-ranged interactions. We investigate the possibility of efficiently extracting information from these states, which serves as the basic step in a variational optimization procedure. To this aim, we utilize the known exact and approximate methods for 2D tensor networks and demonstrate some improvements thereof, which are also applicable e.g. in the context of 2D projected entangled pair states. We generalize the approach to higher dimensional and tree tensor networks.
We consider the representation of operators in terms of tensor networks and their application to the ground-state approximation and time evolution of systems with long-range interactions. We provide an explicit construction to represent an arbitrary many-body Hamilton operator in terms of a one-dimensional tensor network (i.e., as a matrix product operator). For pairwise interactions, we show that such a representation is always efficient and requires a tensor dimension growing only linearly with the number of particles. For systems obeying certain symmetries or restrictions we find optimal representations with minimal tensor dimension. We discuss the analytic and numerical approximation of operators in terms of low-dimensional tensor operators. We demonstrate applications for time evolution and the ground-state approximation, in particular for long-range interaction with inhomogeneous couplings. The operator representations are also generalized to other geometries such as trees and two-dimensional lattices, where we show how to obtain and use efficient tensor network representations respecting a given geometry.
Near-term quantum devices generally suffer from shallow circuit depth and hence limited expressivity due to noise and decoherence. To address this, we propose tensor-network-assisted parametrized quantum circuits, which concatenate a classical tensor-network operator with a quantum circuit to effectively increase the circuit's expressivity without requiring a physically deeper circuit. We present a framework for tensor-network-assisted variational quantum algorithms that can solve quantum many-body problems using shallower quantum circuits. We demonstrate the efficiency of this approach by considering two examples of unitary matrix-product operators and unitary tree tensor networks, showing that they can both be implemented efficiently. Through numerical simulations, we show that the expressivity of these circuits is greatly enhanced with the assistance of tensor networks. We apply our method to two-dimensional Ising models and one-dimensional time-crystal Hamiltonian models with up to 16 qubits and demonstrate that our approach consistently outperforms conventional methods using shallow quantum circuits.
Matrix product states and matrix product operators (MPOs) are one-dimensional tensor networks that underlie the modern density matrix renormalization group (DMRG) algorithm. The use of MPOs accounts for the high level of generality and wide range of applicability of DMRG. However, current algorithms for two-dimensional (2D) tensor network states, known as projected entangled-pair states, rarely employ the associated 2D tensor network operators, projected entangled-pair operators (PEPOs), due to their computational cost and conceptual complexity. To lower these two barriers, we describe how to reformulate a PEPO into a set of tensor network operators that resemble MPOs by considering the different sets of local operators that are generated from sequential bipartitions of the 2D system. The expectation value of a PEPO can then be evaluated on the fly using only the action of MPOs and generalized MPOs at each step of the approximate contraction of the 2D tensor network. This technique allows for the simpler construction and more efficient energy evaluation of 2D Hamiltonians that contain finite-range interactions, and provides an improved strategy to encode long-range interactions that is orders of magnitude more accurate and efficient than existing schemes.
These notes provide an introduction to tensor-network methods in quantum many-body physics, with an emphasis on matrix-product states (MPS). They develop the basic tensor-network language, including graphical notation, virtual indices, bond dimensions, gauge freedom, canonical forms, QR and singular-value decompositions, and the role of entanglement in controlling the efficiency of the representation. The main MPS algorithms are then introduced, including contractions, correlation functions, matrix-product operators, DMRG, and time-evolution methods. The notes also briefly discuss projected entangled-pair states (PEPS) as a higher-dimensional generalization of MPS, together with the basic ideas behind approximate PEPS contraction. Finally, tensor-network representations of mixed states, quantum channels, and Lindblad dynamics are presented, with applications to thermal states and open quantum systems. The presentation is accompanied by short Julia code examples based on ITensor, ITensorMPS, and TensorMixedStates. These notes were written for the 9th Les Houches Summer School on Computational Physics: Open Quantum Systems, held in June 2026.
Simulation of quantum systems is challenging due to the exponential size of the state space. Tensor networks provide a systematically improvable approximation for quantum states. 2D tensor networks such as Projected Entangled Pair States (PEPS) are well-suited for key classes of physical systems and quantum circuits. However, direct contraction of PEPS networks has exponential cost, while approximate algorithms require computations with large tensors. We propose new scalable algorithms and software abstractions for PEPS-based methods, accelerating the bottleneck operation of contraction and refactorization of a tensor subnetwork. We employ randomized SVD with an implicit matrix to reduce cost and memory footprint asymptotically. Further, we develop a distributed-memory PEPS library and study accuracy and efficiency of alternative algorithms for PEPS contraction and evolution on the Stampede2 supercomputer. We also simulate a popular near-term quantum algorithm, the Variational Quantum Eigensolver (VQE), and benchmark Imaginary Time Evolution (ITE), which compute ground states of Hamiltonians.
In this thesis, we use the new numerical method multiscale entanglement renormalization ansatz (MERA) to study the one dimensional spin system. This method, MERA, utilizes a network of tensors to represent quantum many-body systems on a lattice. Other examples of tensor network state are matrix product states (MPSs) for 1D systems, tree tensor networks (TTNs) for systems with a tree shape, and projected entangled-pair states (PEPSs) for 2D systems and be- yond. The three structures dier in the graph that denes how the tensors are interconnected into a network: The graphs for MPSs, TTNs, and 2D PEPSs are, respectively, a chain, a tree, and a 2D lattice. Importantly, from these tensor networks the expectation value of local observables can be computed eciently. Developing algorithms to simulate quantum many-body systems is important for understanding and studying the physical principles. And these may become powerful tools for the analysis of quantum computation and quantum information theory. But in general ecient simulation is dicult, due to the fundamental quantum physical laws. The main method we have studied and worked on is multiscale entangle- ment renormalization ansatz (MERA) which is a variational ansatz for many- body states. MERA is a tree tensor network for 1D, 2D systems and beyond. We have developed code of ternary-MERA to compute the ground state energy, expected values of local observables, and correlators for 1D lattice systems. In a nutshell, MERA is an algorithm for entanglement renormalization which is a numerical technique based on locally reorganizing the Hilbert space of a quantum many-body system with the aim to reduce the amount of entanglement in its wave function. We use this method to study 1D Ising model, XXZ model, and J1 - J2 model, and then comparing the numerical results with exact diagonalization (ED) and density matrix renormalization group (DMRG).