Resolves optimal sample complexity for estimating quantum state moments Tr(ρᵗ) with adaptive single-copy measurements, revealing a dyadic hierarchy where orders 3 and 4 both require Θ(d²/³) copies despite differing nonadaptively.

Resolves optimal sample complexity for estimating quantum state moments Tr(ρᵗ) with adaptive single-copy measurements, revealing a dyadic hierarchy where orders 3 and 4 both require Θ(d²/³) copies despite differing nonadaptively.
2nd AIMS Workshop on the Theory of Quantum Learning Algorithms
📅 30 Nov – 3 Dec 2026
📍 AIMS, Muizenberg
🎓 Funding is available for up to 20 students & postdoctoral researchers at SA universities.
buff.ly/1W9yqvY
#QuantumLearning #QuantumComputing #LearningAlgorithms #AIMSSouthAfrica #QuantumResearch
Breakthrough quantum learning algorithm: efficiently learns low-bond-dimension quantum states from data without assuming the unknown state belongs to the model class, using compression and dynamic programming with polynomial complexity.
New quantum score matching framework extends classical learning technique to quantum states, achieving optimal sample complexity for high-temperature Gibbs states. NISQ-friendly implementation on IBM hardware reduces parameter error from 64% to 10%.