Cloning is as Hard as Learning for Stabilizer States

2026-04-16 · Source: Machine Learning · Field: Science & Research — Physical Sciences & Chemistry, Mathematics & Computational Sciences · Depth: Expert, quick

Summary

A new study demonstrates that for $n$-qubit stabilizer states, the optimal sample complexity for quantum cloning is $\Theta(n)$, indicating that cloning is as difficult as learning these states. This finding extends the fundamental quantum no-cloning theorem, which states that non-orthogonal quantum states cannot be perfectly cloned, even with approximation errors. The research utilizes representation-theoretic tools within the Abelian State Hidden Subgroup framework and a novel structured random purification channel. These methods connect stabilizer state cloning to a variant of the sample amplification problem from classical learning theory, enabling the derivation of new sample amplification lower bounds for distributions with underlying linear structure. This work offers a more detailed understanding of No-Cloning theorems, bridging quantum foundations with quantum learning theory and quantum cryptography.

Key takeaway

For quantum information theorists and cryptographers designing secure protocols, this research implies that even for structured quantum states like stabilizers, the fundamental difficulty of cloning remains high. You should account for $\Theta(n)$ sample complexity when evaluating the security of quantum communication or cryptographic schemes that rely on the impossibility of efficient state cloning, as this complexity directly impacts the resources required for potential attacks or state manipulation.

Key insights

Cloning $n$-qubit stabilizer states requires $\Theta(n)$ samples, making it as hard as learning them.

Principles

• No-Cloning theorem extends to structured quantum states.
• Learning and cloning complexity can be equivalent.

Method

The study uses representation theory, the Abelian State Hidden Subgroup framework, and a structured random purification channel to link quantum cloning to classical sample amplification problems.

In practice

• Informs quantum cryptography security.
• Guides quantum learning algorithm design.

Topics

• Stabilizer States
• Quantum Cloning
• Quantum Learning Theory
• Sample Complexity
• Abelian State Hidden Subgroup

Best for: AI Scientist, Research Scientist

Related on AIssential

• The Hidden Bottleneck in Quantum Machine Learning: Getting Data into a Quantum Computer — Efficiently loading classical data into quantum systems is a critical, unsolved bottleneck in Quantum Machine Learning.
• Unbreakable? Researchers warn quantum computers have serious security flaws — Quantum computers face unique hardware and software security vulnerabilities due to their fundamental operational differences from classical systems.
• Quantum Computing Explained for People Who Already Understand Software — Quantum computing's power lies in mathematically shaping probability distributions using superposition, entanglement, and interference for specific problem types.
• Graph Reinforcement Learning for Calibration-Aware Quantum Circuit Routing — Integrating real-time hardware calibration into quantum circuit routing via graph reinforcement learning significantly enhances circuit fidelity.
• Exponentially many initializations to avoid barren plateaus — A first-moment framework reveals exponentially many non-equivalent PQC initialization strategies can avoid barren plateaus.
• Sparsified Kolmogorov-Arnold Networks for Interpretable Quantum State Tomography — Sparsified KANs offer structural interpretability for quantum state tomography by revealing underlying physical structures.

Open in AIssential →

Editorial summary, takeaway, and curation by AIssential. Original article published by Machine Learning.