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:2605.14356 · Lecture notes in computer science

Model Checking Matrix Product States against Linear Chain Logic

Ming Xu, Yihao Chen, Ji Guan

quant-phcs.LOSubmitted May 14, 2026• Announced May 15, 2026• 0 citations
arXivHTMLPDF

Abstract

Matrix product states (MPS) are a standard tensor-network representation for ground states of one-dimensional quantum many-body systems, and they underpin widely used simulation tools such as DMRG. However, while quantum model checking has been developed mainly for quantum programs and communication protocols (with properties expressed along a time axis), there is still no comparable framework for systematically verifying \emph{spatial} and \emph{size-dependent} properties of physical many-body states, where the key parameter is the system size. This paper takes a step toward bridging the gap. We propose \emph{Linear Chain Logic} (LCL), a spatial logic designed to specify physically meaningful properties of periodic MPS families as the system size grows, such as nontriviality on rings and large-size asymptotic patterns. Our approach builds on a simple but powerful connection: every periodic MPS naturally induces a completely positive map (a quantum operation) on its virtual space, so many quantitative features of the MPS can be analysed through the repeated application of the operation. Using this perspective, we derive an effective procedure to compute the inner products of an MPS at a given size and to support richer LCL specifications, without relying on brute-force state expansion. We then develop approximate model-checking algorithms that combine sound bounding with asymptotic structural analysis, enabling scalable reasoning about large system sizes. Experiments on representative MPS families illustrate that our method can automatically verify nontriviality and detect asymptotic spatial regimes in a way that complements traditional numerical techniques.

Related papers

Matrix Product States for Lattice Field Theories

Mari Carmen Bañuls, Krzysztof Cichy, J. I. Cirac +2 more

The term Tensor Network States (TNS) refers to a number of families of states that represent different ansätze for the efficient description of the state of a quantum many-body system.Matrix Product States (MPS) are one particular case of TNS, and have become the most precise tool for the numerical study of one dimensional quantum many-body systems, as the basis of the Density Matrix Renormalization Group method.Lattice Gauge Theories (LGT), in their Hamiltonian version, offer a challenging scenario for these techniques.While the dimensions and sizes of the systems amenable to TNS studies are still far from those achievable by 4-dimensional LGT tools, Tensor Networks can be readily used for problems which more standard techniques, such as Markov chain Monte Carlo simulations, cannot easily tackle.Examples of such problems are the presence of a chemical potential or out-of-equilibrium dynamics.We have explored the performance of Matrix Product States in the case of the Schwinger model, as a widely used testbench for lattice techniques.Using finite-size, open boundary MPS, we are able to determine the low energy states of the model in a fully non-perturbative manner.The precision achieved by the method allows for accurate finite size and continuum limit extrapolations of the ground state energy, but also of the chiral condensate and the mass gaps, thus showing the feasibility of these techniques for gauge theory problems.

arXiv:1310.4118•International Symposium on Lattice Field Theory (LATTICE)•Apr 28, 2014•52 citations

Pushing the boundaries of Matrix Product States in quantum many-body physics and computing

Guglielmo Lami

The Thesis explores the application of Matrix Product States (MPS) in the domain of quantum many-body systems and quantum computing, show casing the versatility and effectiveness of MPS for addressing complex com putational challenges. The opening chapter introduces essential tools for Tensor Networks, addressing the curse of dimensionality and elucidating the main characteristics of Matrix Product States and Matrix Product Op erators. The discussion encompasses also important numerical techniques, including Density Matrix Renormalization Group and Time Evolving Block Decimation. Furthermore, the relation between MPS and quantum circuits is discussed. The subsequent Chapters delve into specific applications of MPS. In the second Chapter, we introduce a Tensor Network ansatz inspired by the backflow transformation for correlated systems. This extension of the MPS representation ensures an area law for entanglement in dimensions one or greater. We employ an optimization scheme combining DMRG and variational Monte Carlo algorithms for efficient ground-state search. Bench marking against spin models demonstrates high accuracy. The third Chapter explores quantum annealing for optimizing complex classical spin Hamil tonians, as the Hopfield model and the binary perceptron. We introduce an efficient Tensor Network representation for the adiabatic time evolution of quantum annealing, enabling scalable classical simulations. The use of MPS in mitigating Trotter errors and mapping to quantum circuits is also explored. In the fourth Chapter we present a novel method for evaluating the amount of nonstabilizerness (also known as quantum magic) contained in an MPS. We overcome the exponentially hard evaluation of this quan tity by employing a simple perfect sampling technique of Pauli string. Our innovative MPS approach enables efficient computation. Benchmarked on magic states and the quantum Ising chain ground state, this method offers easy access to the non-equilibrium dynamics of nonstabilizerness following a quantum quench. The Appendices provide additional insights, including: an introduction to variational Monte Carlo, technical details on MPS simula tions for the quantum annealing and a comprehensive overview on stabilizer formalism and nonstabilizerness.

•Dec 18, 2023•0 citations

Matrix product states algorithms and continuous systems

S. Iblisdir, Román Orús, José Ignacio Latorre

A generic method to investigate many-body continuous-variable systems is pedagogically presented. It is based on the notion of matrix product states (so-called MPS's) and the algorithms thereof. The method is quite versatile and can be applied to a wide variety of situations. As a first test, we show how it provides reliable results in the computation of fundamental properties of a chain of quantum harmonic oscillators achieving off-critical and critical relative errors of the order of ${10}^{\ensuremath{-}8}$ and ${10}^{\ensuremath{-}4}$, respectively. Next, we use it to study the ground-state properties of the quantum rotor model in one spatial dimension, a model that can be mapped to the Mott insulator limit of the one-dimensional Bose-Hubbard model. At the quantum critical point, the central charge associated with the underlying conformal field theory can be computed with good accuracy by measuring the finite-size corrections of the ground-state energy. Examples of MPS computations both in the finite-size regime and in the thermodynamic limit are given. The precision of our results is found to be comparable to that previously encountered in the MPS studies of, for instance, quantum spin chains. Finally, we present a spin-off application: an iterative technique to efficiently get numerical solutions of partial differential equations of many variables. We illustrate this technique by solving Poisson-like equations with precisions of the order of ${10}^{\ensuremath{-}7}$.

arXiv:cond-mat/0610530•Physical Review B•Mar 23, 2007•36 citations

Efficient time-evolution of matrix product states using average Hamiltonians

Belal Abouraya, Jirawat Saiphet, Fedor Jelezko +1 more

Simulating quantum many-body systems (QMBS) is one of the long-standing, highly non-trivial challenges in condensed matter physics and quantum information due to the exponentially growing size of the system's Hilbert space. To date, tensor networks have been an essential tool for studying such quantum systems, owing to their ability to efficiently capture the entanglement properties of the systems they represent. One of the well-known tensor network architectures, namely matrix product states (MPS), is the standard method for simulating one-dimensional QMBS. Here, we propose a simple, yet efficient, method to augment the already available MPS algorithms to simulate the dynamics of time-dependent Hamiltonians with better accuracy and a faster convergence rate, giving a second-order convergence compared to the first-order convergence of the standard method. We apply our proposed method to simulate the dynamics of a chain of single spins associated with nitrogen-vacancy color centers in diamonds, which has potential applications for practical and scalable quantum technologies, and find that our method improves the average error for a system of few NV centers by a factor of about 1000 for moderate step sizes. Our work paves the way for efficient simulation of QMBS under the influence of time-dependent Hamiltonians.

quant-pharXiv:2602.04955•Physical Review Research•Feb 6, 2026•0 citations

Efficient and systematic calculation of arbitrary observables for the matrix product state excitation ansatz

Jesse J. Osborne, Ian P. McCulloch

Numerical methods based on matrix product states (MPSs) are currently the standard for calculating the ground-state properties of (quasi-)one-dimensional quantum many-body systems. While the properties of the low-lying excitations in such systems are often studied in this MPS framework through by means of time-evolution simulations, we can also look at their by directly calculating eigenstates corresponding to these excitations. The so-called MPS excitation ansatz is a powerful method for finding such eigenstates with a single-particle character in the thermodynamic limit. Although this excitation ansatz has been used quite extensively, a general method for calculating expectation values for these states is lacking in the literature: We aim to fill this gap by presenting a recursive algorithm to calculate arbitrary observables expressed as matrix product operators. This method concisely encapsulates existing methods for—as well as extensions to—the excitation ansatz, such as excitations with a larger spatial support and multiparticle excitations, and is robust enough to handle further innovations. We demonstrate the versatility of our method by studying the low-lying excitations in the spin-1 Heisenberg chain and the one-dimensional Hubbard model, looking at how the excitations converge in the former, while in the latter, we present a refined method of targeting single-particle excitations inside a continuum by minimizing the energy rather than the energy itself. We hope that this technique will foster further advancements with the excitation ansatz.

arXiv:2408.17117•Physical Review Research•Apr 7, 2025•5 citations

Simulating quantum systems on classical computers with matrix product states

Adrian Kleine, Ulrich Schollwöck

In this thesis, the numerical simulation of strongly-interacting many-body quantum-mechanical systems using matrix product states (MPS) is considered. Compared to classical systems, quantum many-body systems possess an exponentially enlarged number of degrees of freedom, significantly complicating a simulation on a classical computer. Matrix-Product-States are a novel representation of arbitrary quantum many-body states. Using quantum information theory, it is possible to show that Matrix-Product-States provide a polynomial-sized representation of one-dimensional quantum systems, thus allowing an efficient simulation of one-dimensional quantum system on classical computers. Matrix-Product-States form the conceptual framework of the density-matrix renormalization group (DMRG). Based upon this connection, deeper understanding of the density matrix renormalization group can be obtained. After a general introduction in the first chapter of this thesis, the second chapter deals with Matrix-Product-States, focusing on the development of fast and stable algorithms. It is possible to extend the Matrix-Product-States approach to be able to represent arbitrary operators, the so-called Matrix-Product-Operators, which allows a fast and flexible calculation of arbitrary expectation values. To obtain algorithms to efficiently calculate groundstates, the density-matrix renormalization group is reformulated using the Matrix-Product-States framework. Further, time-dependent problems are considered. Two different algorithms are presented, one based on a Trotter decomposition of the time-evolution operator, the other one on Krylov subspaces. Finally, the evaluation of dynamical spectral functions is discussed, and a correction vector-based method is presented. In the following chapters, the methods presented in the second chapter, are applied to a number of different physical problems. The third chapter deals with the existence of chiral phases in isotropic one-dimensional quantum spin systems. A preceding analytical study based on a mean-field approach indicated the possible existence of those phases in an isotopic Heisenberg model with a frustrating zig-zag interaction and a magnetic field. In this thesis, the existence of the chiral phases will be shown numerically by using Matrix-Product-States-based algorithms. A key effect of interacting one-dimensional quantum-mechanical many-body systems is the spin-charge separation. However, up to now only signs of the spin-charge separation have been observed in experiments. In the fourth chapter, we propose an experiment using ultracold atomic gases in optical lattices, which allows a well controlled observation of the spin-charge separation (of different hyperfine states of the ultracold atoms) with current state of the art experimental techniques. Ultracold atoms in optical lattices are well described by (Bose)-Hubbard models. In order to support this proposal, we present numerical results for realistic system parameters. Matrix-Product-States are an excellent tool for the simulation of one-dimensional quantum systems, however, they are not well suited for the simulation of higher dimensional systems. For strongly-correlated systems, for instance cuprates-based high-temperature superconductors, quantum fluctuations play an essential role. Classical mean-field theories neglect any kind of fluctuations, thus they are not suitable to describe strongly-correlated systems. The dynamical mean-field theory (DMFT) fully takes local quantum fluctuations into account but neglects any kind of spatial fluctuations. The many-body problem on the lattice is mapped onto an impurity problem, which needs to be solved self-consistently. In the last chapter of this thesis, Matrix-Product-States-based algorithms are used to solve the impurity problem of the dynamical mean-field theory. We present results for a Hubbard model on a one-dimensional lattice and on a Bethe lattice obtained by the dynamical mean-field and compare them with exact results.

•Jan 1, 2010•1 citation
Matrix product states (MPS) are a standard tensor-network representation for ground states of one-dimensional quantum many-body systems, and they underpin widely used simulation tools such as DMRG. However, while quantum model checking has been developed mainly for quantum programs and communication protocols (with properties expressed along a time axis), there is still no comparable framework for systematically verifying \emph{spatial} and \emph{size-dependent} properties of physical many-body states, where the key parameter is the system size. This paper takes a step toward bridging the gap. We propose \emph{Linear Chain Logic} (LCL), a spatial logic designed to specify physically meaningful properties of periodic MPS families as the system size grows, such as nontriviality on rings and large-size asymptotic patterns. Our approach builds on a simple but powerful connection: every periodic MPS naturally induces a completely positive map (a quantum operation) on its virtual space, so many quantitative features of the MPS can be analysed through the repeated application of the operation. Using this perspective, we derive an effective procedure to compute the inner products of an MPS at a given size and to support richer LCL specifications, without relying on brute-force state expansion. We then develop approximate model-checking algorithms that combine sound bounding with asymptotic structural analysis, enabling scalable reasoning about large system sizes. Experiments on representative MPS families illustrate that our method can automatically verify nontriviality and detect asymptotic spatial regimes in a way that complements traditional numerical techniques.
The term Tensor Network States (TNS) refers to a number of families of states that represent different ansätze for the efficient description of the state of a quantum many-body system.Matrix Product States (MPS) are one particular case of TNS, and have become the most precise tool for the numerical study of one dimensional quantum many-body systems, as the basis of the Density Matrix Renormalization Group method.Lattice Gauge Theories (LGT), in their Hamiltonian version, offer a challenging scenario for these techniques.While the dimensions and sizes of the systems amenable to TNS studies are still far from those achievable by 4-dimensional LGT tools, Tensor Networks can be readily used for problems which more standard techniques, such as Markov chain Monte Carlo simulations, cannot easily tackle.Examples of such problems are the presence of a chemical potential or out-of-equilibrium dynamics.We have explored the performance of Matrix Product States in the case of the Schwinger model, as a widely used testbench for lattice techniques.Using finite-size, open boundary MPS, we are able to determine the low energy states of the model in a fully non-perturbative manner.The precision achieved by the method allows for accurate finite size and continuum limit extrapolations of the ground state energy, but also of the chiral condensate and the mass gaps, thus showing the feasibility of these techniques for gauge theory problems.
The Thesis explores the application of Matrix Product States (MPS) in the domain of quantum many-body systems and quantum computing, show casing the versatility and effectiveness of MPS for addressing complex com putational challenges. The opening chapter introduces essential tools for Tensor Networks, addressing the curse of dimensionality and elucidating the main characteristics of Matrix Product States and Matrix Product Op erators. The discussion encompasses also important numerical techniques, including Density Matrix Renormalization Group and Time Evolving Block Decimation. Furthermore, the relation between MPS and quantum circuits is discussed. The subsequent Chapters delve into specific applications of MPS. In the second Chapter, we introduce a Tensor Network ansatz inspired by the backflow transformation for correlated systems. This extension of the MPS representation ensures an area law for entanglement in dimensions one or greater. We employ an optimization scheme combining DMRG and variational Monte Carlo algorithms for efficient ground-state search. Bench marking against spin models demonstrates high accuracy. The third Chapter explores quantum annealing for optimizing complex classical spin Hamil tonians, as the Hopfield model and the binary perceptron. We introduce an efficient Tensor Network representation for the adiabatic time evolution of quantum annealing, enabling scalable classical simulations. The use of MPS in mitigating Trotter errors and mapping to quantum circuits is also explored. In the fourth Chapter we present a novel method for evaluating the amount of nonstabilizerness (also known as quantum magic) contained in an MPS. We overcome the exponentially hard evaluation of this quan tity by employing a simple perfect sampling technique of Pauli string. Our innovative MPS approach enables efficient computation. Benchmarked on magic states and the quantum Ising chain ground state, this method offers easy access to the non-equilibrium dynamics of nonstabilizerness following a quantum quench. The Appendices provide additional insights, including: an introduction to variational Monte Carlo, technical details on MPS simula tions for the quantum annealing and a comprehensive overview on stabilizer formalism and nonstabilizerness.
A generic method to investigate many-body continuous-variable systems is pedagogically presented. It is based on the notion of matrix product states (so-called MPS's) and the algorithms thereof. The method is quite versatile and can be applied to a wide variety of situations. As a first test, we show how it provides reliable results in the computation of fundamental properties of a chain of quantum harmonic oscillators achieving off-critical and critical relative errors of the order of ${10}^{\ensuremath{-}8}$ and ${10}^{\ensuremath{-}4}$, respectively. Next, we use it to study the ground-state properties of the quantum rotor model in one spatial dimension, a model that can be mapped to the Mott insulator limit of the one-dimensional Bose-Hubbard model. At the quantum critical point, the central charge associated with the underlying conformal field theory can be computed with good accuracy by measuring the finite-size corrections of the ground-state energy. Examples of MPS computations both in the finite-size regime and in the thermodynamic limit are given. The precision of our results is found to be comparable to that previously encountered in the MPS studies of, for instance, quantum spin chains. Finally, we present a spin-off application: an iterative technique to efficiently get numerical solutions of partial differential equations of many variables. We illustrate this technique by solving Poisson-like equations with precisions of the order of ${10}^{\ensuremath{-}7}$.
Simulating quantum many-body systems (QMBS) is one of the long-standing, highly non-trivial challenges in condensed matter physics and quantum information due to the exponentially growing size of the system's Hilbert space. To date, tensor networks have been an essential tool for studying such quantum systems, owing to their ability to efficiently capture the entanglement properties of the systems they represent. One of the well-known tensor network architectures, namely matrix product states (MPS), is the standard method for simulating one-dimensional QMBS. Here, we propose a simple, yet efficient, method to augment the already available MPS algorithms to simulate the dynamics of time-dependent Hamiltonians with better accuracy and a faster convergence rate, giving a second-order convergence compared to the first-order convergence of the standard method. We apply our proposed method to simulate the dynamics of a chain of single spins associated with nitrogen-vacancy color centers in diamonds, which has potential applications for practical and scalable quantum technologies, and find that our method improves the average error for a system of few NV centers by a factor of about 1000 for moderate step sizes. Our work paves the way for efficient simulation of QMBS under the influence of time-dependent Hamiltonians.
Numerical methods based on matrix product states (MPSs) are currently the standard for calculating the ground-state properties of (quasi-)one-dimensional quantum many-body systems. While the properties of the low-lying excitations in such systems are often studied in this MPS framework through by means of time-evolution simulations, we can also look at their by directly calculating eigenstates corresponding to these excitations. The so-called MPS excitation ansatz is a powerful method for finding such eigenstates with a single-particle character in the thermodynamic limit. Although this excitation ansatz has been used quite extensively, a general method for calculating expectation values for these states is lacking in the literature: We aim to fill this gap by presenting a recursive algorithm to calculate arbitrary observables expressed as matrix product operators. This method concisely encapsulates existing methods for—as well as extensions to—the excitation ansatz, such as excitations with a larger spatial support and multiparticle excitations, and is robust enough to handle further innovations. We demonstrate the versatility of our method by studying the low-lying excitations in the spin-1 Heisenberg chain and the one-dimensional Hubbard model, looking at how the excitations converge in the former, while in the latter, we present a refined method of targeting single-particle excitations inside a continuum by minimizing the energy rather than the energy itself. We hope that this technique will foster further advancements with the excitation ansatz.
In this thesis, the numerical simulation of strongly-interacting many-body quantum-mechanical systems using matrix product states (MPS) is considered. Compared to classical systems, quantum many-body systems possess an exponentially enlarged number of degrees of freedom, significantly complicating a simulation on a classical computer. Matrix-Product-States are a novel representation of arbitrary quantum many-body states. Using quantum information theory, it is possible to show that Matrix-Product-States provide a polynomial-sized representation of one-dimensional quantum systems, thus allowing an efficient simulation of one-dimensional quantum system on classical computers. Matrix-Product-States form the conceptual framework of the density-matrix renormalization group (DMRG). Based upon this connection, deeper understanding of the density matrix renormalization group can be obtained. After a general introduction in the first chapter of this thesis, the second chapter deals with Matrix-Product-States, focusing on the development of fast and stable algorithms. It is possible to extend the Matrix-Product-States approach to be able to represent arbitrary operators, the so-called Matrix-Product-Operators, which allows a fast and flexible calculation of arbitrary expectation values. To obtain algorithms to efficiently calculate groundstates, the density-matrix renormalization group is reformulated using the Matrix-Product-States framework. Further, time-dependent problems are considered. Two different algorithms are presented, one based on a Trotter decomposition of the time-evolution operator, the other one on Krylov subspaces. Finally, the evaluation of dynamical spectral functions is discussed, and a correction vector-based method is presented. In the following chapters, the methods presented in the second chapter, are applied to a number of different physical problems. The third chapter deals with the existence of chiral phases in isotropic one-dimensional quantum spin systems. A preceding analytical study based on a mean-field approach indicated the possible existence of those phases in an isotopic Heisenberg model with a frustrating zig-zag interaction and a magnetic field. In this thesis, the existence of the chiral phases will be shown numerically by using Matrix-Product-States-based algorithms. A key effect of interacting one-dimensional quantum-mechanical many-body systems is the spin-charge separation. However, up to now only signs of the spin-charge separation have been observed in experiments. In the fourth chapter, we propose an experiment using ultracold atomic gases in optical lattices, which allows a well controlled observation of the spin-charge separation (of different hyperfine states of the ultracold atoms) with current state of the art experimental techniques. Ultracold atoms in optical lattices are well described by (Bose)-Hubbard models. In order to support this proposal, we present numerical results for realistic system parameters. Matrix-Product-States are an excellent tool for the simulation of one-dimensional quantum systems, however, they are not well suited for the simulation of higher dimensional systems. For strongly-correlated systems, for instance cuprates-based high-temperature superconductors, quantum fluctuations play an essential role. Classical mean-field theories neglect any kind of fluctuations, thus they are not suitable to describe strongly-correlated systems. The dynamical mean-field theory (DMFT) fully takes local quantum fluctuations into account but neglects any kind of spatial fluctuations. The many-body problem on the lattice is mapped onto an impurity problem, which needs to be solved self-consistently. In the last chapter of this thesis, Matrix-Product-States-based algorithms are used to solve the impurity problem of the dynamical mean-field theory. We present results for a Hubbard model on a one-dimensional lattice and on a Bethe lattice obtained by the dynamical mean-field and compare them with exact results.