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:2404.18751 · PRX Quantum

Quantum State Designs with Clifford-Enhanced Matrix Product States

Guglielmo Lami, Tobias Haug, Jacopo De Nardis

Published Mar 7, 2025• 50 citations
arXivHTMLPDF

Abstract

Nonstabilizerness, or “magic,” is a critical quantum resource that, together with entanglement, characterizes the nonclassical complexity of quantum states. Here, we address the problem of quantifying the average nonstabilizerness of random matrix product states (RMPSs). RMPSs represent a generalization of random product states featuring bounded entanglement that scales logarithmically with the bond dimension χ . We demonstrate that the stabilizer Rényi entropies converge to that of Haar-random states as N / χ α , where N is the system size and the α are integer exponents. This indicates that MPSs with a modest bond dimension are as magical as generic states. Subsequently, we introduce the ensemble of Clifford-enhanced matrix product states ( C MP Ss ), built by the action of Clifford unitaries on RMPSs. Leveraging our previous result, we show that C MP Ss can approximate quantum state 4-designs with arbitrary accuracy. Specifically, for a constant N , C MP Ss become close to 4-designs, with a scaling as χ − 2 . Our findings indicate that combining Clifford unitaries with polynomially complex tensor-network states can generate highly nontrivial quantum states.

DOI
10.1103/prxquantum.6.010345

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 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

Random Gaussian Augmented Matrix Product States

Stavya Puri, Poetri Sonya Tarabunga, Piotr Sierant

Strong entanglement limits the reach of tensor-network descriptions of quantum many-body systems. We study Gaussian-augmented matrix product states (GAMPS), formed by applying a free-fermionic (Gaussian) unitary to a matrix product state. To explore the capabilities of this family, we consider random GAMPS}, a minimally structured ensemble obtained by independently sampling random matrix product states and Gaussian unitaries. Exploiting the algebraic structure of Gaussian unitaries, we develop a replica tensor-network method that computes averages over the random GAMPS ensemble for hundreds of qubits. Random GAMPS exhibit nearly maximal volume-law entanglement already at modest bond dimension, while other quantum resource quantifiers rapidly approach Haar-random state values as the bond dimension increases. The entanglement scaling suggests an exponential reduction in the bond dimension needed to approach the volume-law entropy compared with unaugmented matrix product states. We find a state two-design behavior of random GAMPS at fixed accuracy with a bond dimension independent of system size. Our results reveal how Gaussian augmentation expands the expressive power of tensor networks.

quant-pharXiv:2609.25458•Sep 23, 2026•0 citations

Magic of random matrix product states

Liyuan Chen, Roy J. Garcia, Kaifeng Bu +1 more

Magic, or nonstabilizerness, characterizes how far away a state is from the stabilizer states, making it an important resource in quantum computing, under the formalism of the Gotteman-Knill theorem. In this paper, we study the magic of the one-dimensional (1D) random matrix product states (RMPSs) using the ${L}_{1}$-norm measure. We first relate the ${L}_{1}$ norm to the ${L}_{4}$ norm. We then employ a unitary four-design to map the ${L}_{4}$ norm to a 24-component statistical physics model. By evaluating partition functions of the model, we obtain a lower bound on the expectation values of the ${L}_{1}$ norm. This bound grows exponentially with respect to the qudit number $n$, indicating that the $1\mathrm{D}$ RMPS is highly magical. Our numerical results confirm that the magic grows exponentially in the qubit case.

arXiv:2211.10350•Physical review. B./Physical review. B•May 14, 2024•16 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

Probing quantum complexity via universal saturation of stabilizer entropies

Tobias Haug, Leandro Aolita, M. S. Kim

Nonstabilizerness or `magic' is a key resource for quantum computing and a necessary condition for quantum advantage. Non-Clifford operations turn stabilizer states into resourceful states, where the amount of nonstabilizerness is quantified by resource measures such as stabilizer Rényi entropies (SREs). Here, we show that SREs saturate their maximum value at a critical number of non-Clifford operations. Close to the critical point SREs show universal behavior. Remarkably, the derivative of the SRE crosses at the same point independent of the number of qubits and can be rescaled onto a single curve. We find that the critical point depends non-trivially on Rényi index α . For random Clifford circuits doped with T-gates, the critical T-gate density scales independently of α . In contrast, for random Hamiltonian evolution, the critical time scales linearly with qubit number for α > 1 , while it is a constant for α < 1 . This highlights that α -SREs reveal fundamentally different aspects of nonstabilizerness depending on α : α -SREs with α < 1 relate to Clifford simulation complexity, while α > 1 probe the distance to the closest stabilizer state and approximate state certification cost via Pauli measurements. As technical contributions, we observe that the Pauli spectrum of random evolution can be approximated by two highly concentrated peaks which allows us to compute its SRE. Further, we introduce a class of random evolution that can be expressed as random Clifford circuits and rotations, where we provide its exact SRE. Our results opens up new approaches to characterize the complexity of quantum systems.

arXiv:2406.04190•Quantum•Jul 21, 2025•32 citations
Nonstabilizerness, or “magic,” is a critical quantum resource that, together with entanglement, characterizes the nonclassical complexity of quantum states. Here, we address the problem of quantifying the average nonstabilizerness of random matrix product states (RMPSs). RMPSs represent a generalization of random product states featuring bounded entanglement that scales logarithmically with the bond dimension χ . We demonstrate that the stabilizer Rényi entropies converge to that of Haar-random states as N / χ α , where N is the system size and the α are integer exponents. This indicates that MPSs with a modest bond dimension are as magical as generic states. Subsequently, we introduce the ensemble of Clifford-enhanced matrix product states ( C MP Ss ), built by the action of Clifford unitaries on RMPSs. Leveraging our previous result, we show that C MP Ss can approximate quantum state 4-designs with arbitrary accuracy. Specifically, for a constant N , C MP Ss become close to 4-designs, with a scaling as χ − 2 . Our findings indicate that combining Clifford unitaries with polynomially complex tensor-network states can generate highly nontrivial quantum states.
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.
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.
Strong entanglement limits the reach of tensor-network descriptions of quantum many-body systems. We study Gaussian-augmented matrix product states (GAMPS), formed by applying a free-fermionic (Gaussian) unitary to a matrix product state. To explore the capabilities of this family, we consider random GAMPS}, a minimally structured ensemble obtained by independently sampling random matrix product states and Gaussian unitaries. Exploiting the algebraic structure of Gaussian unitaries, we develop a replica tensor-network method that computes averages over the random GAMPS ensemble for hundreds of qubits. Random GAMPS exhibit nearly maximal volume-law entanglement already at modest bond dimension, while other quantum resource quantifiers rapidly approach Haar-random state values as the bond dimension increases. The entanglement scaling suggests an exponential reduction in the bond dimension needed to approach the volume-law entropy compared with unaugmented matrix product states. We find a state two-design behavior of random GAMPS at fixed accuracy with a bond dimension independent of system size. Our results reveal how Gaussian augmentation expands the expressive power of tensor networks.
Magic, or nonstabilizerness, characterizes how far away a state is from the stabilizer states, making it an important resource in quantum computing, under the formalism of the Gotteman-Knill theorem. In this paper, we study the magic of the one-dimensional (1D) random matrix product states (RMPSs) using the L1{L}_{1}L1​-norm measure. We first relate the L1{L}_{1}L1​ norm to the L4{L}_{4}L4​ norm. We then employ a unitary four-design to map the L4{L}_{4}L4​ norm to a 24-component statistical physics model. By evaluating partition functions of the model, we obtain a lower bound on the expectation values of the L1{L}_{1}L1​ norm. This bound grows exponentially with respect to the qudit number nnn, indicating that the 1D1\mathrm{D}1D RMPS is highly magical. Our numerical results confirm that the magic grows exponentially in the qubit case.
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.
Nonstabilizerness or `magic' is a key resource for quantum computing and a necessary condition for quantum advantage. Non-Clifford operations turn stabilizer states into resourceful states, where the amount of nonstabilizerness is quantified by resource measures such as stabilizer Rényi entropies (SREs). Here, we show that SREs saturate their maximum value at a critical number of non-Clifford operations. Close to the critical point SREs show universal behavior. Remarkably, the derivative of the SRE crosses at the same point independent of the number of qubits and can be rescaled onto a single curve. We find that the critical point depends non-trivially on Rényi index α . For random Clifford circuits doped with T-gates, the critical T-gate density scales independently of α . In contrast, for random Hamiltonian evolution, the critical time scales linearly with qubit number for α > 1 , while it is a constant for α < 1 . This highlights that α -SREs reveal fundamentally different aspects of nonstabilizerness depending on α : α -SREs with α < 1 relate to Clifford simulation complexity, while α > 1 probe the distance to the closest stabilizer state and approximate state certification cost via Pauli measurements. As technical contributions, we observe that the Pauli spectrum of random evolution can be approximated by two highly concentrated peaks which allows us to compute its SRE. Further, we introduce a class of random evolution that can be expressed as random Clifford circuits and rotations, where we provide its exact SRE. Our results opens up new approaches to characterize the complexity of quantum systems.