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:2204.02995 · Physical Review A

Nonstabilizerness determining the hardness of direct fidelity estimation

Lorenzo Leone, Salvatore F. E. Oliviero, Alioscia Hamma

Published Feb 23, 2023• 70 citations
arXivHTMLPDF

Abstract

In this work, we show how the resource theory of nonstabilizerness quantifies the hardness of direct fidelity estimation protocols. In particular, the resources needed for a direct fidelity estimation conducted on generic states, such as Pauli fidelity estimation and shadow fidelity estimation protocols, grow exponentially with the stabilizer R\'enyi entropy. Remarkably, these protocols are shown to be feasible only for those states that are useless to attain any quantum speedup or advantage. This result suggests the impossibility of estimating efficiently fidelity for generic states and, at the same time, leaves the window open to those protocols specialized at directly estimating the fidelity of particular states. We then extend our results to quantum evolutions, showing that the resources needed to certify the quality of the implementation of a given unitary $U$ are governed by the nonstabilizerness in the Choi state associated with $U$, which is shown to possess a profound connection with out-of-time order correlators.

DOI
10.1103/physreva.107.022429

Related papers

Stabilizer Rényi Entropy

Lorenzo Leone, Salvatore F. E. Oliviero, Alioscia Hamma

We introduce a novel measure for the quantum property of "nonstabilizerness"-commonly known as "magic"-by considering the Rényi entropy of the probability distribution associated to a pure quantum state given by the square of the expectation value of Pauli strings in that state. We show that this is a good measure of nonstabilizerness from the point of view of resource theory and show bounds with other known measures. The stabilizer Rényi entropy has the advantage of being easily computable because it does not need a minimization procedure. We present a protocol for an experimental measurement by randomized measurements. We show that the nonstabilizerness is intimately connected to out-of-time-order correlation functions and that maximal levels of nonstabilizerness are necessary for quantum chaos.

arXiv:2106.12587•Physical Review Letters•Feb 4, 2022•396 citations

Quantum fidelity estimation in the resource theory of nonstabilizerness

Zhiping Liu, Kun Wang, Xin Wang

Quantum fidelity estimation is essential for benchmarking quantum states and processes on noisy quantum devices. While stabilizer operations form the foundation of fault-tolerant quantum computing, nonstabilizer resources further enable universal quantum computation through state injection. In this work, we propose several efficient quantum fidelity estimation protocols for both quantum states and channels within the resource theory of nonstabilizerness, focusing on qudit systems with odd prime dimensions. Our fidelity estimation algorithms require measuring only a constant number of phase-space point operator expectation values, with operators selected randomly according to an importance weighting scheme tailored to the target state. Notably, we demonstrate that mathematically defined nonstabilizerness measures---such as Wigner rank and mana---quantify the sample complexity of the proposed protocols, thereby endowing them with a clear operational interpretation in the fidelity estimation task. This connection reveals a fundamental trade-off: while fidelity estimation for general quantum states and channels requires resources that scale exponentially with their nonstabilizerness, the task remains tractable for states and channels that admit efficient classical simulation.

arXiv:2506.12938•Physical Review A•Aug 26, 2025•0 citations

Pauli instability in arbitrary states: detecting magic in physical correlators

Tanner Jackson, Alexey Milekhin

Measures of non-stabilizerness (``magic'') of a quantum evolution quantify how hard it is to simulate on a classical computer. A natural question is how to extract information about magic from physical correlators, for example at finite temperature or in the ground state. In this paper we show how to measure magic using out-of-time-order correlators evaluated in an arbitrary state. For every full-rank state, and in particular for every Gibbs state, the resulting quantity vanishes if and only if the evolution is Clifford. We establish its basic properties, relate it to the stabilizer entropy of the Choi state, and prove that, even with a single fixed probe operator, it gives a lower bound on the number of $T$ gates needed to implement the dynamics in any circuit architecture.

quant-pharXiv:2609.40032•Oct 1, 2026•1 citation

Bounding Fidelity of Non-Stabilizer States from Local Pauli Measurements

Yi Li, Otfried Gühne, Qiongyi He

Nonstabilizerness, commonly referred to as magic, is essential for universal quantum computation. Yet, for pure $n$-qubit states this property is directly linked to the hardness of direct fidelity estimation. We propose a scheme to bound the fidelity on non-stabilizer states by choosing operators with low measurement overhead and using parallel local Pauli measurements to estimate compatible observables. We selectively measure operators that share a permutational symmetry without imposing any assumption on the physical system. This selection reduces the optimization to a linear program with only $O(n)$ variables for bounding fidelity. Our methods can be extended to bound nonlinear quantities like the purity via convex quadratic programs. For hypergraph states that can exhibit extensive nonstabilizerness, we demonstrate for up to $n=500$ qubits that our framework substantially reduces the measurement overhead under both local and global depolarizing noise. These results show that symmetry induced by measurement selection reduces both measurement and computational costs, enabling scalable characterization of magic resources in quantum computing and quantum networks.

quant-pharXiv:2610.41808•Nov 2, 2026•0 citations

Fidelity Estimation of Entangled Measurements with Local States

Zanqiu Shen, Kun Wang

We propose an efficient protocol to estimate the fidelity of an $n$-qubit entangled measurement device, requiring only qubit state preparations and classical data post-processing. It works by measuring the eigenstates of Pauli operators, which are strategically selected according to their importance weights and collectively contributed by all measurement operators. We rigorously analyze the protocol's performance and demonstrate that its sample complexity is uniquely determined by the number of Pauli operators possessing non-zero expectation values with respect to the target measurement. Moreover, from a resource-theoretic perspective, we introduce the stabilizer Rényi entropy of quantum measurements as a precise metric to quantify the inherent difficulty of estimating measurement fidelity.

arXiv:2312.13730•Dec 21, 2023•0 citations

Quantifying non-stabilizerness via information scrambling

Arash Ahmadi, Eliška Greplová

The advent of quantum technologies brought forward much attention to the theoretical characterization of the computational resources they provide. A method to quantify quantum resources is to use a class of functions called magic monotones and stabilizer entropies, which are, however, notoriously hard and impractical to evaluate for large system sizes. In recent studies, a fundamental connection between information scrambling, the magic monotone mana and 2-Renyi stabilizer entropy was established. This connection simplified magic monotone calculation, but this class of methods still suffers from exponential scaling with respect to the number of qubits. In this work, we establish a way to sample an out-of-time-order correlator that approximates magic monotones and 2-Renyi stabilizer entropy. We numerically show the relation of these sampled correlators to different non-stabilizerness measures for both qubit and qutrit systems and provide an analytical relation to 2-Renyi stabilizer entropy. Furthermore, we put forward and simulate a protocol to measure the monotonic behaviour of magic for the time evolution of local Hamiltonians.

arXiv:2204.11236•SciPost Physics•Feb 8, 2024•34 citations
In this work, we show how the resource theory of nonstabilizerness quantifies the hardness of direct fidelity estimation protocols. In particular, the resources needed for a direct fidelity estimation conducted on generic states, such as Pauli fidelity estimation and shadow fidelity estimation protocols, grow exponentially with the stabilizer R'enyi entropy. Remarkably, these protocols are shown to be feasible only for those states that are useless to attain any quantum speedup or advantage. This result suggests the impossibility of estimating efficiently fidelity for generic states and, at the same time, leaves the window open to those protocols specialized at directly estimating the fidelity of particular states. We then extend our results to quantum evolutions, showing that the resources needed to certify the quality of the implementation of a given unitary UUU are governed by the nonstabilizerness in the Choi state associated with UUU, which is shown to possess a profound connection with out-of-time order correlators.
We introduce a novel measure for the quantum property of "nonstabilizerness"-commonly known as "magic"-by considering the Rényi entropy of the probability distribution associated to a pure quantum state given by the square of the expectation value of Pauli strings in that state. We show that this is a good measure of nonstabilizerness from the point of view of resource theory and show bounds with other known measures. The stabilizer Rényi entropy has the advantage of being easily computable because it does not need a minimization procedure. We present a protocol for an experimental measurement by randomized measurements. We show that the nonstabilizerness is intimately connected to out-of-time-order correlation functions and that maximal levels of nonstabilizerness are necessary for quantum chaos.
Quantum fidelity estimation is essential for benchmarking quantum states and processes on noisy quantum devices. While stabilizer operations form the foundation of fault-tolerant quantum computing, nonstabilizer resources further enable universal quantum computation through state injection. In this work, we propose several efficient quantum fidelity estimation protocols for both quantum states and channels within the resource theory of nonstabilizerness, focusing on qudit systems with odd prime dimensions. Our fidelity estimation algorithms require measuring only a constant number of phase-space point operator expectation values, with operators selected randomly according to an importance weighting scheme tailored to the target state. Notably, we demonstrate that mathematically defined nonstabilizerness measures---such as Wigner rank and mana---quantify the sample complexity of the proposed protocols, thereby endowing them with a clear operational interpretation in the fidelity estimation task. This connection reveals a fundamental trade-off: while fidelity estimation for general quantum states and channels requires resources that scale exponentially with their nonstabilizerness, the task remains tractable for states and channels that admit efficient classical simulation.
Measures of non-stabilizerness (``magic'') of a quantum evolution quantify how hard it is to simulate on a classical computer. A natural question is how to extract information about magic from physical correlators, for example at finite temperature or in the ground state. In this paper we show how to measure magic using out-of-time-order correlators evaluated in an arbitrary state. For every full-rank state, and in particular for every Gibbs state, the resulting quantity vanishes if and only if the evolution is Clifford. We establish its basic properties, relate it to the stabilizer entropy of the Choi state, and prove that, even with a single fixed probe operator, it gives a lower bound on the number of TTT gates needed to implement the dynamics in any circuit architecture.
Nonstabilizerness, commonly referred to as magic, is essential for universal quantum computation. Yet, for pure nnn-qubit states this property is directly linked to the hardness of direct fidelity estimation. We propose a scheme to bound the fidelity on non-stabilizer states by choosing operators with low measurement overhead and using parallel local Pauli measurements to estimate compatible observables. We selectively measure operators that share a permutational symmetry without imposing any assumption on the physical system. This selection reduces the optimization to a linear program with only O(n)O(n)O(n) variables for bounding fidelity. Our methods can be extended to bound nonlinear quantities like the purity via convex quadratic programs. For hypergraph states that can exhibit extensive nonstabilizerness, we demonstrate for up to n=500n=500n=500 qubits that our framework substantially reduces the measurement overhead under both local and global depolarizing noise. These results show that symmetry induced by measurement selection reduces both measurement and computational costs, enabling scalable characterization of magic resources in quantum computing and quantum networks.
We propose an efficient protocol to estimate the fidelity of an nnn-qubit entangled measurement device, requiring only qubit state preparations and classical data post-processing. It works by measuring the eigenstates of Pauli operators, which are strategically selected according to their importance weights and collectively contributed by all measurement operators. We rigorously analyze the protocol's performance and demonstrate that its sample complexity is uniquely determined by the number of Pauli operators possessing non-zero expectation values with respect to the target measurement. Moreover, from a resource-theoretic perspective, we introduce the stabilizer Rényi entropy of quantum measurements as a precise metric to quantify the inherent difficulty of estimating measurement fidelity.
The advent of quantum technologies brought forward much attention to the theoretical characterization of the computational resources they provide. A method to quantify quantum resources is to use a class of functions called magic monotones and stabilizer entropies, which are, however, notoriously hard and impractical to evaluate for large system sizes. In recent studies, a fundamental connection between information scrambling, the magic monotone mana and 2-Renyi stabilizer entropy was established. This connection simplified magic monotone calculation, but this class of methods still suffers from exponential scaling with respect to the number of qubits. In this work, we establish a way to sample an out-of-time-order correlator that approximates magic monotones and 2-Renyi stabilizer entropy. We numerically show the relation of these sampled correlators to different non-stabilizerness measures for both qubit and qutrit systems and provide an analytical relation to 2-Renyi stabilizer entropy. Furthermore, we put forward and simulate a protocol to measure the monotonic behaviour of magic for the time evolution of local Hamiltonians.