Computational approach to quantum encoder design for purity optimization
In this paper, we address the problem of designing a quantum encoder that maximizes the minimum output purity of a given decohering channel, where the minimum is taken over all possible pure inputs. This problem is cast as a max-min optimization problem with a rank constraint on an appropriately defined matrix variable. The problem is computationally very hard because it is nonconvex with respect to both the objective function (output purity) and the rank constraint. Despite this difficulty, we...[Show more]
|Collections||ANU Research Publications|
|Source:||Physical Review A: Atomic, Molecular and Optical Physics|
|01_Yamamoto_Computational_approach_to_2007.pdf||199.2 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.