Partial Stabilizer Learning under Fixed Commuting Constraints and the Absence of a Copy-Rate Discount

Abstract:We consider an unknown pure stabilizer state of \(n\) qudits with a fixed prime local dimension \(p\), together with prescribed commuting Pauli observables. Rather than learning the whole state, the learner must recover only complementary stabilizers that commute with the prescribed observables, together with their eigenvalues. Once the prescribed measurement is performed, this information and the observed outcome determine the corresponding conditional stabilizer state. We compare the number \(k\) of copies available to the learner with the number \(n\) of qudits and refer to their ratio \(k/n\) as the copy rate. Suppose that the dimension \(m\) of the requested complementary stabilizer subspace satisfies \(m=\beta n+o(n)\) for a fixed \(0<\beta\leq1\). If the copy rate converges to a value below one, the optimal exact recovery probabilities and verification scores converge to zero, both in the worst case and under the uniform prior. Conversely, if the number \(k\) of copies minus the number \(n\) of qudits tends to positive infinity, the entire stabilizer state can be identified with probability tending to one, and the requested complementary information can then be extracted. Thus, restricting the learning target to the stabilizer information needed after the prescribed measurement yields no copy-rate discount.

arXiv:2609.13923 [quant-ph]

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

https://doi.org/10.48550/arXiv.2609.13923 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.