Abstract

A fast Newton method is presented for solving the entropy maximization problem in the Bayesian statistical approach to phase estimation. The method requires only O(n log n) instead of standard O(n3) floating point operations per iteration, while converging in the same rate as the standard Newton method. The method is described and related computational issues are discussed. Numerical results on simple test cases are also presented to demonstrate the behavior of the method.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call