Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This research extends the stabilizer bootstrapping framework from qubits to qudit systems, delivering the first efficient quantum algorithm for agnostically learning high-dimensional stabilizer states under realistic noise conditions. By enabling precise estimation of state magic and fault-tolerant capabilities in higher dimensions, this work advances foundational tools essential for scalable quantum error correction.
Sources coveringarXiv, LessWrong
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Agnostic learning of qudit stabilizer states

arXiv3 min read

arXiv:2607.15559v1 Announce Type: new Abstract: Learning a classical description of a quantum state is a fundamental task in quantum computation. Among the most important classes of quantum states are stabilizer states, which play a central role in quantum error correction and fault-tolerant computation. To mitigate the effects of realistic noise, agnostic learning of stabilizer states has emerged as a natural and well-motivated problem. Recently, Chen \textit{et al.} [STOC'25, p. 429-438] resolved this problem for qubit systems by using a stabilizer bootstrapping framework. However, the agnostic learning of qudit stabilizer states remains largely unexplored, since the qudit setting introduces fundamental structural differences that prevent a direct generalization of existing qubit techniques. In this paper, we successfully generalize the stabilizer bootstrapping framework to qudit systems and present the first efficient quantum algorithm for agnostic learning of qudit stabilizer states. Specifically, given copies of an unknown $n$-qudit pure state $|\psi\rangle$ that has fidelity $\tau$ with some stabilizer state, our algorithm outputs a stabilizer state $|\phi\rangle$ such that $\left| \braket{\phi|\psi} \right|^2 \geq \tau - \varepsilon$ with high probability. The algorithm uses only single-copy and four-copy measurements, and its sample and time complexity scale as $(d/\tau)^{O(d^2 \log(1/\tau))} \cdot \mathrm{poly}(n, 1/\varepsilon)$, where the dimension $d$ is an odd prime. As a direct corollary, our algorithm enables efficient estimation of the magic of a quantum state, as quantified by its stabilizer fidelity. Completing the picture, we also present a streamlined algorithm for the high-fidelity regime $\tau > \cos^2(\pi/8)$, establishing a qudit analogue of the threshold-based approach in prior qubit work.

Abstract:Learning a classical description of a quantum state is a fundamental task in quantum computation. Among the most important classes of quantum states are stabilizer states, which play a central role in quantum error correction and fault-tolerant computation. To mitigate the effects of realistic noise, agnostic learning of stabilizer states has emerged as a natural and well-motivated problem. Recently, Chen \textit{et al.} [STOC'25, p. 429-438] resolved this problem for qubit systems by using a stabilizer bootstrapping framework. However, the agnostic learning of qudit stabilizer states remains largely unexplored, since the qudit setting introduces fundamental structural differences that prevent a direct generalization of existing qubit techniques. In this paper, we successfully generalize the stabilizer bootstrapping framework to qudit systems and present the first efficient quantum algorithm for agnostic learning of qudit stabilizer states. Specifically, given copies of an unknown $n$-qudit pure state $|\psi\rangle$ that has fidelity $\tau$ with some stabilizer state, our algorithm outputs a stabilizer state $|\phi\rangle$ such that $\left| \braket{\phi|\psi} \right|^2 \geq \tau - \varepsilon$ with high probability. The algorithm uses only single-copy and four-copy measurements, and its sample and time complexity scale as $(d/\tau)^{O(d^2 \log(1/\tau))} \cdot \mathrm{poly}(n, 1/\varepsilon)$, where the dimension $d$ is an odd prime. As a direct corollary, our algorithm enables efficient estimation of the magic of a quantum state, as quantified by its stabilizer fidelity. Completing the picture, we also present a streamlined algorithm for the high-fidelity regime $\tau > \cos^2(\pi/8)$, establishing a qudit analogue of the threshold-based approach in prior qubit work.

arXiv:2607.15559 [quant-ph]

(or arXiv:2607.15559v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2607.15559 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 339 words

Related coverage