- Open Access
Estimating Nonstabilizerness Dynamics Without Simulating It
PRX Quantum 6, 030320 – Published 4 August, 2025
DOI: https://doi.org/10.1103/msm2-vmg7
Abstract
We introduce the iterative Clifford circuit renormalization (ICCR), a novel technique designed to handle the dynamics of nonstabilizerness (also known as quantum magic) in generic quantum circuits composed of Clifford and non-Clifford gates, as well as measurements, extending beyond the reach of pre-existing methods. ICCR iteratively adjusts the starting circuit, transforming it into a Clifford circuit where all elements that can alter the nonstabilizerness, such as measurements or gates, have been removed. In the process the initial state is renormalized in such a way that the new circuit outputs the same final state as the original one. This approach embeds the complex dynamics of nonstabilizerness in the flow of an effective initial state, enabling the efficient evaluation of stabilizer Renyi entropies and magic nullity while avoiding the need for direct and computationally expensive simulation of the original circuit. The initial state renormalization can be computed explicitly using a matrix-product state approximation that can be systematically improved. We implement the ICCR algorithm to evaluate the nonstabilizerness dynamics for systems of size up to , in one and more dimensions. We validate our method by comparing it to tensor-network simulations. Finally, we employ the ICCR technique to study measurement-induced magic transitions in monitored circuits without and with gates.
Physics Subject Headings (PhySH)
Popular Summary
Quantum computers are attracting increasing attention because they promise to solve complex problems that are beyond the reach of classical devices by harnessing unique features of quantum mechanics as resources. One such resource, called nonstabilizerness, has recently emerged as a key quantity in quantum physics, constituting a necessary ingredient for quantum advantage. In fact, studying nonstabilizerness not only sheds light on how quantum systems behave, but also quantifies how difficult they are to simulate on classical computers, thus making its investigation both fundamentally important and practically relevant.
In our work, we introduce a new technique to evaluate this resource using classical computers for a broad class of systems known as quantum circuits, which are the quantum counterparts of traditional algorithms. Our approach relies on efficient manipulations of the circuit structure, allowing us to effectively bypass the step of explicitly simulating quantum states, which is typically a major bottleneck. This enables a computationally cheap evaluation of nonstabilizerness and significantly expands the reach of existing methods.
The technique we propose offers a powerful and flexible tool for future research on computational complexity in quantum circuits. On the theoretical side, it can be used to explore quantum dynamics and nonequilibrium phases of matter. On the practical side, it enables the estimation of the computational cost of quantum algorithms and thus the potential for quantum advantage.
Article Text
References (67)
- R. P. Feynman, Simulating physics with computers, Int. J. Theor. Phys. 21, 467 (1982).
- W. Kohn, Nobel Lecture: Electronic structure of matter—wave functions and density functionals, Rev. Mod. Phys. 71, 1253 (1999).
- P. Silvi, F. Tschirsich, M. Gerster, J. Jünemann, D. Jaschke, M. Rizzi, and S. Montangero, The tensor networks anthology: Simulation techniques for many-body quantum lattice systems, SciPost Phys. Lect. Notes, 8 (2019).
- J. Biamonte, Lectures on quantum tensor networks, ArXiv:1912.10049.
- G. Vidal, Efficient simulation of one-dimensional quantum many-body systems, Phys. Rev. Lett. 93, 040502 (2004).
- M. B. Hastings, An area law for one-dimensional quantum systems, J. Stat. Mech.: Theory Exp. 2007, P08024 (2007).
- U. Schollwöck, The density-matrix renormalization group in the age of matrix product states, Ann. Phys. 326, 96 (2011).
- B. M. Terhal and D. P. DiVincenzo, Classical simulation of noninteracting-Fermion quantum circuits, Phys. Rev. A 65, 032325 (2002).
- R. Jozsa and A. Miyake, Matchgates and classical simulation of quantum circuits, Proc. R. Soc. A: Math. Phys. Eng. Sci. 464, 3089 (2008).
- J. Surace and L. Tagliacozzo, Fermionic Gaussian states: an introduction to numerical approaches, SciPost Phys. Lect. Notes, 54 (2022).
- D. Gottesman, Stabilizer codes and quantum error correction, Arxiv:quant-ph/9705052.
- D. Gottesman, Theory of fault-tolerant quantum computation, Phys. Rev. A 57, 127 (1998).
- D. Gottesman, The Heisenberg representation of quantum computers, ArXiv:quant-ph/9807006.
- S. Aaronson and D. Gottesman, Improved simulation of stabilizer circuits, Phys. Rev. A 70, 052328 (2004).
- S. Bravyi and A. Kitaev, Universal quantum computation with ideal Clifford gates and noisy ancillas, Phys. Rev. A 71, 022316 (2005).
- J. R. Seddon, B. Regula, H. Pashayan, Y. Ouyang, and E. T. Campbell, Quantifying quantum speedups: improved classical simulation from tighter magic monotones, PRX Quantum 2, 010345 (2021).
- V. Veitch, S. A. H. Mousavian, D. Gottesman, and J. Emerson, The resource theory of stabilizer quantum computation, New J. Phys. 16, 013009 (2014).
- M. Howard and E. Campbell, Application of a resource theory for magic states to fault-tolerant quantum computing, Phys. Rev. Lett. 118, 090501 (2017).
- Z.-W. Liu and A. Winter, Many-body quantum magic, PRX Quantum 3, 020333 (2022).
- L. Leone, S. F. E. Oliviero, Y. Zhou, and A. Hamma, Quantum chaos is quantum, Quantum 5, 453 (2021).
- S. F. E. Oliviero, L. Leone, A. Hamma, and S. Lloyd, Measuring magic on a quantum processor, Npj Quantum Inf. 8, 148 (2022).
- P. Niroula, C. D. White, Q. Wang, S. Johri, D. Zhu, C. Monroe, C. Noel, and M. J. Gullans, Phase transition in magic with random quantum circuits, Nat. Phys. 20, 1786 (2024).
- X. Turkeshi and P. Sierant, Error-resilience phase transitions in encoding-decoding quantum circuits, Phys. Rev. Lett. 132, 140401 (2024).
- G. E. Fux, E. Tirrito, M. Dalmonte, and R. Fazio, Entanglement – nonstabilizerness separation in hybrid quantum circuits, Phys. Rev. Res. 6, L042030 (2024).
- M. Bejan, C. McLauchlan, and B. Béri, Dynamical magic transitions in monitored Clifford+ circuits, PRX Quantum 5, 030332 (2024).
- A. F. Mello, G. Lami, and M. Collura, Retrieving nonstabilizerness with neural networks, Phys. Rev. A 111, 012440 (2025).
- G. Lami and M. Collura, Nonstabilizerness via perfect Pauli sampling of matrix product states, Phys. Rev. Lett. 131, 180401 (2023).
- G. Lami and M. Collura, Unveiling the stabilizer group of a matrix product state, Phys. Rev. Lett. 133, 010602 (2024).
- P. S. Tarabunga, E. Tirrito, T. Chanda, and M. Dalmonte, Many-body magic via Pauli-Markov chains—from criticality to gauge theories, PRX Quantum 4, 040317 (2023).
- L. Leone, S. F. E. Oliviero, and A. Hamma, Stabilizer Renyi entropy, Phys. Rev. Lett. 128, 050402 (2022).
- T. Haug and M. Kim, Scalable measures of magic resource for quantum computers, PRX Quantum 4, 010301 (2023).
- T. Haug and L. Piroli, Quantifying nonstabilizerness of matrix product states, Phys. Rev. B 107, 035148 (2023).
- P. S. Tarabunga, E. Tirrito, M. C. Bañuls, and M. Dalmonte, Nonstabilizerness via matrix product states in the Pauli basis, Phys. Rev. Lett. 133, 010601 (2024).
- B. Skinner, J. Ruhman, and A. Nahum, Measurement-induced phase transitions in the dynamics of entanglement, Phys. Rev. X 9, 031009 (2019).
- M. J. Gullans and D. A. Huse, Dynamical purification phase transition induced by quantum measurements, Phys. Rev. X 10, 041020 (2020).
- X. Turkeshi, R. Fazio, and M. Dalmonte, Measurement-induced criticality in -dimensional hybrid quantum circuits, Phys. Rev. B 102, 014315 (2020).
- A. Nahum, S. Roy, B. Skinner, and J. Ruhman, Measurement and entanglement phase transitions in all-to-all quantum circuits, on quantum trees, and in Landau-Ginsburg theory, PRX Quantum 2, 010352 (2021).
- A. Zabalo, M. J. Gullans, J. H. Wilson, S. Gopalakrishnan, D. A. Huse, and J. H. Pixley, Critical properties of the measurement-induced transition in random quantum circuits, Phys. Rev. B 101, 060301 (2020).
- A. Paviglianiti and A. Silva, Multipartite entanglement in the measurement-induced phase transition of the quantum Ising chain, Phys. Rev. B 108, 184302 (2023).
- P. Sierant, M. Schirò, M. Lewenstein, and X. Turkeshi, Measurement-induced phase transitions in -dimensional stabilizer circuits, Phys. Rev. B 106, 214316 (2022).
- S. F. E. Oliviero, L. Leone, and A. Hamma, Magic-state resource theory for the ground state of the transverse-field Ising model, Phys. Rev. A 106, 042426 (2022).
- T. Haug and L. Piroli, Stabilizer entropies and nonstabilizerness monotones, Quantum 7, 1092 (2023).
- E. Tirrito, P. S. Tarabunga, G. Lami, T. Chanda, L. Leone, S. F. E. Oliviero, M. Dalmonte, M. Collura, and A. Hamma, Quantifying nonstabilizerness through entanglement spectrum flatness, Phys. Rev. A 109, L040401 (2024).
- D. Rattacaso, L. Leone, S. F. E. Oliviero, and A. Hamma, Stabilizer entropy dynamics after a quantum quench, Phys. Rev. A 108, 042407 (2023).
- L. Leone and L. Bittel, Stabilizer entropies are monotones for magic-state resource theory, Phys. Rev. A 110, L040403 (2024).
- S. Bravyi and D. Gosset, Improved classical simulation of quantum circuits dominated by Clifford gates, Phys. Rev. Lett. 116, 250501 (2016).
- X. Zhou, D. W. Leung, and I. L. Chuang, Methodology for quantum logic gate construction, Phys. Rev. A 62, 052316 (2000).
- As we shall see later, replacing the measurement with unitary gates can require a redefinition of the initial state of the circuit, and possibly an increase in its complexity. If the target qubit is in an eigenstate of or the redefinition is trivial, and it does not bear any growth of complexity.
- We previously removed from all sites corresponding to eigenstates of . Hence, any with must correspond to an eigenstate of or .
- C. Gidney, Stim: a fast stabilizer circuit simulator, Quantum 5, 497 (2021).
- G. Lami, T. Haug, and J. D. Nardis, Quantum state designs with Clifford-enhanced matrix product states, PRX Quantum 6, 010345 (2025).
- M. Ippoliti and W. W. Ho, Solvable model of deep thermalization with distinct design times, Quantum 6, 886 (2022).
- D. Gross, K. Audenaert, and J. Eisert, Evenly distributed unitaries: on the structure of unitary designs, J. Math. Phys. 48, 052104 (2007).
- A. A. Mele, Introduction to Haar measure tools in quantum information: a beginner’s tutorial, Quantum 8, 1340 (2024).
- X. Qian, J. Huang, and M. Qin, Augmenting density matrix renormalization group with Clifford circuits, Phys. Rev. Lett. 133, 190402 (2024).
- A. F. Mello, A. Santini, and M. Collura, Hybrid stabilizer matrix product operator, Phys. Rev. Lett. 133, 150604 (2024).
- J. Huang, X. Qian, and M. Qin, Non-stabilizerness entanglement entropy: a measure of hardness in the classical simulation of quantum many-body systems, ArXiv:2409.16895.
- G. E. Fux, B. Béri, R. Fazio, and E. Tirrito, Disentangling unitary dynamics with classically simulable quantum circuits, ArXiv:2410.09001.
- The difference between the two possible measurement outcomes only amounts to the presence or absence of an gate in Eq. (15). This gate, being a rotation, can at most affect the outcomes of the following iterations.
- M. Beverland, E. Campbell, M. Howard, and V. Kliuchnikov, Lower bounds on the non-Clifford resources for quantum computations, Quantum Sci. Technol. 5, 035009 (2020).
- These events are rare in the sense that they typically require a fine tuning of the properties of the state to occur. For instance, consider the state with stabilizer dimension , and perform a measurement of the Pauli operator . For both possible outcomes, the final state will be stabilizer, thus having . However, if is slightly perturbed, for instance by a small rotation generated by , then both postmeasurement states will have . Hence, it is indeed possible that grows by more than a unit, but this requires a careful and fine-tuned choice of the state.
- E. M. Stoudenmire and S. R. White, Minimally entangled typical thermal state algorithms, New J. Phys. 12, 055026 (2010).
- A. J. Ferris and G. Vidal, Perfect sampling with unitary tensor networks, Phys. Rev. B 85, 165146 (2012).
- For this comparison, we adopted the same trajectories (i.e., the same choices of Clifford gates and measurement outcomes) in the two methods.
- O. Lunt, M. Szyniszewski, and A. Pal, Measurement-induced criticality and entanglement clusters: a study of one-dimensional and two-dimensional Clifford circuits, Phys. Rev. B 104, 155111 (2021).
- First, we use Clifford gates to rewrite the rotation in terms of a rotation as . Next, the rotation by the angle is implemented analogously to the gate, using the ancilla resource state in place of in Eq. (3).
- A. Paviglianiti, G. Lami, M. Collura, and A. Silva, Data for: estimating non-stabilizerness dynamics without simulating it (2025).
