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:2401.16498 · Physical Review Letters

Nonstabilizerness via Matrix Product States in the Pauli Basis

Poetri Sonya Tarabunga, Emanuele Tirrito, Mari Carmen Bañuls, Marcello Dalmonte

Published Jul 1, 2024• 78 citations
arXivHTMLPDF

Abstract

Nonstabilizerness, also known as "magic," stands as a crucial resource for achieving a potential advantage in quantum computing. Its connection to many-body physical phenomena is poorly understood at present, mostly due to a lack of practical methods to compute it at large scales. We present a novel approach for the evaluation of nonstabilizerness within the framework of matrix product states (MPSs), based on expressing the MPS directly in the Pauli basis. Our framework provides a powerful tool for efficiently calculating various measures of nonstabilizerness, including stabilizer Rényi entropies, stabilizer nullity, and Bell magic, and enables the learning of the stabilizer group of an MPS. We showcase the efficacy and versatility of our method in the ground states of Ising and XXZ spin chains, as well as in circuits dynamics that has recently been realized in Rydberg atom arrays, where we provide concrete benchmarks for future experiments on logical qubits up to twice the sizes already realized.

DOI
10.1103/physrevlett.133.010601

Related papers

Quantifying nonstabilizerness of matrix product states

Tobias Haug, Lorenzo Piroli

Nonstabilizerness, also known as magic, quantifies the number of non-Clifford operations needed to prepare a quantum state. As typical measures either involve minimization procedures or a computational cost exponential in the number of qubits $N$, it is notoriously hard to characterize for many-body states. In this paper, we show that nonstabilizerness, as quantified by the recently introduced stabilizer R\'enyi entropies (SREs), can be computed efficiently for matrix product states (MPSs). Specifically, given an MPS of bond dimension $\ensuremath{\chi}$ and integer R\'enyi index $n>1$, we show that the SRE can be expressed in terms of the norm of an MPS with bond dimension ${\ensuremath{\chi}}^{2n}$. For translation-invariant states, this allows us to extract it from a single tensor, the transfer matrix, while for generic MPSs this construction yields a computational cost linear in $N$ and polynomial in $\ensuremath{\chi}$. We exploit this observation to revisit the study of ground-state nonstabilizerness in the quantum Ising chain, providing accurate numerical results up to large system sizes. We analyze the SRE near criticality and investigate its dependence on the local computational basis, showing that it is, in general, not maximal at the critical point.

arXiv:2207.13076•Physical review. B./Physical review. B•Jan 27, 2023•118 citations

Nonstabilizerness via Perfect Pauli Sampling of Matrix Product States

Guglielmo Lami, Mario Collura

We introduce a novel approach to evaluate the nonstabilizerness of an N-qubits matrix product state (MPS) with bond dimension χ. In particular, we consider the recently introduced stabilizer Rényi entropies (SREs). We show that the exponentially hard evaluation of the SREs can be achieved by means of a simple perfect sampling of the many-body wave function over the Pauli string configurations. The sampling is achieved with a novel MPS technique, which enables us to compute each sample in an efficient way with a computational cost O(Nχ^{3}). We benchmark our method over randomly generated magic states, as well as in the ground-state of the quantum Ising chain. Exploiting the extremely favorable scaling, we easily have access to the nonequilibrium dynamics of the SREs after a quantum quench.

arXiv:2303.05536•Physical Review Letters•Oct 31, 2023•93 citations

Unveiling the Stabilizer Group of a Matrix Product State

Guglielmo Lami, Mario Collura

We present a novel classical algorithm designed to learn the stabilizer group-namely, the group of Pauli strings for which a state is a ±1 eigenvector-of a given matrix product state (MPS). The algorithm is based on a clever and theoretically grounded biased sampling in the Pauli (or Bell) basis. Its output is a set of independent stabilizer generators whose total number is directly associated with the stabilizer nullity, notably a well-established nonstabilizer monotone. We benchmark our method on T-doped states randomly scrambled via Clifford unitary dynamics, demonstrating very accurate estimates up to highly entangled MPS with bond dimension χ∼10^{3}. Our method, thanks to a very favorable scaling O(χ^{3}), represents the first effective approach to obtain a genuine magic monotone for MPS, enabling systematic investigations of quantum many-body physics out of equilibrium.

Physical Review Letters•Jul 1, 2024•40 citations

Learning the stabilizer group of a Matrix Product State

Guglielmo Lami, Mario Collura

We present a novel classical algorithm designed to learn the stabilizer group -- namely the group of Pauli strings for which a state is a $\pm 1$ eigenvector -- of a given Matrix Product State (MPS). The algorithm is based on a clever and theoretically grounded biased sampling in the Pauli (or Bell) basis. Its output is a set of independent stabilizer generators whose total number is directly associated with the stabilizer nullity, notably a well-established nonstabilizer monotone. We benchmark our method on $T$-doped states randomly scrambled via Clifford unitary dynamics, demonstrating very accurate estimates up to highly-entangled MPS with bond dimension $χ\sim 10^3$. Our method, thanks to a very favourable scaling $\mathcal{O}(χ^3)$, represents the first effective approach to obtain a genuine magic monotone for MPS, enabling systematic investigations of quantum many-body physics out-of-equilibrium.

arXiv:2401.16481•Jan 29, 2024•1 citation

Nonstabilizerness versus entanglement in matrix product states

M. Frau, Poetri Sonya Tarabunga, Mario Collura +2 more

In this paper, we investigate the relationship between entanglement and nonstabilizerness (also known as magic) in matrix product states (MPSs). We study the relation between magic and the bond dimension used to approximate the ground state of a many-body system in two different contexts: full state of magic and mutual magic (the nonstabilizer analog of mutual information, thus free of boundary effects) of spin-1 anisotropic Heisenberg chains. Our results indicate that obtaining converged results for nonstabilizerness is typically considerably easier than entanglement. For full state magic at critical points and at sufficiently large volumes, we observe convergence with $1/{\ensuremath{\chi}}^{2}$, with $\ensuremath{\chi}$ being the MPS bond dimension. At small volumes, magic saturation is so quick that, within error bars, we cannot appreciate any finite-$\ensuremath{\chi}$ correction. Mutual magic also shows a fast convergence with bond dimension, whose specific functional form is however hindered by sampling errors. As a byproduct of our study, we show how Pauli-Markov chains (originally formulated to evaluate magic) resets the state of the art in terms of computing mutual information for MPS. We illustrate this last fact by verifying the logarithmic increase of mutual information between connected partitions at critical points. By comparing mutual information and mutual magic, we observe that, for connected partitions, the latter is typically scaling much slower---if at all---with the partition size, while for disconnected partitions, both are constant in size.

arXiv:2404.18768•Physical review. B./Physical review. B•Jul 1, 2024•54 citations

Real-Space Renormalization of Stabilizer Rényi Entropies in Spin Chains

Sonja Gombar, Petar Mali, Slobodan Radošević +3 more

Stabilizer states constitute an important class of quantum states that can be generated from computational-basis states using Pauli operators and Clifford gates. Although they may exhibit substantial multipartite entanglement, quantum circuits restricted to stabilizer operations can be efficiently simulated classically and therefore cannot, by themselves, provide a quantum computational advantage. Such an advantage requires non-stabilizer resources, commonly referred to as quantum magic. In this paper, we investigate the non-stabilizerness of quantum states arising in a class of spin Hamiltonians by computing their stabilizer Rényi entropies. Using real-space renormalization-group techniques, we obtain a closed-form expression valid in the low-energy, large-distance regime. We analyze how quantum magic evolves under coarse-graining and explore its behavior across different parameter regimes and quantum phases.

quant-pharXiv:2609.17188•Sep 16, 2026•0 citations
Nonstabilizerness, also known as "magic," stands as a crucial resource for achieving a potential advantage in quantum computing. Its connection to many-body physical phenomena is poorly understood at present, mostly due to a lack of practical methods to compute it at large scales. We present a novel approach for the evaluation of nonstabilizerness within the framework of matrix product states (MPSs), based on expressing the MPS directly in the Pauli basis. Our framework provides a powerful tool for efficiently calculating various measures of nonstabilizerness, including stabilizer Rényi entropies, stabilizer nullity, and Bell magic, and enables the learning of the stabilizer group of an MPS. We showcase the efficacy and versatility of our method in the ground states of Ising and XXZ spin chains, as well as in circuits dynamics that has recently been realized in Rydberg atom arrays, where we provide concrete benchmarks for future experiments on logical qubits up to twice the sizes already realized.
Nonstabilizerness, also known as magic, quantifies the number of non-Clifford operations needed to prepare a quantum state. As typical measures either involve minimization procedures or a computational cost exponential in the number of qubits NNN, it is notoriously hard to characterize for many-body states. In this paper, we show that nonstabilizerness, as quantified by the recently introduced stabilizer R\'enyi entropies (SREs), can be computed efficiently for matrix product states (MPSs). Specifically, given an MPS of bond dimension $\ensuremath{\chi}$ and integer R\'enyi index n>1n>1n>1, we show that the SRE can be expressed in terms of the norm of an MPS with bond dimension ${\ensuremath{\chi}}^{2n}$. For translation-invariant states, this allows us to extract it from a single tensor, the transfer matrix, while for generic MPSs this construction yields a computational cost linear in NNN and polynomial in $\ensuremath{\chi}$. We exploit this observation to revisit the study of ground-state nonstabilizerness in the quantum Ising chain, providing accurate numerical results up to large system sizes. We analyze the SRE near criticality and investigate its dependence on the local computational basis, showing that it is, in general, not maximal at the critical point.
We introduce a novel approach to evaluate the nonstabilizerness of an N-qubits matrix product state (MPS) with bond dimension χ. In particular, we consider the recently introduced stabilizer Rényi entropies (SREs). We show that the exponentially hard evaluation of the SREs can be achieved by means of a simple perfect sampling of the many-body wave function over the Pauli string configurations. The sampling is achieved with a novel MPS technique, which enables us to compute each sample in an efficient way with a computational cost O(Nχ^{3}). We benchmark our method over randomly generated magic states, as well as in the ground-state of the quantum Ising chain. Exploiting the extremely favorable scaling, we easily have access to the nonequilibrium dynamics of the SREs after a quantum quench.
We present a novel classical algorithm designed to learn the stabilizer group-namely, the group of Pauli strings for which a state is a ±1 eigenvector-of a given matrix product state (MPS). The algorithm is based on a clever and theoretically grounded biased sampling in the Pauli (or Bell) basis. Its output is a set of independent stabilizer generators whose total number is directly associated with the stabilizer nullity, notably a well-established nonstabilizer monotone. We benchmark our method on T-doped states randomly scrambled via Clifford unitary dynamics, demonstrating very accurate estimates up to highly entangled MPS with bond dimension χ∼10^{3}. Our method, thanks to a very favorable scaling O(χ^{3}), represents the first effective approach to obtain a genuine magic monotone for MPS, enabling systematic investigations of quantum many-body physics out of equilibrium.
We present a novel classical algorithm designed to learn the stabilizer group -- namely the group of Pauli strings for which a state is a ±1\pm 1±1 eigenvector -- of a given Matrix Product State (MPS). The algorithm is based on a clever and theoretically grounded biased sampling in the Pauli (or Bell) basis. Its output is a set of independent stabilizer generators whose total number is directly associated with the stabilizer nullity, notably a well-established nonstabilizer monotone. We benchmark our method on TTT-doped states randomly scrambled via Clifford unitary dynamics, demonstrating very accurate estimates up to highly-entangled MPS with bond dimension χ∼103χ\sim 10^3χ∼103. Our method, thanks to a very favourable scaling O(χ3)\mathcal{O}(χ^3)O(χ3), represents the first effective approach to obtain a genuine magic monotone for MPS, enabling systematic investigations of quantum many-body physics out-of-equilibrium.
In this paper, we investigate the relationship between entanglement and nonstabilizerness (also known as magic) in matrix product states (MPSs). We study the relation between magic and the bond dimension used to approximate the ground state of a many-body system in two different contexts: full state of magic and mutual magic (the nonstabilizer analog of mutual information, thus free of boundary effects) of spin-1 anisotropic Heisenberg chains. Our results indicate that obtaining converged results for nonstabilizerness is typically considerably easier than entanglement. For full state magic at critical points and at sufficiently large volumes, we observe convergence with $1/{\ensuremath{\chi}}^{2}$, with $\ensuremath{\chi}$ being the MPS bond dimension. At small volumes, magic saturation is so quick that, within error bars, we cannot appreciate any finite-$\ensuremath{\chi}$ correction. Mutual magic also shows a fast convergence with bond dimension, whose specific functional form is however hindered by sampling errors. As a byproduct of our study, we show how Pauli-Markov chains (originally formulated to evaluate magic) resets the state of the art in terms of computing mutual information for MPS. We illustrate this last fact by verifying the logarithmic increase of mutual information between connected partitions at critical points. By comparing mutual information and mutual magic, we observe that, for connected partitions, the latter is typically scaling much slower---if at all---with the partition size, while for disconnected partitions, both are constant in size.
Stabilizer states constitute an important class of quantum states that can be generated from computational-basis states using Pauli operators and Clifford gates. Although they may exhibit substantial multipartite entanglement, quantum circuits restricted to stabilizer operations can be efficiently simulated classically and therefore cannot, by themselves, provide a quantum computational advantage. Such an advantage requires non-stabilizer resources, commonly referred to as quantum magic. In this paper, we investigate the non-stabilizerness of quantum states arising in a class of spin Hamiltonians by computing their stabilizer Rényi entropies. Using real-space renormalization-group techniques, we obtain a closed-form expression valid in the low-energy, large-distance regime. We analyze how quantum magic evolves under coarse-graining and explore its behavior across different parameter regimes and quantum phases.