No-cloning theorem for quantum ensembles established information-theoretically, with circumvention for finite evolutions but proven computational intractability.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Empirical study finds neural-network learning difficulty (via Hessian eigenvalue and random subspace optimization) correlates with classical simulation hardness parameterized by MPS bond dimension and T-gate count.
citing papers explorer
-
No Cloning of Quantum Ensembles
No-cloning theorem for quantum ensembles established information-theoretically, with circumvention for finite evolutions but proven computational intractability.
-
Comparing Classical Simulation and Sample-Based Learning of Quantum Systems: Learning the Hardness of Quantum Systems from Samples
Empirical study finds neural-network learning difficulty (via Hessian eigenvalue and random subspace optimization) correlates with classical simulation hardness parameterized by MPS bond dimension and T-gate count.