An Algorithm for Estimating $α$-Stabilizer Rényi Entropies via Purity

Abstract

Non-stabilizerness, or magic, is a resource for universal quantum computation in most fault-tolerant architectures; access to states with non-stabilizerness allows for non-classically simulable quantum computation to be performed. Quantifying this resource for unknown states is therefore essential to assessing their utility in quantum computation. The Stabilizer Rényi Entropies have emerged as a leading tool for achieving this, having already enabled one efficient algorithm for measuring non-stabilizerness. In addition, the Stabilizer Rényi Entropies have proven useful in developing connections between non-stabilizerness and other quantum phenomena. In this work, we introduce an alternative algorithm for measuring the Stabilizer Rényi Entropies of an unknown quantum state. Firstly, we show the existence of a state, produced from the action of a channel on $α$ copies of some \ben{state $ρ$}, that encodes the $α$-Stabilizer Rényi Entropy of $ρ$ into its purity. We detail several methods of applying this channel, and then, by employing existing purity-measuring algorithms, provide an algorithm for measuring the $α$-Stabilizer Rényi Entropies for all integers $α>1$. This algorithm is benchmarked for qubits and the resource requirements compared to other known algorithms. Finally, a non-stabilizerness/entanglement relationship is shown to exist in the algorithm, demonstrating a novel relationship between the two resources, before an instance of resource hiding is found.