Projection methods in quantum information science

DOI10.1007/S11128-015-1024-YMaRDI QIDQ6253414arXivFDO

Authors D. Drusvyatskiy, Chi-Kwong Li, Diane Christine Pelejo, Yuen-Lam Voronin, Henry Wolkowicz

Publication date 24 July 2014

Published in arXiv

Full work available at URL https://doi.org/10.1007/S11128-015-1024-Y

Mathematics Subject Classification ID

Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Channel models (including quantum) in information and communication theory (94A40)

arXiv classification

math.NA

Abstract: We consider the problem of constructing quantum operations or channels, if they exist, that transform a given set of quantum states $h{o}_1,dots,h{o}_k$ to another such set $hath{o}_1,dots,hath{o}_k$. In other words, we must find a {em completely positive linear map}, if it exists, that maps a given set of density matrices to another given set of density matrices. This problem, in turn, is an instance of a positive semi-definite feasibility problem, but with highly structured constraints. The nature of the constraints makes projection based algorithms very appealing when the number of variables is huge and standard interior point-methods for semi-definite programming are not applicable. We provide emperical evidence to this effect. We moreover present heuristics for finding both high rank and low rank solutions. Our experiments are based on the emph{method of alternating projections} and the emph{Douglas-Rachford} reflection method.

This page was built for publication: Projection methods in quantum information science

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6253414)