We prove that, for an $n$-qubit system of dimension $d=2^n$, every state satisfying $\operatorname{Tr}(\rho^2)\le 1/(d-a_\ast)$, with $a_\ast=0.458327\cdots$, lies inside the stabilizer polytope and is therefore magic-free. Combining this result with general geometric properties of high-dimensional polytopes, we establish quantitative estimates for the Hilbert--Schmidt inradius and volume radius of the stabilizer polytope, and use them to characterize the typicality of magic in random induced states obtained by tracing out a $k$-dimensional subsystem from a $d\times k$-dimensional Haar-random pure state. We prove a sharp phase transition in the probability of such states having magic, whose transition dimension $k_\star$ is bounded between $\Omega(d^2/\log^2d)$ and $\mathcal{O}(d^2)$. We further prove that the number of facets of the stabilizer polytope lies between $\exp[\Omega(d^2/\log^2 d)]$ and $\exp[\mathcal{O}(d^2\log^2 d)]$ employing a result of Bourgain and Milman in convex geometry, substantially improving upon the previous quasipolynomial lower bound and implying that doubly-exponentially many linear inequalities in the number of qubits are required for an exact description of the magic-free region. Overall, our results reveal the near-extremal geometry of the stabilizer polytope and provide a quantitative foundation for understanding the typicality, robustness, and detectability of magic.
The main idea behind the algorithm is a local correlation criterion that identifies gates in the final layer without learning their entire backward light cones, avoiding a bottleneck in the previous approaches.
For a channel $\Phi$ on $M_d$ written in the generalised Bloch parameterisation $r \mapsto Ar+c$, we prove that entanglement breaking implies $\|A\|_*^2 + \frac{d(d-1)}{2}|c|^2 \le (d-1)^2$, where $\|\cdot\|_*$ denotes the nuclear norm. The bound is attained in every dimension by the completely dephasing channel, and a...
It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$,...
Rebecca Chang, Matthias C. Caro, Martín Larocca et al.· 6 citations
In this note, we consider tomography of $n$-qubit quantum states $|\psi \rangle$ that are promised to have stabilizer rank $k$ i.e., admit a stabilizer decomposition of $|\psi\rangle = \sum_{i=1}^k c_i |\phi_i\rangle$ where each $|\phi_i\rangle$ is a stabilizer state. We give a tomography protocol for such states up to...
We resolve the spectral-gap problem posed by Baer and Haah for random Pauli rotations. In this walk, a nonidentity $n$-qubit Pauli operator $P$ and an angle $\theta$ modulo $2\pi$ are chosen independently and uniformly, and the step is $e^{\mathrm{i}\theta P}$. Writing $d=2^n$, we prove that the gap on $\mathsf{SU}(d)$...
Let $A_1,\ldots,A_n$ be independent $d \times d$ real symmetric Gaussian random matrices, and consider the linear operator $A(x) = n^{-1/2}\sum_{i=1}^n x_i A_i$, $x\in \mathbb{R}^n$. We construct an iterative algorithm in the Approximate Message Passing family which iterates over $A$ and its adjoint $A^*$, and establis...
August Y. Chen, A. El Alaoui· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.