One of the key issue in machine learning is the characterization of the learnability of a problem. The regret is way to quantify learnability. The quantum tomography is a special case of machine learning where the training set is a set of quantum measurements and the ground truth the results of these measurements, but nothing is known about the hidden quantum system. We will show that in some case the quantum tomography is a hard problem to learn. We consider a problem related to optical fiber communication where information are encoded in photon polarizations. We will show that the learning regret cannot decay faster than 1/T where T is the size of the training dataset, and that incremental gradient descents may converge worse. This is a correction of the paper [13] presented in International Workshop on Bayesian Inference and Maximum Entropy Methods in Science and Engineering (MAXENT’22), IHP, Paris, July 18-22, 2022.