Conference paper
Distilling common randomness from bipartite quantum states
Igor Devetak, Andreas Winter
ISIT 2003
For a family of maps (equation presented) we analyze the speed of convergence (including constants) to the globally attracting neutral fixed point p = 0. The study is motivated by a problem in the optimization of routing. The aim of this paper is twofold: (1) to extend the usage of dynamical systems to unexplored areas of algorithms and (2) to provide a toolbox for a precise analysis of the iterates near a non-degenerate neutral fixed point. © 2009 Instytut Matematyczny PAN.
Igor Devetak, Andreas Winter
ISIT 2003
M.B. Small, R.M. Potemski
Proceedings of SPIE 1989
John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence
W.F. Cody, H.M. Gladney, et al.
SPIE Medical Imaging 1994