aiqbench analysis
This study introduces an efficient perfect-sampling algorithm to compute magic Rényi entropy in large-scale fermionic systems, overcoming the exponential scaling that previously limited non-Gaussianity analysis to small models. By leveraging matrix product states and bounded estimators, the method successfully characterizes higher-order correlations in 128-site XXZ chains, providing a vital tool for assessing resources required for universal quantum computation.
Efficient Sampling for Many-Body Fermionic Non-Gaussianity
arXiv:2610.03492v1 Announce Type: new Abstract: Fermionic non-Gaussianity is a key resource for universal quantum computation, and its behavior in quantum many-body systems has attracted growing interest. Recently, a convolution-based measure, which we call the magic R\'enyi entropy (MRE), has been proposed as a resource measure of non-Gaussianity, but its evaluation is limited to small systems due to the computational cost growing exponentially with system size. In this work, we develop a perfect-sampling method to calculate the second-order MRE from matrix product states (MPSs). Our method uses a bounded estimator to control sampling fluctuations and a recursive sweep to draw the samples directly from the input MPS, which allows us to generate each sample with $\mathcal O(nD^3)$ time, where $n$ and $D$ denote the number of modes and MPS bond dimension, respectively. We benchmark our method on the XXZ chain with up to $128$ sites, demonstrating that the MRE captures intricate higher-order correlations at large scales, which are inaccessible to covariance-based measures. These results provide a computational tool that quantitatively evaluates many-body fermionic non-Gaussianity by accounting for higher-order correlations.
Abstract:Fermionic non-Gaussianity is a key resource for universal quantum computation, and its behavior in quantum many-body systems has attracted growing interest. Recently, a convolution-based measure, which we call the magic Rényi entropy (MRE), has been proposed as a resource measure of non-Gaussianity, but its evaluation is limited to small systems due to the computational cost growing exponentially with system size. In this work, we develop a perfect-sampling method to calculate the second-order MRE from matrix product states (MPSs). Our method uses a bounded estimator to control sampling fluctuations and a recursive sweep to draw the samples directly from the input MPS, which allows us to generate each sample with $\mathcal O(nD^3)$ time, where $n$ and $D$ denote the number of modes and MPS bond dimension, respectively. We benchmark our method on the XXZ chain with up to $128$ sites, demonstrating that the MRE captures intricate higher-order correlations at large scales, which are inaccessible to covariance-based measures. These results provide a computational tool that quantitatively evaluates many-body fermionic non-Gaussianity by accounting for higher-order correlations.
Quantum Physics (quant-ph); Statistical Mechanics (cond-mat.stat-mech); Strongly Correlated Electrons (cond-mat.str-el)
arXiv:2610.03492 [quant-ph]
(or arXiv:2610.03492v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2610.03492 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 274 words
Related coverage
Testing quantum Gaussianity with constant sample complexity
arXiv · Oct 1, 2026
Provably Efficient Learning of Fermionic Correlations under Particle-Number Symmetry
arXiv · Oct 1, 2026

Non-stabilizerness and violations of CHSH inequalities
Quantum Journal · Sep 21, 2026

Researchers Compute Key Quantum Correlations with Polynomial Time Algorithm
Quantum Zeitgeist · Aug 24, 2026