Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

Composing insight from the full article — this may take a moment.

Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Typical Superpositions are Magical

arXiv1 min read

arXiv:2610.22476v1 Announce Type: new Abstract: The non-stabilizerness, or "magic", of a quantum state is a common metric for the hardness of simulation on a classical computer, and is often quantified by the stabilizer R\'enyi entropy (SRE). We show how random superpositions of classically simulable states saturate the SRE to the symmetry-restricted Haar-random maximum. For any large-$N$ random pure-state ensemble satisfying the conditions of Schur's lemma, the average SRE of the $m$-component superposition $\langle M_2(m)\rangle=N-\log_2[\langle W(m)\rangle]$ is governed by an average witness $\langle W(m)\rangle$ that universally decomposes into a Haar floor and an ensemble-specific excess. As the number of components $m$ increases, the excess is suppressed, resulting in a logarithmic scaling of the SRE before plateauing at the Haar-valued maximum. We derive a general closed form for $\langle W(m)\rangle$ in the thermodynamic limit, and numerically verify our result for random stabilizer states and random Gaussian states.

Read the full article at arXiv

Related coverage