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

Implementing Entangled States on a Quantum Computer

Amandeep Singh Bhatia, Mandeep Kaur Saggi

Published Nov 24, 2018• 8 citations
arXivHTMLPDF

Abstract

The study of tensor network theory is an important field and promises a wide range of experimental and quantum information theoretical applications. Matrix product state is the most well-known example of tensor network states, which provides an effective and efficient representation of one-dimensional quantum systems. Indeed, it lies at the heart of density matrix renormalization group (DMRG), a most common method for simulation of one-dimensional strongly correlated quantum systems. It has got attention from several areas varying from solid-state systems to quantum computing and quantum simulators. We have considered maximally entangled matrix product states (GHZ and W). Here, we designed the quantum circuits for implementing the matrix product states. In this paper, we simulated the matrix product states in customized IBM (2-qubit, 3-qubit and 4-qubit) quantum systems and determined the probability distribution among the quantum states.

DOI
10.48550/arxiv.1811.09833

Related papers

Tensor networks for the simulation of strongly correlated systems

Stefan Depenbrock

This thesis treats the classical simulation of strongly-interacting many-body quantum-mechanical systems in more than one dimension using matrix product states and the more general tensor product states. Contrary to classical systems, quantum many-body systems possess an exponentially larger number of degrees of freedom, thereby significantly complicating their numerical treatment on a classical computer. For this thesis two different representations of quantum many-body states were employed. The first, the so-called matrix product states (MPS) form the basis for the extremely successful density matrix renormalization group (DMRG) algorithm. While originally conceived for one-dimensional systems, MPS are in principle capable of describing arbitrary quantum many-body states. Using concepts from quantum information theory it is possible to show that MPS provide a representation of one-dimensional quantum systems that scales polynomially in the number of particles, therefore allowing an efficient simulation of one-dimensional systems on a classical computer. One of the key results of this thesis is that MPS representations are indeed efficient enough to describe even large systems in two dimensions, thereby enabling the simulation of such systems using DMRG. As a demonstration of the power of the DMRG algorithm, it is applied to the Heisenberg antiferromagnet with spin $S = 1/2$ on the kagome lattice. This model's ground state has long been under debate, with proposals ranging from static spin configurations to so-called quantum spin liquids, states where quantum fluctuations destroy conventional order and give rise to exotic quantum orders. Using a fully $SU(2)$-symmetric implementation allowed us to handle the exponential growth of entanglement and to perform a large-scale study of this system, finding the ground state for cylinders of up to 700 sites. Despite employing a one-dimensional algorithm for a two-dimensional system, we were able to compute the spin gap (i.e. the energy gap to the first spinful excitation) and study the ground state properties, such as the decay of correlation functions, the static spin structure factors, and the structure and distribution of the nearest-neighbor spin-spin correlations. Additionally, by applying a new tool from quantum information theory, the topological entanglement entropy, we could also with high confidence demonstrate the ground state of this model to be the elusive gapped $Z_2$ quantum spin liquid with topological order. To complement this study, we also considered the extension of MPS to higher dimensions, known as tensor product states (TPS). We implemented an optimization algorithm exploiting symmetries for this class of states and applied it to the bilinear-biquadratic-bicubic Heisenberg model with spin $S=3/2$ on the $z=3$ Bethe lattice. By carefully analyzing the simulation data we were able to determine the presence of both conventional and symmetry-protected topological order in this model, thereby demonstrating the analytically predicted existence of the Haldane phase in higher dimensions within an extended region of the phase diagram. Key properties of this symmetry-protected topological order include a doubling of the levels in the entanglement spectrum and the presence of edge spins, both of which were confirmed in our simulations. This finding simultaneously validated the applicability of the novel TPS algorithms to the search for exotic order.

•Jan 1, 2013•2 citations

Simulating quantum circuits with tree tensor networks using density-matrix renormalization group algorithm

Aditya Dubey, Zeki Zeybek, Peter Schmelcher

Quantum computing offers the potential for computational abilities that can go beyond classical machines. However, they are still limited by several challenges such as noise, decoherence, and gate errors. As a result, efficient classical simulation of quantum circuits is vital not only for validating and benchmarking quantum hardware but also for gaining deeper insights into the behavior of quantum algorithms. A promising framework for classical simulation is provided by tensor networks. Recently, the density-matrix renormalization group (DMRG) algorithm was developed for simulating quantum circuits using matrix product states (MPS). Although MPS are efficient for representing quantum states with one-dimensional correlation structures, the fixed linear geometry restricts the expressive power of the MPS. In this work, we extend the DMRG algorithm for simulating quantum circuits to tree tensor networks (TTNs). The framework employs a variational compression scheme that optimizes the TTN to approximate the evolved quantum state. To benchmark the method, we simulate random circuits and the quantum approximate optimization algorithm (QAOA) with various two-qubit gate connectivities. For the random circuits, we devise treelike gate layouts that are suitable for TTN and show that TTN requires less memory than MPS for the simulations. For the QAOA circuits, a naive TTN construction that exploits graph structure significantly improves the simulation fidelities. Our findings show that the DMRG algorithm with TTNs provides a promising framework for simulating quantum circuits, particularly when gate connectivities exhibit clustering or a hierarchical structure.

arXiv:2504.16718•Physical review. B./Physical review. B•Aug 28, 2025•6 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

PyTeNet: A concise Python implementation of quantum tensor network algorithms

Christian B. Mendl

The simulation of strongly correlated quantum systems on classical computers is an essential tool for investigating and understanding quantum materials.Due to the inherent "curse of dimensionality" of quantum systems, such simulations pose a challenging task, and have spurred the development of several computational approaches and approximations.For quasi one-dimensional lattice systems, the density matrix renormalization group (DMRG) framework (Schollwöck, 2005;White, 1992White, , 1993) has emerged as one of the most successful methods.Modern formulations are based on matrix product states (MPS) and operators (MPO) (Schollwöck, 2011): briefly speaking, a matrix product state is an Ansatz for the quantum many-body wavefunction amendable to efficient numerical manipulation.The favorable approximation properties of matrix product states have been theoretically proven for ground states of gapped Hamiltonians with local interactions (Hastings, 2007;Verstraete & Cirac, 2006), and recent work has extended this to quantum systems at finite temperature (Barthel, 2017).Over the years many variations and generalizations of the DMRG framework have been devised (Barthel, 2013;Stoudenmire & White, 2010;Verstraete, Murg, & Cirac, 2008;Vidal, 2003Vidal, , 2008)), and further developments and improvements of associated algorithms remain an active field of research.

The Journal of Open Source Software•Oct 16, 2018•9 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

Symbolic Simulation of Quantum Circuits with Tensor Networks

Jincheng Zhang

The accurate simulation of quantum circuits remains a significant challenge due to the exponential scaling of computational resources with circuit size. This work explores the application of tensor network methods, specifically Matrix Product States (MPS), to provide a scalable approach for simulating quantum circuits. We demonstrate how tensor networks can efficiently represent and manipulate the states of quantum circuits, reducing the computational burden associated with traditional methods. The core claim of this research is that tensor networks offer a viable path to accurately simulating larger and more complex quantum systems. This research introduces a novel framework for symbolic simulation, leveraging the power of tensor network representations to overcome the limitations of conventional simulation techniques. The effectiveness of this approach is illustrated through theoretical analysis and conceptual examples.

•Sep 5, 2026•0 citations
The study of tensor network theory is an important field and promises a wide range of experimental and quantum information theoretical applications. Matrix product state is the most well-known example of tensor network states, which provides an effective and efficient representation of one-dimensional quantum systems. Indeed, it lies at the heart of density matrix renormalization group (DMRG), a most common method for simulation of one-dimensional strongly correlated quantum systems. It has got attention from several areas varying from solid-state systems to quantum computing and quantum simulators. We have considered maximally entangled matrix product states (GHZ and W). Here, we designed the quantum circuits for implementing the matrix product states. In this paper, we simulated the matrix product states in customized IBM (2-qubit, 3-qubit and 4-qubit) quantum systems and determined the probability distribution among the quantum states.
This thesis treats the classical simulation of strongly-interacting many-body quantum-mechanical systems in more than one dimension using matrix product states and the more general tensor product states. Contrary to classical systems, quantum many-body systems possess an exponentially larger number of degrees of freedom, thereby significantly complicating their numerical treatment on a classical computer. For this thesis two different representations of quantum many-body states were employed. The first, the so-called matrix product states (MPS) form the basis for the extremely successful density matrix renormalization group (DMRG) algorithm. While originally conceived for one-dimensional systems, MPS are in principle capable of describing arbitrary quantum many-body states. Using concepts from quantum information theory it is possible to show that MPS provide a representation of one-dimensional quantum systems that scales polynomially in the number of particles, therefore allowing an efficient simulation of one-dimensional systems on a classical computer. One of the key results of this thesis is that MPS representations are indeed efficient enough to describe even large systems in two dimensions, thereby enabling the simulation of such systems using DMRG. As a demonstration of the power of the DMRG algorithm, it is applied to the Heisenberg antiferromagnet with spin S=1/2S = 1/2S=1/2 on the kagome lattice. This model's ground state has long been under debate, with proposals ranging from static spin configurations to so-called quantum spin liquids, states where quantum fluctuations destroy conventional order and give rise to exotic quantum orders. Using a fully SU(2)SU(2)SU(2)-symmetric implementation allowed us to handle the exponential growth of entanglement and to perform a large-scale study of this system, finding the ground state for cylinders of up to 700 sites. Despite employing a one-dimensional algorithm for a two-dimensional system, we were able to compute the spin gap (i.e. the energy gap to the first spinful excitation) and study the ground state properties, such as the decay of correlation functions, the static spin structure factors, and the structure and distribution of the nearest-neighbor spin-spin correlations. Additionally, by applying a new tool from quantum information theory, the topological entanglement entropy, we could also with high confidence demonstrate the ground state of this model to be the elusive gapped Z2Z_2Z2​ quantum spin liquid with topological order. To complement this study, we also considered the extension of MPS to higher dimensions, known as tensor product states (TPS). We implemented an optimization algorithm exploiting symmetries for this class of states and applied it to the bilinear-biquadratic-bicubic Heisenberg model with spin S=3/2S=3/2S=3/2 on the z=3z=3z=3 Bethe lattice. By carefully analyzing the simulation data we were able to determine the presence of both conventional and symmetry-protected topological order in this model, thereby demonstrating the analytically predicted existence of the Haldane phase in higher dimensions within an extended region of the phase diagram. Key properties of this symmetry-protected topological order include a doubling of the levels in the entanglement spectrum and the presence of edge spins, both of which were confirmed in our simulations. This finding simultaneously validated the applicability of the novel TPS algorithms to the search for exotic order.
Quantum computing offers the potential for computational abilities that can go beyond classical machines. However, they are still limited by several challenges such as noise, decoherence, and gate errors. As a result, efficient classical simulation of quantum circuits is vital not only for validating and benchmarking quantum hardware but also for gaining deeper insights into the behavior of quantum algorithms. A promising framework for classical simulation is provided by tensor networks. Recently, the density-matrix renormalization group (DMRG) algorithm was developed for simulating quantum circuits using matrix product states (MPS). Although MPS are efficient for representing quantum states with one-dimensional correlation structures, the fixed linear geometry restricts the expressive power of the MPS. In this work, we extend the DMRG algorithm for simulating quantum circuits to tree tensor networks (TTNs). The framework employs a variational compression scheme that optimizes the TTN to approximate the evolved quantum state. To benchmark the method, we simulate random circuits and the quantum approximate optimization algorithm (QAOA) with various two-qubit gate connectivities. For the random circuits, we devise treelike gate layouts that are suitable for TTN and show that TTN requires less memory than MPS for the simulations. For the QAOA circuits, a naive TTN construction that exploits graph structure significantly improves the simulation fidelities. Our findings show that the DMRG algorithm with TTNs provides a promising framework for simulating quantum circuits, particularly when gate connectivities exhibit clustering or a hierarchical structure.
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.
The simulation of strongly correlated quantum systems on classical computers is an essential tool for investigating and understanding quantum materials.Due to the inherent "curse of dimensionality" of quantum systems, such simulations pose a challenging task, and have spurred the development of several computational approaches and approximations.For quasi one-dimensional lattice systems, the density matrix renormalization group (DMRG) framework (Schollwöck, 2005;White, 1992White, , 1993) has emerged as one of the most successful methods.Modern formulations are based on matrix product states (MPS) and operators (MPO) (Schollwöck, 2011): briefly speaking, a matrix product state is an Ansatz for the quantum many-body wavefunction amendable to efficient numerical manipulation.The favorable approximation properties of matrix product states have been theoretically proven for ground states of gapped Hamiltonians with local interactions (Hastings, 2007;Verstraete & Cirac, 2006), and recent work has extended this to quantum systems at finite temperature (Barthel, 2017).Over the years many variations and generalizations of the DMRG framework have been devised (Barthel, 2013;Stoudenmire & White, 2010;Verstraete, Murg, & Cirac, 2008;Vidal, 2003Vidal, , 2008)), and further developments and improvements of associated algorithms remain an active field of research.
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).
The accurate simulation of quantum circuits remains a significant challenge due to the exponential scaling of computational resources with circuit size. This work explores the application of tensor network methods, specifically Matrix Product States (MPS), to provide a scalable approach for simulating quantum circuits. We demonstrate how tensor networks can efficiently represent and manipulate the states of quantum circuits, reducing the computational burden associated with traditional methods. The core claim of this research is that tensor networks offer a viable path to accurately simulating larger and more complex quantum systems. This research introduces a novel framework for symbolic simulation, leveraging the power of tensor network representations to overcome the limitations of conventional simulation techniques. The effectiveness of this approach is illustrated through theoretical analysis and conceptual examples.