The detection of change points is a pivotal task in statistical analysis. In the quantum realm, it is a new primitive where one aims at identifying the point where a source that supposedly prepares a sequence of particles in identical quantum states starts preparing a mutated one. We obtain the optimal procedure to identify the change point with certainty-naturally at the price of having a certain probability of getting an inconclusive answer. We obtain the analytical form of the optimal probability of successful identification for any length of the particle sequence. We show that the conditional success probabilities of identifying each possible change point show an unexpected oscillatory behavior. We also discuss local (online) protocols and compare them with the optimal procedure.

}, issn = {0031-9007}, doi = {10.1103/PhysRevLett.119.140506}, author = {Sent{\'\i}s, Gael and John Calsamiglia and Mu{\~n}oz-Tapia, Ramon} } @article {de_vicente_estimation_2010, title = {Estimation of quantum finite mixtures}, journal = {Physical Review A}, volume = {81}, number = {1}, year = {2010}, month = {1/2010}, pages = {012332}, abstract = {We consider the problem of determining the weights of a quantum ensemble. That is to say, given a quantum system that is in a set of possible known states according to an unknown probability law, we give strategies to estimate the individual probabilities, weights, or mixing proportions. Such strategies can be used to estimate the frequencies at which different independent signals are emitted by a source. They can also be used to estimate the weights of particular terms in a canonical decomposition of a quantum channel. The quality of these strategies is quantified by a covariance-type error matrix. According with this cost function, we give optimal strategies in both the single-shot and multiple-copy scenarios. The latter is also analyzed in the asymptotic limit of large number of copies. We give closed expressions of the error matrix for two-component quantum mixtures of qubit systems. The Fisher information plays an unusual role in the problem at hand, providing exact expressions of the minimum covariance matrix for any number of copies.}, doi = {10.1103/PhysRevA.81.012332}, url = {http://link.aps.org/doi/10.1103/PhysRevA.81.012332}, author = {de Vicente, J. I. and John Calsamiglia and Mu{\~n}oz-Tapia, Ramon and Bagan, Emilio} } @article {Bagan2004a, title = {Entanglement-assisted alignment of reference frames using a dense covariant coding}, journal = {Physical Review A (Atomic, Molecular, and Optical Physics)}, volume = {69}, number = {5}, year = {2004}, month = {05/2004}, pages = {050303}, publisher = {American Physical Society}, abstract = {We present a procedure inspired by dense coding, which enables a highly efficient transmission of information of a continuous nature. The procedure requires the sender and the recipient to share a maximally entangled state. We deal with the concrete problem of aligning reference frames or trihedra by means of a quantum system. We find the optimal covariant measurement and compute the corresponding average error, which has a remarkably simple close form. The connection of this procedure with that of estimating unitary transformations on qubits is briefly discussed.}, issn = {1050-2947}, doi = {10.1103/PhysRevA.69.050303}, url = {http://link.aps.org/doi/10.1103/PhysRevA.69.050303}, author = {Bagan, Emili and Baig, Mari{\`a} and Mu{\~n}oz-Tapia, Ramon} }