Cloning is as Hard as Learning for Stabilizer States
2026-04-16 • Machine Learning
Machine Learning
AI summaryⓘ
The authors study the difficulty of copying (cloning) special quantum states called stabilizer states. They show that to make good copies, you need about as many original examples as to fully learn the state, meaning cloning is as hard as learning for these states. To prove this, they connect the problem to classical learning questions using advanced math tools. Their findings offer new insights into why you can't easily copy quantum information and link quantum theory with learning and cryptography.
quantum cloningstabilizer statessample complexityquantum learning theoryNo-Cloning theoremstate tomographyrepresentation theoryhidden subgroup problemsample amplificationquantum cryptography
Authors
Nikhil Bansal, Matthias C. Caro, Gaurav Mahajan
Abstract
The impossibility of simultaneously cloning non-orthogonal states lies at the foundations of quantum theory. Even when allowing for approximation errors, cloning an arbitrary unknown pure state requires as many initial copies as needed to fully learn the state. Rather than arbitrary unknown states, modern quantum learning theory often considers structured classes of states and exploits such structure to develop learning algorithms that outperform general-state tomography. This raises the question: How do the sample complexities of learning and cloning relate for such structured classes? We answer this question for an important class of states. Namely, for $n$-qubit stabilizer states, we show that the optimal sample complexity of cloning is $Θ(n)$. Thus, also for this structured class of states, cloning is as hard as learning. To prove these results, we use representation-theoretic tools in the recently proposed Abelian State Hidden Subgroup framework and a new structured version of the recently introduced random purification channel to relate stabilizer state cloning to a variant of the sample amplification problem for probability distributions that was recently introduced in classical learning theory. This allows us to obtain our cloning lower bounds by proving new sample amplification lower bounds for classes of distributions with an underlying linear structure. Our results provide a more fine-grained perspective on No-Cloning theorems, opening up connections from foundations to quantum learning theory and quantum cryptography.