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

Efficient Adiabatic Preparation of Tensor Network States

Zhiyuan Wei, Daniel Malz, J. I. Cirac

Published Sep 2, 2022• 0 citations
arXivHTMLPDF

Abstract

We propose and study a specific adiabatic path to prepare those tensor network states that are unique ground states of few-body parent Hamiltonians in finite lattices, which include normal tensor network states, as well as other relevant nonnormal states. This path guarantees a gap for finite systems and allows for efficient numerical simulation. In one dimension, we numerically investigate the preparation of a family of states with varying correlation lengths and the one-dimensional Affleck-Kennedy-Lieb-Tasaki (AKLT) state and show that adiabatic preparation can be much faster than standard methods based on sequential preparation. We also apply the method to the two-dimensional AKLT state on the hexagonal lattice, for which no method based on sequential preparation is known, and show that it can be prepared very efficiently for relatively large lattices.

DOI
10.48550/arxiv.2209.01230

Related papers

Efficient adiabatic preparation of tensor network states

Zhi-Yuan Wei, Daniel Malz, J. I. Cirac

The Affleck-Kennedy-Lieb-Tasaki (AKLT) states have significant applications in condensed matter physics and quantum computation. An adiabatic path that enables the deterministic preparation of a broad range of many-body states, including AKLT states on arbitrary lattice geometries, is proposed. The numerical results on 1D and 2D AKLT states demonstrate the high efficiency of this approach.

Physical Review Research•May 22, 2023•22 citations

Spectral Gap Optimization for Enhanced Adiabatic State Preparation

Kshiti Sneh Rai, Jin-Fu Chen, Patrick Emonts +1 more

The preparation of nontrivial states is crucial to the study of quantum many-body physics. Such states can be prepared with adiabatic quantum algorithms, which are restricted by the minimum spectral gap along the path. In this Letter, we propose an efficient method to adiabatically prepare tensor network states (TNSs). We maximize the spectral gap leveraging degrees of freedom in the parent Hamiltonian construction. We demonstrate this efficient adiabatic algorithm for preparing TNSs, through examples of random TNSs in one dimension, AKLT (Affleck-Kennedy-Lieb-Tasaki), and GHZ states. The Hamiltonian optimization applies to both injective and non-injective tensors, in the latter case by exploiting symmetries present in the tensors.

arXiv:2409.15433•Physical Review Letters•Jul 14, 2025•3 citations

Preparation and verification of tensor network states

Esther Cruz, F. Baccari, Jordi Tura +2 more

We consider a family of tensor network states defined on regular lattices that come with a natural definition of an adiabatic path to prepare them. This family comprises relevant classes of states, such as injective matrix product and projected entangled-pair states, and some corresponding to classical spin models. We show how uniform lower bounds to the gap of the parent Hamiltonian along the adiabatic trajectory can be efficiently computed using semidefinite programming. This allows one to check whether the adiabatic preparation can be performed efficiently with a scalable effort. We also derive a set of observables whose expectation values can be easily determined and that form a complete set, in the sense that they uniquely characterize the state. We identify a subset of those observables which can be efficiently computed if one has access to the quantum state and local measurements, and analyze how they can be used in verification procedures.

arXiv:2105.06866•Physical Review Research•May 31, 2022•12 citations

Spectral gaps of Affleck-Kennedy-Lieb-Tasaki Hamiltonians using tensor network methods

Artur García-Sáez, V. Murg, Tzu-Chieh Wei

Using exact diagonalization and tensor network techniques, we compute the gap for the Affleck-Kennedy-Lieb-Tasaki (AKLT) Hamiltonian in one and two spatial dimensions. Tensor network methods are used to extract physical properties directly in the thermodynamic limit, and we support these results using finite-size scalings from exact diagonalization. Studying the AKLT Hamiltonian perturbed by an external field, we show how to obtain an accurate value of the gap of the original AKLT Hamiltonian from the field value at which the ground state verifies ${e}_{0}<0$, which is a quantum critical point. With the tensor network renormalization group methods we provide direct evidence of a finite gap in the thermodynamic limit for the AKLT models in the one-dimensional chain and two-dimensional hexagonal and square lattices. This method can be applied generally to Hamiltonians with rotational symmetry, and we also show results beyond the AKLT model.

arXiv:1308.3631•Physical Review B•Dec 16, 2013•38 citations

Tensor Network methods in many-body physics

András Molnár

Strongly correlated systems exhibit phenomena -- such as high-T_c superconductivity or the fractional quantum Hall effect -- that are not explicable by classical and semi-classical methods. Moreover, due to the exponential scaling of the associated Hilbert space, solving the proposed model Hamiltonians by brute-force numerical methods is bound to fail. Thus, it is important to develop novel numerical and analytical methods that can explain the physics in this regime. Tensor Network states are quantum many-body states that help to overcome some of these difficulties by defining a family of states that depend only on a small number of parameters. Their use is twofold: they are used as variational ansatzes in numerical algorithms as well as providing a framework to represent a large class of exactly solvable models that are believed to represent all possible phases of matter. The present thesis investigates mathematical properties of these states thus deepening the understanding of how and why Tensor Networks are suitable for the description of quantum many-body systems. It is believed that tensor networks can represent ground states of local Hamiltonians, but how good is this representation? This question is of fundamental importance as variational algorithms based on tensor networks can only perform well if any ground state can be approximated efficiently in such a way. While any state can be written as a tensor network state, the number of parameters needed for the description might be too large. This is not the case for one-dimensional systems: only a few parameters are required to have a good approximation of their ground states; that, in turn, allows for numerical algorithms based on tensor networks performing well. The situation in two dimensions is somewhat more complicated, but it is known that ground states of local Hamiltonians can be expressed as tensor networks with sub-exponentially many parameters. In the present thesis, we improve on these existing bounds strengthening the claim that the language of tensor networks is suitable to describe many-body systems. Another central question is how symmetries of the system such as translational invariance, time-reversal symmetry or local unitary symmetry can be reflected in tensor networks. This question is important as systems appearing in nature might intrinsically possess certain symmetries; on one hand, understanding these symmetries simplifies the description of these systems. On the other hand, the presence of symmetries leads to the appearance of novel phases -- symmetry-protected topological (SPT) order, -- and tensor networks provide the right language to classify these phases. In one dimension and for certain classes of two-dimensional tensor networks (states generated by so-called injective tensors) it is well understood how symmetries of the state can be described. A general framework, however, has yet to be developed. In the present thesis, we contribute to the development of the theory in two ways. We first investigate the question for injective tensors, and generalize the existing proof for any geometry including the hyperbolic geometry used in the AdS/CFT correspondence. Second, we introduce a class of tensor network states that include previously known examples of states exhibiting SPT order. We show how symmetries are reflected in these states thus deepening the understanding of SPT order in two dimensions.

•Jan 1, 2019•0 citations

Nonperturbative Methods in Quantum Field Theory

Mari Carmen Bañuls

<!--HTML-->*Theory Colloquium* The term Tensor Network States (TNS) designates a number of ansatzes that can efficiently represent certain states of quantum many-body systems. In particular, ground states and thermal equilibrium of local Hamiltonians, and, to some extent, real time evolution can be numerically studied with TNS methods. Quantum information theory provides tools to understand why they are good ansatzes for physically relevant states, and some of the limitations connected to the simulation algorithms. Originally introduced in the context of condensed matter physics, these methods have become a state-of-the-art technique for strongly correlated one-dimensional systems. Their applicability extends nevertheless to other fields. As an example, in the last few years it has been shown that TNS are also suitable to study lattice gauge theories and other quantum field problems. This talk gives an overview of the possibilities and limitations of these methods, and some of their recent applications to this kind of problems.

•Jan 1, 2022•0 citations
We propose and study a specific adiabatic path to prepare those tensor network states that are unique ground states of few-body parent Hamiltonians in finite lattices, which include normal tensor network states, as well as other relevant nonnormal states. This path guarantees a gap for finite systems and allows for efficient numerical simulation. In one dimension, we numerically investigate the preparation of a family of states with varying correlation lengths and the one-dimensional Affleck-Kennedy-Lieb-Tasaki (AKLT) state and show that adiabatic preparation can be much faster than standard methods based on sequential preparation. We also apply the method to the two-dimensional AKLT state on the hexagonal lattice, for which no method based on sequential preparation is known, and show that it can be prepared very efficiently for relatively large lattices.
The preparation of nontrivial states is crucial to the study of quantum many-body physics. Such states can be prepared with adiabatic quantum algorithms, which are restricted by the minimum spectral gap along the path. In this Letter, we propose an efficient method to adiabatically prepare tensor network states (TNSs). We maximize the spectral gap leveraging degrees of freedom in the parent Hamiltonian construction. We demonstrate this efficient adiabatic algorithm for preparing TNSs, through examples of random TNSs in one dimension, AKLT (Affleck-Kennedy-Lieb-Tasaki), and GHZ states. The Hamiltonian optimization applies to both injective and non-injective tensors, in the latter case by exploiting symmetries present in the tensors.
We consider a family of tensor network states defined on regular lattices that come with a natural definition of an adiabatic path to prepare them. This family comprises relevant classes of states, such as injective matrix product and projected entangled-pair states, and some corresponding to classical spin models. We show how uniform lower bounds to the gap of the parent Hamiltonian along the adiabatic trajectory can be efficiently computed using semidefinite programming. This allows one to check whether the adiabatic preparation can be performed efficiently with a scalable effort. We also derive a set of observables whose expectation values can be easily determined and that form a complete set, in the sense that they uniquely characterize the state. We identify a subset of those observables which can be efficiently computed if one has access to the quantum state and local measurements, and analyze how they can be used in verification procedures.
Using exact diagonalization and tensor network techniques, we compute the gap for the Affleck-Kennedy-Lieb-Tasaki (AKLT) Hamiltonian in one and two spatial dimensions. Tensor network methods are used to extract physical properties directly in the thermodynamic limit, and we support these results using finite-size scalings from exact diagonalization. Studying the AKLT Hamiltonian perturbed by an external field, we show how to obtain an accurate value of the gap of the original AKLT Hamiltonian from the field value at which the ground state verifies e0<0{e}_{0}<0e0​<0, which is a quantum critical point. With the tensor network renormalization group methods we provide direct evidence of a finite gap in the thermodynamic limit for the AKLT models in the one-dimensional chain and two-dimensional hexagonal and square lattices. This method can be applied generally to Hamiltonians with rotational symmetry, and we also show results beyond the AKLT model.
Strongly correlated systems exhibit phenomena -- such as high-T_c superconductivity or the fractional quantum Hall effect -- that are not explicable by classical and semi-classical methods. Moreover, due to the exponential scaling of the associated Hilbert space, solving the proposed model Hamiltonians by brute-force numerical methods is bound to fail. Thus, it is important to develop novel numerical and analytical methods that can explain the physics in this regime. Tensor Network states are quantum many-body states that help to overcome some of these difficulties by defining a family of states that depend only on a small number of parameters. Their use is twofold: they are used as variational ansatzes in numerical algorithms as well as providing a framework to represent a large class of exactly solvable models that are believed to represent all possible phases of matter. The present thesis investigates mathematical properties of these states thus deepening the understanding of how and why Tensor Networks are suitable for the description of quantum many-body systems. It is believed that tensor networks can represent ground states of local Hamiltonians, but how good is this representation? This question is of fundamental importance as variational algorithms based on tensor networks can only perform well if any ground state can be approximated efficiently in such a way. While any state can be written as a tensor network state, the number of parameters needed for the description might be too large. This is not the case for one-dimensional systems: only a few parameters are required to have a good approximation of their ground states; that, in turn, allows for numerical algorithms based on tensor networks performing well. The situation in two dimensions is somewhat more complicated, but it is known that ground states of local Hamiltonians can be expressed as tensor networks with sub-exponentially many parameters. In the present thesis, we improve on these existing bounds strengthening the claim that the language of tensor networks is suitable to describe many-body systems. Another central question is how symmetries of the system such as translational invariance, time-reversal symmetry or local unitary symmetry can be reflected in tensor networks. This question is important as systems appearing in nature might intrinsically possess certain symmetries; on one hand, understanding these symmetries simplifies the description of these systems. On the other hand, the presence of symmetries leads to the appearance of novel phases -- symmetry-protected topological (SPT) order, -- and tensor networks provide the right language to classify these phases. In one dimension and for certain classes of two-dimensional tensor networks (states generated by so-called injective tensors) it is well understood how symmetries of the state can be described. A general framework, however, has yet to be developed. In the present thesis, we contribute to the development of the theory in two ways. We first investigate the question for injective tensors, and generalize the existing proof for any geometry including the hyperbolic geometry used in the AdS/CFT correspondence. Second, we introduce a class of tensor network states that include previously known examples of states exhibiting SPT order. We show how symmetries are reflected in these states thus deepening the understanding of SPT order in two dimensions.
<!--HTML-->*Theory Colloquium* The term Tensor Network States (TNS) designates a number of ansatzes that can efficiently represent certain states of quantum many-body systems. In particular, ground states and thermal equilibrium of local Hamiltonians, and, to some extent, real time evolution can be numerically studied with TNS methods. Quantum information theory provides tools to understand why they are good ansatzes for physically relevant states, and some of the limitations connected to the simulation algorithms. Originally introduced in the context of condensed matter physics, these methods have become a state-of-the-art technique for strongly correlated one-dimensional systems. Their applicability extends nevertheless to other fields. As an example, in the last few years it has been shown that TNS are also suitable to study lattice gauge theories and other quantum field problems. This talk gives an overview of the possibilities and limitations of these methods, and some of their recent applications to this kind of problems.