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

Augmenting a finite-temperature tensor network with Clifford circuits

Xiangjian Qian, Jiale Huang, Mingpu Qin

Published Sep 9, 2025• 14 citations
arXivHTMLPDF

Abstract

Recent studies have highlighted the combination of tensor network methods and the stabilizer formalism as a very effective framework for simulating quantum many-body systems, encompassing areas from ground state to time evolution simulations. In these approaches, the entanglement associated with stabilizers is transferred to Clifford circuits, which can be efficiently managed due to the Gottesman-Knill theorem. Consequently, only the non-stabilizerness entanglement needs to be handled, thereby reducing the computational resources required for accurate simulations of quantum many-body systems in tensor network related methods. In this work, we adapt this paradigm for finite temperature simulations in the framework of Time-Dependent Variational Principle, in which imaginary time evolution is performed using the purification scheme. Our numerical results on the one-dimensional Heisenberg model and the two-dimensional $J_1-J_2$ Heisenberg model demonstrate that Clifford circuits can significantly improve the efficiency and accuracy of finite temperature simulations for quantum many-body systems. This improvement not only provides a useful tool for calculating finite temperature properties of quantum many-body systems, but also paves the way for further advancements in boosting the finite temperature tensor network calculations with Clifford circuits and other quantum circuits.

DOI
10.1103/gljy-1ykf

Related papers

Limits of Clifford Disentangling in Tensor Network States

Sergi Masot-Llima, Piotr Sierant, Paolo Stornati +1 more

Tensor network methods leverage the limited entanglement of quantum states to efficiently simulate many-body systems. Alternatively, Clifford circuits provide a framework for handling highly entangled stabilizer states, which have low magic and are thus also classically tractable. Clifford tensor networks combine the benefits of both approaches, exploiting Clifford circuits to reduce the classical complexity of the tensor network description of states, with promising effects on simulation approaches. We study the disentangling power of Clifford transformations acting on tensor networks, with a particular emphasis on entanglement cooling strategies. We identify regimes where exact or heuristic Clifford disentanglers are effective, explain the link between the two approaches, and characterize their breakdown as non-Clifford resources accumulate. Additionally, we prove that, beyond stabilizer settings, no Clifford operation can universally disentangle even a single qubit from an arbitrary non-Clifford rotation. Our results clarify both the capabilities and fundamental limitations of Clifford-based simulation methods.

quant-pharXiv:2602.15942•Physical review. B./Physical review. B•Feb 19, 2026•4 citations

Clifford Circuits Augmented Time-Dependent Variational Principle

Xiangjian Qian, Jiale Huang, Mingpu Qin

The recently proposed Clifford circuits augmented matrix product states (CA-MPSs) [X. Qian, J. Huang, and M. Qin, Phys. Rev. Lett. 133, 190402 (2024)PRLTAO0031-900710.1103/PhysRevLett.133.190402] seamlessly augment density matrix renormalization groups with Clifford circuits. In CA-MPSs, the entanglement from stabilizers is transferred to the Clifford circuits, which can be easily handled according to the Gottesman-Knill theorem. As a result, an MPS needs only to deal with the nonstabilizer entanglement, which largely reduces the bond dimension and the resource required for the accurate simulation of many-body systems. In this Letter, we generalize CA-MPSs to the framework of the time-dependent variational principle (TDVP) for time evolution simulations. In this method, we apply Clifford circuits to the resulting MPS in each TDVP step with a two-site sweeping process similar as in density matrix renormalization groups, aiming at reducing the entanglement entropy in the MPS, and the Hamiltonian is transformed accordingly using the chosen Clifford circuits. Similar as in CA-MPSs, the Clifford circuits does not increase the number of terms in the Hamiltonian, which makes the overhead very small in the new method. We test this method in XXZ chain, 2D Heisenberg model, and Kitaev honeycomb model. The results show that the Clifford circuits augmented TDVP method can reduce the entanglement entropy in the time evolution process and hence makes the simulation reliable for a longer time. The Clifford circuits augmented time-dependent variational principle provides a useful tool for the simulation of the time evolution process of many-body systems in the future.

arXiv:2407.03202•Physical Review Letters•Apr 15, 2025•34 citations

Clifford circuits augmented matrix product states for fermion systems

Jiale Huang, Xiangjian Qian, Mingpu Qin

Clifford circuits augmented matrix product states (CAMPS) was recently proposed to leverage the advantages of both Clifford circuits and matrix product states (MPS). Clifford circuits can support large entanglement and can be efficiently simulated classically according to the Gottesman-Knill theorem. So in CAMPS, MPS needs only to handle the so-called nonstabilizerness entanglement entropy which significantly improves the simulation accuracy for a given bond dimension. In this work, we generalize CAMPS to study the fermion system by taking advantage of the Jordan-Wigner transformation which can map the studied fermion system to a spin system. We benchmark the method on both the spinless $t\text{\ensuremath{-}}V$ model and the spinful Hubbard model. Our test results show significant improvement of the accuracy of CAMPS over MPS, especially when the interactions are strong. Fermionic CAMPS provides a useful tool for the accurate study of many-body fermion systems in the future and has the potential to help resolve long-standing issues.

arXiv:2501.00413•Physical review. B./Physical review. B•Oct 14, 2025•14 citations

Stabilizer Tensor Networks: Universal Quantum Simulator on a Basis of Stabilizer States

Sergi Masot-Llima, Artur García-Sáez

Efficient simulation of quantum computers relies on understanding and exploiting the properties of quantum states. This is the case for methods such as tensor networks, based on entanglement, and the tableau formalism, which represents stabilizer states. In this Letter, we integrate these two approaches to present a generalization of the tableau formalism used for Clifford circuit simulation. We explicitly prove how to update our formalism with Clifford gates, non-Clifford gates, and measurements, enabling universal circuit simulation. We also discuss how the framework allows for efficient simulation of more states, raising some interesting questions on the representation power of tensor networks and the quantum properties of resources such as entanglement and magic, and support our claims with simulations.

arXiv:2403.08724•Physical Review Letters•Dec 3, 2024•63 citations

Clifford Simulation: Techniques and Applications

Alex Kerzner

Despite the widespread belief that quantum computers cannot be efficiently simulated classically, efficient simulation is known to be possible in certain restricted regimes. In particular, the Gottesman-Knill theorem states that Clifford circuits can be efficiently simulated. We begin this thesis by reviewing and comparing several known techniques for efficient simulation of Clifford circuits: the stabilizer formalism, CH form, affine form, and the graph state formalism. We describe each simulation method and give four different proofs of the Gottesman-Knill theorem. \n \nNext we review a recent work [15], which shows that restricting the geometry of Clifford circuits can lead to a further speedup. We give an algorithm for simulating Pauli basis measurements on a planar graph state in time $\\widetilde{O}(n^{\\omega/2})$, where $\\omega < 2.373$ is the matrix multiplication exponent. This algorithm achieves a quadratic speedup over using Clifford simulation methods directly. As an application of this algorithm, we consider a depth-$d$ Clifford circuit whose two-qubit gates act along edges of a planar graph and describe how to sample from its output distribution or compute an output probability in time $\\widetilde{O}(n^{\\omega/2}d^\\omega)$. For $d= O(\\log n)$, both of these results are quadratic speedups over using Clifford simulation methods directly. \n \nFinally, we extend these simulation algorithms to universal circuits by using stabilizer rank methods. We follow a previously known gadgetization procedure [9] to show that given a depth-$d$ Clifford+$T$ circuit with $t$ $T$ gates and whose two-qubit gates act along edges of a planar graph, we can sample from its output distribution in time $\\widetilde{O}(2^{0.7926t}n^{5/2}t^{6} d^3)$ and can compute output probabilities in time $\\widetilde{O}(2^{0.3963t}n^{3/2}t^{6} d^3)$. Previous work [9,6], applied to the case $d=O(\\log n)$, gives algorithms for sampling in time $O(2^{0.3963t} n^6 t^6)$ and computation of output probabilities in time $O(2^{0.3963t}n^3t^3)$. Our sampling algorithm offers improved scaling in $n$ but poorer scaling in the exponential term, while our algorithm for computing output probabilities offers improved scaling in $n$ with identical scaling in the exponential term.

•May 28, 2021•2 citations

Augmenting Density Matrix Renormalization Group with Clifford Circuits

Xiangjian Qian, Jiale Huang, Mingpu Qin

The density matrix renormalization group (DMRG) is widely acknowledged as a highly effective and accurate method for solving one-dimensional quantum many-body systems. However, the direct application of DMRG to the study of two-dimensional systems encounters challenges due to the limited entanglement encoded in the underlying wave-function Ansatz, known as the matrix product state. Conversely, Clifford circuits offer a promising avenue for simulating states with substantial entanglement, albeit confined to stabilizer states. In this work, we present the seamless integration of Clifford circuits within the DMRG algorithm, leveraging the advantages of both Clifford circuits and DMRG. This integration leads to a significant enhancement in simulation accuracy with small additional computational cost. Moreover, this framework is useful not only for its current application but also for its potential to be easily adapted to various other numerical approaches.

arXiv:2405.09217•Physical Review Letters•Nov 6, 2024•58 citations
Recent studies have highlighted the combination of tensor network methods and the stabilizer formalism as a very effective framework for simulating quantum many-body systems, encompassing areas from ground state to time evolution simulations. In these approaches, the entanglement associated with stabilizers is transferred to Clifford circuits, which can be efficiently managed due to the Gottesman-Knill theorem. Consequently, only the non-stabilizerness entanglement needs to be handled, thereby reducing the computational resources required for accurate simulations of quantum many-body systems in tensor network related methods. In this work, we adapt this paradigm for finite temperature simulations in the framework of Time-Dependent Variational Principle, in which imaginary time evolution is performed using the purification scheme. Our numerical results on the one-dimensional Heisenberg model and the two-dimensional J1−J2J_1-J_2J1​−J2​ Heisenberg model demonstrate that Clifford circuits can significantly improve the efficiency and accuracy of finite temperature simulations for quantum many-body systems. This improvement not only provides a useful tool for calculating finite temperature properties of quantum many-body systems, but also paves the way for further advancements in boosting the finite temperature tensor network calculations with Clifford circuits and other quantum circuits.
Tensor network methods leverage the limited entanglement of quantum states to efficiently simulate many-body systems. Alternatively, Clifford circuits provide a framework for handling highly entangled stabilizer states, which have low magic and are thus also classically tractable. Clifford tensor networks combine the benefits of both approaches, exploiting Clifford circuits to reduce the classical complexity of the tensor network description of states, with promising effects on simulation approaches. We study the disentangling power of Clifford transformations acting on tensor networks, with a particular emphasis on entanglement cooling strategies. We identify regimes where exact or heuristic Clifford disentanglers are effective, explain the link between the two approaches, and characterize their breakdown as non-Clifford resources accumulate. Additionally, we prove that, beyond stabilizer settings, no Clifford operation can universally disentangle even a single qubit from an arbitrary non-Clifford rotation. Our results clarify both the capabilities and fundamental limitations of Clifford-based simulation methods.
The recently proposed Clifford circuits augmented matrix product states (CA-MPSs) [X. Qian, J. Huang, and M. Qin, Phys. Rev. Lett. 133, 190402 (2024)PRLTAO0031-900710.1103/PhysRevLett.133.190402] seamlessly augment density matrix renormalization groups with Clifford circuits. In CA-MPSs, the entanglement from stabilizers is transferred to the Clifford circuits, which can be easily handled according to the Gottesman-Knill theorem. As a result, an MPS needs only to deal with the nonstabilizer entanglement, which largely reduces the bond dimension and the resource required for the accurate simulation of many-body systems. In this Letter, we generalize CA-MPSs to the framework of the time-dependent variational principle (TDVP) for time evolution simulations. In this method, we apply Clifford circuits to the resulting MPS in each TDVP step with a two-site sweeping process similar as in density matrix renormalization groups, aiming at reducing the entanglement entropy in the MPS, and the Hamiltonian is transformed accordingly using the chosen Clifford circuits. Similar as in CA-MPSs, the Clifford circuits does not increase the number of terms in the Hamiltonian, which makes the overhead very small in the new method. We test this method in XXZ chain, 2D Heisenberg model, and Kitaev honeycomb model. The results show that the Clifford circuits augmented TDVP method can reduce the entanglement entropy in the time evolution process and hence makes the simulation reliable for a longer time. The Clifford circuits augmented time-dependent variational principle provides a useful tool for the simulation of the time evolution process of many-body systems in the future.
Clifford circuits augmented matrix product states (CAMPS) was recently proposed to leverage the advantages of both Clifford circuits and matrix product states (MPS). Clifford circuits can support large entanglement and can be efficiently simulated classically according to the Gottesman-Knill theorem. So in CAMPS, MPS needs only to handle the so-called nonstabilizerness entanglement entropy which significantly improves the simulation accuracy for a given bond dimension. In this work, we generalize CAMPS to study the fermion system by taking advantage of the Jordan-Wigner transformation which can map the studied fermion system to a spin system. We benchmark the method on both the spinless $t\text{\ensuremath{-}}V$ model and the spinful Hubbard model. Our test results show significant improvement of the accuracy of CAMPS over MPS, especially when the interactions are strong. Fermionic CAMPS provides a useful tool for the accurate study of many-body fermion systems in the future and has the potential to help resolve long-standing issues.
Efficient simulation of quantum computers relies on understanding and exploiting the properties of quantum states. This is the case for methods such as tensor networks, based on entanglement, and the tableau formalism, which represents stabilizer states. In this Letter, we integrate these two approaches to present a generalization of the tableau formalism used for Clifford circuit simulation. We explicitly prove how to update our formalism with Clifford gates, non-Clifford gates, and measurements, enabling universal circuit simulation. We also discuss how the framework allows for efficient simulation of more states, raising some interesting questions on the representation power of tensor networks and the quantum properties of resources such as entanglement and magic, and support our claims with simulations.
Despite the widespread belief that quantum computers cannot be efficiently simulated classically, efficient simulation is known to be possible in certain restricted regimes. In particular, the Gottesman-Knill theorem states that Clifford circuits can be efficiently simulated. We begin this thesis by reviewing and comparing several known techniques for efficient simulation of Clifford circuits: the stabilizer formalism, CH form, affine form, and the graph state formalism. We describe each simulation method and give four different proofs of the Gottesman-Knill theorem. \n \nNext we review a recent work [15], which shows that restricting the geometry of Clifford circuits can lead to a further speedup. We give an algorithm for simulating Pauli basis measurements on a planar graph state in time widetildeO(nomega/2)\\widetilde{O}(n^{\\omega/2})widetildeO(nomega/2), where omega<2.373\\omega < 2.373omega<2.373 is the matrix multiplication exponent. This algorithm achieves a quadratic speedup over using Clifford simulation methods directly. As an application of this algorithm, we consider a depth-ddd Clifford circuit whose two-qubit gates act along edges of a planar graph and describe how to sample from its output distribution or compute an output probability in time $\\widetilde{O}(n^{\\omega/2}d^\\omega)$. For d=O(logn)d= O(\\log n)d=O(logn), both of these results are quadratic speedups over using Clifford simulation methods directly. \n \nFinally, we extend these simulation algorithms to universal circuits by using stabilizer rank methods. We follow a previously known gadgetization procedure [9] to show that given a depth-ddd Clifford+TTT circuit with ttt TTT gates and whose two-qubit gates act along edges of a planar graph, we can sample from its output distribution in time widetildeO(20.7926tn5/2t6d3)\\widetilde{O}(2^{0.7926t}n^{5/2}t^{6} d^3)widetildeO(20.7926tn5/2t6d3) and can compute output probabilities in time widetildeO(20.3963tn3/2t6d3)\\widetilde{O}(2^{0.3963t}n^{3/2}t^{6} d^3)widetildeO(20.3963tn3/2t6d3). Previous work [9,6], applied to the case d=O(logn)d=O(\\log n)d=O(logn), gives algorithms for sampling in time O(20.3963tn6t6)O(2^{0.3963t} n^6 t^6)O(20.3963tn6t6) and computation of output probabilities in time O(20.3963tn3t3)O(2^{0.3963t}n^3t^3)O(20.3963tn3t3). Our sampling algorithm offers improved scaling in nnn but poorer scaling in the exponential term, while our algorithm for computing output probabilities offers improved scaling in nnn with identical scaling in the exponential term.
The density matrix renormalization group (DMRG) is widely acknowledged as a highly effective and accurate method for solving one-dimensional quantum many-body systems. However, the direct application of DMRG to the study of two-dimensional systems encounters challenges due to the limited entanglement encoded in the underlying wave-function Ansatz, known as the matrix product state. Conversely, Clifford circuits offer a promising avenue for simulating states with substantial entanglement, albeit confined to stabilizer states. In this work, we present the seamless integration of Clifford circuits within the DMRG algorithm, leveraging the advantages of both Clifford circuits and DMRG. This integration leads to a significant enhancement in simulation accuracy with small additional computational cost. Moreover, this framework is useful not only for its current application but also for its potential to be easily adapted to various other numerical approaches.