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

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ényi 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.

References in corpus (19)

• Quantum Computing in the NISQ era and beyond
• A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
• Predicting Many Properties of a Quantum System from Very Few Measurements
• A Theory of Fault-Tolerant Quantum Computation
• Roads towards fault-tolerant universal quantum computation
• Application of a resource theory for magic states to fault-tolerant quantum computing
• Negative Quasi-Probability as a Resource for Quantum Computation
• Stabilizer Rényi entropy
• Provably efficient machine learning for quantum many-body problems
• Quantifying nonstabilizerness of matrix product states
• Measuring magic on a quantum processor
• Robustness of Magic and Symmetries of the Stabiliser Polytope
• Scalable measures of magic resource for quantum computers
• Many-body magic via Pauli-Markov chains -- from criticality to gauge theories
• Stabilizer entropies are monotones for magic-state resource theory
• Machine Learning for Practical Quantum Error Mitigation
• Quantifying non-stabilizerness via information scrambling
• Quantum Circuit Design using a Progressive Widening Enhanced Monte Carlo Tree Search
• Graph Neural Networks for Parameterized Quantum Circuits Expressibility Estimation