A Study on Stabilizer Rényi Entropy Estimation using Machine Learning

• URL: http://arxiv.org/abs/2509.16799v1
• Date: Sat, 20 Sep 2025 20:10:11 GMT
• Title: A Study on Stabilizer Rényi Entropy Estimation using Machine Learning
• Authors: Vincenzo Lipardi, Domenica Dibenedetto, Georgios Stamoulis, Mark H. M. Winands,
• Abstract summary: We propose a machine-learning approach to estimate the R'enyi entropy (SRE) for arbitrary quantum states.<n>In this work, we frame SRE estimation as a regression task and train a Random Forest Regressor and a Support Vector Regressor (SVR) on a comprehensive dataset.<n> Experimental results show that an SVR trained on circuit-level features achieves the best overall performance.
• Score: 0.25165775267615204
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Nonstabilizerness is a fundamental resource for quantum advantage, as it quantifies the extent to which a quantum state diverges from those states that can be efficiently simulated on a classical computer, the stabilizer states. The stabilizer R\'enyi entropy (SRE) is one of the most investigated measures of nonstabilizerness because of its computational properties and suitability for experimental measurements on quantum processors. Because computing the SRE for arbitrary quantum states is a computationally hard problem, we propose a supervised machine-learning approach to estimate it. In this work, we frame SRE estimation as a regression task and train a Random Forest Regressor and a Support Vector Regressor (SVR) on a comprehensive dataset, including both unstructured random quantum circuits and structured circuits derived from the physics-motivated one-dimensional transverse Ising model (TIM). We compare the machine-learning models using two different quantum circuit representations: one based on classical shadows and the other on circuit-level features. Furthermore, we assess the generalization capabilities of the models on out-of-distribution instances. Experimental results show that an SVR trained on circuit-level features achieves the best overall performance. On the random circuits dataset, our approach converges to accurate SRE estimations, but struggles to generalize out of distribution. In contrast, it generalizes well on the structured TIM dataset, even to deeper and larger circuits. In line with previous work, our experiments suggest that machine learning offers a viable path for efficient nonstabilizerness estimation.

Related papers

• Deterministic Ground State Preparation via Power-Cosine Filtering of Time Evolution Operators [0.0]
  We propose a non-variational protocol for ground state preparation using a Power-Cosine quantum signal processing filter.<n>By eschewing complex block-encoding techniques, our method directly utilizes coherent time-evolution operators controlled by a single ancillary qubit.
  arXiv  Detail & Related papers  (2026-02-23T07:01:30Z)
• Equivariant Evidential Deep Learning for Interatomic Potentials [55.6997213490859]
  Uncertainty quantification is critical for assessing the reliability of machine learning interatomic potentials in molecular dynamics simulations.<n>Existing UQ approaches for MLIPs are often limited by high computational cost or suboptimal performance.<n>We propose textitEquivariant Evidential Deep Learning for Interatomic Potentials ($texte2$IP), a backbone-agnostic framework that models atomic forces and their uncertainty jointly.
  arXiv  Detail & Related papers  (2026-02-11T02:00:25Z)
• AQER: a scalable and efficient data loader for digital quantum computers [62.40228216126285]
  We develop AQER, a scalable AQL method that constructs the loading circuit by systematically reducing entanglement in target states.<n>We conduct systematic experiments to evaluate the effectiveness of AQER, using synthetic datasets, classical image and language datasets, and a quantum many-body state datasets with up to 50 qubits.
  arXiv  Detail & Related papers  (2026-02-02T14:39:42Z)
• Trainability-Oriented Hybrid Quantum Regression via Geometric Preconditioning and Curriculum Optimization [0.6445605125467574]
  Quantum neural networks (QNNs) have attracted growing interest for scientific machine learning.<n>In regression settings they often suffer from limited trainability under noisy gradients and ill-conditioned optimization.<n>We propose a hybrid quantum-classical regression framework designed to mitigate these bottlenecks.
  arXiv  Detail & Related papers  (2026-01-17T07:32:18Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Nonstabilizerness Estimation using Graph Neural Networks [0.23749905164931204]
  This article proposes a Graph Neural Network (GNN) approach to estimate nonstabilizerness in quantum circuits, measured by the stabilizer Rényi entropy (SRE)<n>We address the nonstabilizerness estimation problem through three supervised learning formulations.<n> Experimental results show that the proposed GNN manages to capture meaningful features from the graph-based circuit representation.
  arXiv  Detail & Related papers  (2025-11-28T14:31:20Z)
• Cyclic Variational Quantum Eigensolver: Escaping Barren Plateaus through Staircase Descent [4.517663944296433]
  We introduce the Cyclic Variational Quantum Eigensolver (CVQE), a hardware-efficient framework for accurate ground-state quantum simulation.<n>CVQE departs from conventional VQE by incorporating a measurement-driven feedback cycle.<n>We show that CVQE consistently maintains chemical precision across correlation regimes, outperforms fixed UCCSD by several orders of magnitude, and achieves favorable accuracy-cost trade-offs.
  arXiv  Detail & Related papers  (2025-09-16T13:54:03Z)
• Quantum-Informed Machine Learning for Predicting Spatiotemporal Chaos [1.5216516276847551]
  We introduce a quantum-informed machine learning (QIML) framework for the long-term dynamical behavior of high-dimensional chaotic systems.<n>We evaluate QIML on three representative systems: the Kuramoto-Sivashinsky equation, the two-dimensional Kolmogorov flow, and a cross-section of fully developed three-dimensional turbulent channel flow.
  arXiv  Detail & Related papers  (2025-07-26T08:36:16Z)
• Estimating Non-Stabilizerness Dynamics Without Simulating It [43.80709028066351]
  Iterative Clifford Circuit Renormalization (I CCR) is designed to efficiently handle the dynamics of non-stabilizerness in quantum circuits.<n>I CCR embeds the complex dynamics of non-stabilizerness in the flow of an effective initial state.<n>We implement the I CCR algorithm to evaluate the non-stabilizerness dynamics for systems of size up to N = 1000.
  arXiv  Detail & Related papers  (2024-05-09T18:57:55Z)
• Unifying (Quantum) Statistical and Parametrized (Quantum) Algorithms [65.268245109828]
  We take inspiration from Kearns' SQ oracle and Valiant's weak evaluation oracle. We introduce an extensive yet intuitive framework that yields unconditional lower bounds for learning from evaluation queries.
  arXiv  Detail & Related papers  (2023-10-26T18:23:21Z)
• Machine learning in and out of equilibrium [58.88325379746631]
  Our study uses a Fokker-Planck approach, adapted from statistical physics, to explore these parallels. We focus in particular on the stationary state of the system in the long-time limit, which in conventional SGD is out of equilibrium. We propose a new variation of Langevin dynamics (SGLD) that harnesses without replacement minibatching.
  arXiv  Detail & Related papers  (2023-06-06T09:12:49Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• The vacuum provides quantum advantage to otherwise simulatable architectures [49.1574468325115]
  We consider a computational model composed of ideal Gottesman-Kitaev-Preskill stabilizer states. We provide an algorithm to calculate the probability density function of the measurement outcomes.
  arXiv  Detail & Related papers  (2022-05-19T18:03:17Z)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

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.