arXiv subjects

Caleb J O'Loan

Publications and source records attributed to Caleb J O'Loan.

3 recordsLinked to original sources

arXiv2010

Iterative phase estimation

We give an iterative algorithm for phase estimation of a parameter theta, which is within a logarithmic factor of the Heisenberg limit. Unlike other methods, we do not need any entanglement or an extra rotation gate which can perform arbitrary rotations with almost perfect accuracy: only a single copy of the unitary channel and basic measurements are needed. Simulations show that the algorithm is successful. We also look at iterative phase estimation when depolarizing noise is present. It is seen that the algorithm is still successful provided the number of iterative stages is below a certain threshold.

quant-ph↗

arXiv2008

Analysis of SM quantum information

Morozova and Chentsov (Morozova and Chentsov 90) studied Riemannian metrics on the set of probability measures. They showed that, up to a constant factor, the Fisher information is the only Riemannian metric which is monotone under stochastic transformation. Sarovar and Milburn (Sarovar and Milburn 06) computed an upper bound on the Fisher information for one-parameter channels. In (O'Loan 07) we extended their bound to an upper bound on the Fisher information of multi-parameter families of states; we call this the SM quantum information. Petz and Sudár (Petz 95) characterized fully the set of monotone metrics on the space of all density matrices. We analyse the SM quantum information in light of their work. We show that the SM quantum information is not a well-defined metric on the space of density matrices: different choices of phase of the eigenvectors lead to different metrics. We define a new metric C_L as a lower bound among the SM quantum informations. We look at properties of C_L and show that it is invariant but not monotone.

quant-ph↗

arXiv2008

Estimation of n non-identical unitary channels

We investigate the simultaneous estimation of $n$ not necessarily identical unitary channels using multi-partite entanglement. We examine whether it is possible for the rate at which the mean square error decreases to be greater than that using the channels individually. For a reasonably general situation, in which there is no functional dependence between the channels, we show that this is not possible. We look at a case in which the channels are not necessarily identical but depend on a common variable. In this case, the mean square error decreases more rapidly using multi-partite entanglement.

quant-ph↗