Limits of Clifford Disentangling in Tensor Network States

• URL: http://arxiv.org/abs/2602.15942v2
• Date: Sun, 22 Feb 2026 16:57:09 GMT
• Title: Limits of Clifford Disentangling in Tensor Network States
• Authors: Sergi Masot-Llima, Piotr Sierant, Paolo Stornati, Artur Garcia-Saez,
• Abstract summary: We study the disentangling power of Clifford transformations acting on tensor networks.<n>We prove that no Clifford operation can universally disentangle even a single qubit from an arbitrary non-Clifford rotation.
• Score: 0.27998963147546146
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Clifford Circuits Augmented Grassmann Matrix Product States [2.7892067588273517]
  Recent advances in combining Clifford circuits with tensor network (TN) states have shown that classically simulable disentanglers can significantly reduce entanglement.<n>We develop a variational TN framework based on Grassmann tensor networks, which encode fermionic statistics while preserving locality.<n>Our results show that Clifford disentangling removes the classically simulable component of entanglement, leading to a reduced bond dimension and improved accuracy in ground-state energy estimates.
  arXiv  Detail & Related papers  (2025-10-05T11:42:28Z)
• Unlocking early fault-tolerant quantum computing with mitigated magic dilution [41.95227943686519]
  We introduce mitigated magic dilution (MMD) as an approach to synthesise small-angle rotations.<n>This work paves the way for early fault-tolerant demonstrations on devices supporting millions of quantum operations.
  arXiv  Detail & Related papers  (2025-05-15T17:19:19Z)
• Clifford and Non-Clifford Splitting in Quantum Circuits: Applications and ZX-Calculus Detection Procedure [49.1574468325115]
  We propose and analyze use cases that come from quantum circuits that can be written as product between a Clifford and a Non-Clifford unitary.<n>We make use of ZX-Calculus and its assets to detect a limiting border of these circuits that would allow for a separation between a Clifford section and a Non-Clifford section.
  arXiv  Detail & Related papers  (2025-04-22T16:10:34Z)
• When Clifford benchmarks are sufficient; estimating application performance with scalable proxy circuits [0.0]
  We show that for a broad class of error models these concerns are unwarranted.<n>We show that for error models that admit noise tailoring by Pauli twirling, the diamond norm and fidelity of any generic circuit is well approximated by the fidelities of proxy circuits composed only of Clifford gates.
  arXiv  Detail & Related papers  (2025-03-07T21:18:59Z)
• Anticoncentration in Clifford Circuits and Beyond: From Random Tensor Networks to Pseudo-Magic States [0.0]
  Anticoncentration describes how an ensemble of quantum states spreads over the allowed Hilbert space.<n>We investigate the anticoncentration of random Clifford circuits toward the overlap distribution of random stabilizer states.<n>We show that inserting a polylogarithmic in qudit number of $T$-states is sufficient to drive the overlap distribution toward the Porter-Thomas statistics.
  arXiv  Detail & Related papers  (2025-02-27T19:00:29Z)
• Clifford-Dressed Variational Principles for Precise Loschmidt Echoes [44.99833362998488]
  We extend the recently introduced Clifford dressed Time-Dependent Variational Principle (TDVP) to efficiently compute many-body wavefunction amplitudes in the computational basis.<n>By incorporating Clifford disentangling gates during TDVP evolution, our method effectively controls entanglement growth while keeping the computation of these amplitudes accessible.
  arXiv  Detail & Related papers  (2025-02-03T22:43:32Z)
• Stabilizer disentangling of conformal field theories [0.0]
  We investigate the entanglement properties of lattice models hosting conformal field theories cooled via local Clifford operations. We uncover two distinct regimes: a constant gain regime, where disentangling is volume-independent, and a log-gain regime, where disentanglement increases with volume.
  arXiv  Detail & Related papers  (2024-11-18T16:50:47Z)
• Hybrid Stabilizer Matrix Product Operator [44.99833362998488]
  We introduce a novel hybrid approach combining tensor network methods with the stabilizer formalism to address the challenges of simulating many-body quantum systems. We demonstrate the effectiveness of our method through applications to random Clifford T-doped circuits and Random Clifford Floquet Dynamics.
  arXiv  Detail & Related papers  (2024-05-09T18:32:10Z)
• Low-depth Clifford circuits approximately solve MaxCut [44.99833362998488]
  We introduce a quantum-inspired approximation algorithm for MaxCut based on low-depth Clifford circuits. Our algorithm finds an approximate solution of MaxCut on an $N$-vertex graph by building a depth $O(N)$ Clifford circuit.
  arXiv  Detail & Related papers  (2023-10-23T15:20:03Z)
• Simulation of IBM's kicked Ising experiment with Projected Entangled Pair Operator [71.10376783074766]
  We perform classical simulations of the 127-qubit kicked Ising model, which was recently emulated using a quantum circuit with error mitigation. Our approach is based on the projected entangled pair operator (PEPO) in the Heisenberg picture. We develop a Clifford expansion theory to compute exact expectation values and use them to evaluate algorithms.
  arXiv  Detail & Related papers  (2023-08-06T10:24:23Z)
• Extending Classically Simulatable Bounds of Clifford Circuits with Nonstabilizer States via Framed Wigner Functions [3.9482012852779085]
  Wigner function formalism has played a pivotal role in examining the non-classical aspects of quantum states and their classical simulatability.<n>We propose a novel classical simulation method for qubit Clifford circuits based on the framed Wigner function.
  arXiv  Detail & Related papers  (2023-07-31T14:02:33Z)
• Entangled Pair Resource Allocation under Uncertain Fidelity Requirements [59.83361663430336]
  In quantum networks, effective entanglement routing facilitates communication between quantum source and quantum destination nodes. We propose a resource allocation model for entangled pairs and an entanglement routing model with a fidelity guarantee. Our proposed model can reduce the total cost by at least 20% compared to the baseline model.
  arXiv  Detail & Related papers  (2023-04-10T07:16:51Z)
• Iterative Qubit Coupled Cluster using only Clifford circuits [36.136619420474766]
  An ideal state preparation protocol can be characterized by being easily generated classically. We propose a method that meets these requirements by introducing a variant of the iterative qubit coupled cluster (iQCC) We demonstrate the algorithm's correctness in ground-state simulations and extend our study to complex systems like the titanium-based compound Ti(C5H5)(CH3)3 with a (20, 20) active space.
  arXiv  Detail & Related papers  (2022-11-18T20:31:10Z)
• Simulating quench dynamics on a digital quantum computer with data-driven error mitigation [62.997667081978825]
  We present one of the first implementations of several Clifford data regression based methods which are used to mitigate the effect of noise in real quantum data. We find in general Clifford data regression based techniques are advantageous in comparison with zero-noise extrapolation. This is the largest systems investigated so far in a study of this type.
  arXiv  Detail & Related papers  (2021-03-23T16:56:14Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.