For n-qubit stabilizer states the optimal sample complexity of approximate cloning is Θ(n), matching the complexity of learning.
Stabilizer bootstrapping: A recipe for efficient agnostic tomography and magic estimation
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
method 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Polynomial-time algorithms for the Polynomial Freiman-Ruzsa theorem and equivalent formulations over F_2^n, based on an optimized quadratic Goldreich-Levin procedure.
citing papers explorer
-
Cloning is as Hard as Learning for Stabilizer States
For n-qubit stabilizer states the optimal sample complexity of approximate cloning is Θ(n), matching the complexity of learning.
-
An algorithmic Polynomial Freiman-Ruzsa theorem
Polynomial-time algorithms for the Polynomial Freiman-Ruzsa theorem and equivalent formulations over F_2^n, based on an optimized quadratic Goldreich-Levin procedure.