Cloning is as Hard as Learning for Stabilizer States
Cloning is as Hard as Learning for Stabilizer States
Post Date
November 10, 2026
Centers
Topic
Schedule
Date
November 13, 2026, 430pm (Taipei time)
Speaker
Nikhil Bansal
Affiliation
University of Warwick
Reference
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 \Theta(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.
Personal information
Nikhil is a second year PhD student at the Department of Computer Science, University of Warwick supervised by Matthias C. Caro. His main research interests are in quantum learning theory, quantum cryptography with computational assumptions, and quantum resources. Previously he was an undergraduate in Physics at IISER Mohali on quantum pseudorandomness.
Reference