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:2205.06299 · Physical review. B./Physical review. B

Qubit-efficient simulation of thermal states with quantum tensor networks

Yuxuan Zhang, Shahin Jahanbani, Daoheng Niu, Reza Haghshenas, Andrew C. Potter

Published Oct 24, 2022• 17 citations
arXivHTMLPDF

Abstract

We present a holographic quantum simulation algorithm to variationally prepare thermal states of $d$-dimensional interacting quantum many-body systems, using only enough hardware qubits to represent a $(d\ensuremath{-}1)$-dimensional cross section. This technique implements the thermal state by approximately unraveling the quantum matrix-product density operator (qMPDO) into a stochastic mixture of quantum matrix-product states (sto-qMPS). The parameters of the quantum circuits generating the qMPS and of the probability distribution generating the stochastic mixture are determined through a variational optimization procedure. We demonstrate a small-scale proof-of-principle demonstration of this technique on Quantinuum's trapped-ion quantum processor to simulate thermal properties of correlated spin chains over a wide temperature range using only a single pair of hardware qubits. Then, through classical simulations, we explore the representational power of two versions of sto-qMPS ansatzes for larger and deeper circuits and establish empirical relationships between the circuit resources and the accuracy of the variational free energy.

DOI
10.1103/physrevb.106.165126

Related papers

Holographic quantum algorithms for simulating correlated spin systems

Michael Foss‐Feig, David Hayes, Joan M. Dreiling +5 more

We present a suite of ``holographic'' quantum algorithms for efficient ground-state preparation and dynamical evolution of correlated spin systems, which require far fewer qubits than the number of spins being simulated. The algorithms exploit the equivalence between matrix-product states (MPS) and quantum channels, along with partial measurement and qubit reuse, in order to simulate a $D$-dimensional spin system using only a $(D\ensuremath{-}1)$-dimensional subset of qubits along with an ancillary qubit register whose size scales logarithmically in the amount of entanglement present in the simulated state. Ground states can either be directly prepared from a known MPS representation or obtained via a holographic variational quantum eigensolver (holoVQE). Dynamics of MPS under local Hamiltonians for time $t$ can also be simulated with an additional (multiplicative) $\mathrm{poly}(t)$ overhead in qubit resources. These techniques open the door to efficient quantum simulation of MPS with exponentially large bond dimension, including ground states of two- and three-dimensional systems, or thermalizing dynamics with rapid entanglement growth. As a demonstration of the potential resource savings, we implement a holoVQE simulation of the antiferromagnetic Heisenberg chain on a trapped-ion quantum computer, achieving within $10(3)%$ of the exact ground-state energy of an infinite chain using only a pair of qubits.

arXiv:2005.03023•Physical Review Research•Jul 1, 2021•114 citations

Holographic Quantum Simulation of Entanglement Renormalization Circuits

Sajant Anand, Johannes Hauschild, Yuxuan Zhang +2 more

While standard approaches to quantum simulation require a number of qubits proportional to the number of simulated particles, current noisy quantum computers are limited to tens of qubits.With the technique of holographic quantum simulation, a D-dimensional system can be simulated with a (D -1)-dimensional subset of qubits, enabling the study of systems significantly larger than current quantum computers.Using circuits derived from the multiscale entanglement renormalization ansatz (MERA), we accurately prepare the ground state of an L = 32 critical, nonintegrable perturbed Ising model and measure long-range correlations on the ten-qubit Quantinuum trapped-ion computer.We introduce generalized MERA networks that interpolate between MERA and matrix product state networks and demonstrate that generalized MERA can capture far longer correlations than a MERA with the same number of qubits, at the expense of greater circuit depth.Finally, we perform noisy simulations of these two network ansatzes and find that the optimal choice of network depends on the noise level, available qubits, and the state to be represented.

arXiv:2203.00886•PRX Quantum•Sep 7, 2023•37 citations

Variational quantum simulation of thermal statistical states on a superconducting quantum processer

Xueyi Guo, Shang-Shu Li, Xiao Xiao +11 more

Quantum computers promise to solve finite-temperature properties of quantum many-body systems, which is generally challenging for classical computers due to high computational complexities. Here, we report experimental preparations of Gibbs states and excited states of Heisenberg XX and XXZ models by using a 5-qubit programmable superconducting processor. In the experiments, we apply a hybrid quantum–classical algorithm to generate finite temperature states with classical probability models and variational quantum circuits. We reveal that the Hamiltonians can be fully diagonalized with optimized quantum circuits, which enable us to prepare excited states at arbitrary energy density. We demonstrate that the approach has a self-verifying feature and can estimate fundamental thermal observables with a small statistical error. Based on numerical results, we further show that the time complexity of our approach scales polynomially in the number of qubits, revealing its potential in solving large-scale problems.

arXiv:2107.06234•Chinese Physics B•Dec 2, 2022•23 citations

Quantum circuit simulation with a local time-dependent variational principle

Jens Eisert, Aaron Sander, Maximilian Fröhlich +6 more

Abstract Classical simulations of quantum circuits are vital for assessing potential quantum advantage and benchmarking devices, yet they require sophisticated methods to avoid the exponential growth of resources. Tensor network approaches, in particular matrix product states (MPS) combined with the time-evolving block decimation (TEBD) algorithm, currently dominate large-scale circuit simulations. These methods scale efficiently when entanglement is limited but suffer rapid bond dimension growth with increasing entanglement and handle long-range gates via costly SWAP insertions. Motivated by the success of the time-dependent variational principle (TDVP) in many-body physics, we reinterpret quantum circuits as series of discrete time evolutions, using gate generators to construct an MPS-based circuit simulation via a local TDVP formulation. This addresses TEBD's key limitations by (1) naturally accommodating long-range gates and (2) optimally representing states on the MPS manifold. By diffusing entanglement more globally, the method suppresses local bond growth and reduces memory and runtime costs. We benchmark the approach on five 49-qubit circuits: three Hamiltonian circuits (1D open and periodic Heisenberg, 2D 7x7 Ising) and two algorithmic ones (quantum approximate optimization, hardware-efficient ansatz). Across all cases, our method yields substantial resource reductions over standard tools, establishing a new state-of-the-art for circuit simulation and enabling advances across quantum computing, condensed matter, and beyond.

arXiv:2508.10096•Dec 5, 2025•9 citations

Holographic Representation of One-Dimensional Many-Body Quantum States via Isometric Tensor Networks

Kaito Kobayashi, Benjamin Sappler, Frank Pollmann

Tensor network methods, most prominently matrix product states (MPS), have become fundamental tools in modern quantum many-body physics. While MPS and extensions like the multiscale entanglement renormalization ansatz (MERA) and tree tensor networks (TTN) efficiently capture area-law entanglement and its logarithmic violations, they inherently struggle to represent highly entangled wavefunctions. Specifically, reaching the volume-law regime typically demands exponential resources within these conventional frameworks. Motivated by this challenge, we propose holographic isometric tensor network states (holographic isoTNS) that simulate quantum lattice models in $D$ spatial dimensions via $(D+1)$-dimensional networks of tensors. The additional dimension substantially enlarges the representational manifold, while isometric constraints on each tensor ensure efficient contractibility. Using one-dimensional systems as testbeds, we analyze the properties of holographic isoTNS. First, we show that randomly initialized holographic isoTNS typically display volume-law entanglement at fixed bond dimension. Second, through analytic constructions and variational optimization, we demonstrate that holographic isoTNS can faithfully describe a broad class of highly entangled yet low-complexity states. In particular, the ansatz can represent arbitrary fermionic Gaussian states, Clifford states, extensions of rainbow states, and certain short-time-evolved states under local evolution. Third, to exploit this expressivity in broader contexts, we implement a time-evolving block decimation (TEBD) algorithm on holographic isoTNS. While the method remains efficient and scalable, error accumulation over TEBD sweeps suggests the need for further algorithmic improvement. Overall, holographic isoTNS broaden the scope of tensor-network methods, opening new avenues to study physics in the volume-law regime.

quant-pharXiv:2512.11967•Physical review. B./Physical review. B•Dec 16, 2025•0 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
We present a holographic quantum simulation algorithm to variationally prepare thermal states of ddd-dimensional interacting quantum many-body systems, using only enough hardware qubits to represent a (d\ensuremath−1)(d\ensuremath{-}1)(d\ensuremath−1)-dimensional cross section. This technique implements the thermal state by approximately unraveling the quantum matrix-product density operator (qMPDO) into a stochastic mixture of quantum matrix-product states (sto-qMPS). The parameters of the quantum circuits generating the qMPS and of the probability distribution generating the stochastic mixture are determined through a variational optimization procedure. We demonstrate a small-scale proof-of-principle demonstration of this technique on Quantinuum's trapped-ion quantum processor to simulate thermal properties of correlated spin chains over a wide temperature range using only a single pair of hardware qubits. Then, through classical simulations, we explore the representational power of two versions of sto-qMPS ansatzes for larger and deeper circuits and establish empirical relationships between the circuit resources and the accuracy of the variational free energy.
We present a suite of ``holographic'' quantum algorithms for efficient ground-state preparation and dynamical evolution of correlated spin systems, which require far fewer qubits than the number of spins being simulated. The algorithms exploit the equivalence between matrix-product states (MPS) and quantum channels, along with partial measurement and qubit reuse, in order to simulate a DDD-dimensional spin system using only a $(D\ensuremath{-}1)$-dimensional subset of qubits along with an ancillary qubit register whose size scales logarithmically in the amount of entanglement present in the simulated state. Ground states can either be directly prepared from a known MPS representation or obtained via a holographic variational quantum eigensolver (holoVQE). Dynamics of MPS under local Hamiltonians for time ttt can also be simulated with an additional (multiplicative) poly(t)\mathrm{poly}(t)poly(t) overhead in qubit resources. These techniques open the door to efficient quantum simulation of MPS with exponentially large bond dimension, including ground states of two- and three-dimensional systems, or thermalizing dynamics with rapid entanglement growth. As a demonstration of the potential resource savings, we implement a holoVQE simulation of the antiferromagnetic Heisenberg chain on a trapped-ion quantum computer, achieving within 10(3)10(3)%10(3) of the exact ground-state energy of an infinite chain using only a pair of qubits.
While standard approaches to quantum simulation require a number of qubits proportional to the number of simulated particles, current noisy quantum computers are limited to tens of qubits.With the technique of holographic quantum simulation, a D-dimensional system can be simulated with a (D -1)-dimensional subset of qubits, enabling the study of systems significantly larger than current quantum computers.Using circuits derived from the multiscale entanglement renormalization ansatz (MERA), we accurately prepare the ground state of an L = 32 critical, nonintegrable perturbed Ising model and measure long-range correlations on the ten-qubit Quantinuum trapped-ion computer.We introduce generalized MERA networks that interpolate between MERA and matrix product state networks and demonstrate that generalized MERA can capture far longer correlations than a MERA with the same number of qubits, at the expense of greater circuit depth.Finally, we perform noisy simulations of these two network ansatzes and find that the optimal choice of network depends on the noise level, available qubits, and the state to be represented.
Quantum computers promise to solve finite-temperature properties of quantum many-body systems, which is generally challenging for classical computers due to high computational complexities. Here, we report experimental preparations of Gibbs states and excited states of Heisenberg XX and XXZ models by using a 5-qubit programmable superconducting processor. In the experiments, we apply a hybrid quantum–classical algorithm to generate finite temperature states with classical probability models and variational quantum circuits. We reveal that the Hamiltonians can be fully diagonalized with optimized quantum circuits, which enable us to prepare excited states at arbitrary energy density. We demonstrate that the approach has a self-verifying feature and can estimate fundamental thermal observables with a small statistical error. Based on numerical results, we further show that the time complexity of our approach scales polynomially in the number of qubits, revealing its potential in solving large-scale problems.
Abstract Classical simulations of quantum circuits are vital for assessing potential quantum advantage and benchmarking devices, yet they require sophisticated methods to avoid the exponential growth of resources. Tensor network approaches, in particular matrix product states (MPS) combined with the time-evolving block decimation (TEBD) algorithm, currently dominate large-scale circuit simulations. These methods scale efficiently when entanglement is limited but suffer rapid bond dimension growth with increasing entanglement and handle long-range gates via costly SWAP insertions. Motivated by the success of the time-dependent variational principle (TDVP) in many-body physics, we reinterpret quantum circuits as series of discrete time evolutions, using gate generators to construct an MPS-based circuit simulation via a local TDVP formulation. This addresses TEBD's key limitations by (1) naturally accommodating long-range gates and (2) optimally representing states on the MPS manifold. By diffusing entanglement more globally, the method suppresses local bond growth and reduces memory and runtime costs. We benchmark the approach on five 49-qubit circuits: three Hamiltonian circuits (1D open and periodic Heisenberg, 2D 7x7 Ising) and two algorithmic ones (quantum approximate optimization, hardware-efficient ansatz). Across all cases, our method yields substantial resource reductions over standard tools, establishing a new state-of-the-art for circuit simulation and enabling advances across quantum computing, condensed matter, and beyond.
Tensor network methods, most prominently matrix product states (MPS), have become fundamental tools in modern quantum many-body physics. While MPS and extensions like the multiscale entanglement renormalization ansatz (MERA) and tree tensor networks (TTN) efficiently capture area-law entanglement and its logarithmic violations, they inherently struggle to represent highly entangled wavefunctions. Specifically, reaching the volume-law regime typically demands exponential resources within these conventional frameworks. Motivated by this challenge, we propose holographic isometric tensor network states (holographic isoTNS) that simulate quantum lattice models in DDD spatial dimensions via (D+1)(D+1)(D+1)-dimensional networks of tensors. The additional dimension substantially enlarges the representational manifold, while isometric constraints on each tensor ensure efficient contractibility. Using one-dimensional systems as testbeds, we analyze the properties of holographic isoTNS. First, we show that randomly initialized holographic isoTNS typically display volume-law entanglement at fixed bond dimension. Second, through analytic constructions and variational optimization, we demonstrate that holographic isoTNS can faithfully describe a broad class of highly entangled yet low-complexity states. In particular, the ansatz can represent arbitrary fermionic Gaussian states, Clifford states, extensions of rainbow states, and certain short-time-evolved states under local evolution. Third, to exploit this expressivity in broader contexts, we implement a time-evolving block decimation (TEBD) algorithm on holographic isoTNS. While the method remains efficient and scalable, error accumulation over TEBD sweeps suggests the need for further algorithmic improvement. Overall, holographic isoTNS broaden the scope of tensor-network methods, opening new avenues to study physics in the volume-law regime.
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.