arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1407.6604math.NAcs.NA
收藏

量子信息科学中的投射方法

Projection methods in quantum information science

University of Waterloo(滑铁卢大学);University of Washington(华盛顿大学);College of William and Mary(威廉玛丽学院)

Yuen-Lam Cheung, Dmitriy Drusvyatskiy, Chi-Kwong Li, Diane Pelejo, Henry Wolkowicz

AI总结:

本文研究了构造量子操作或通道的问题,旨在将给定的量子态集转换为另一组量子态。提出了一种基于投射的算法,用于解决半正定可行性问题,并通过实验验证了其有效性。

摘要:

我们考虑了构造量子操作或通道的问题,如果存在的话,将给定的量子态集合{ρ_1, …, ρ_k}转换为另一组量子态集合{ρ^1, …, ρ^k}。换句话说,必须找到一个完全正线性映射,如果存在的话,将给定的密度矩阵集映射到另一组给定的密度矩阵集。这个问题本身是半正定可行性问题的一个实例,但具有高度结构化的约束。约束的性质使得当变量数量巨大且标准的半正定规划内点法不适用时,基于投射的算法变得非常有吸引力。我们提供了实证证据支持这一点。我们还提出了寻找高阶和低阶解的启发式方法。我们的实验基于交替投射方法和Douglas-Rachford反射方法。

英文摘要:

We consider the problem of constructing quantum operations or channels, if they exist, that transform a given set of quantum states $\{ρ_1, \dots, ρ_k\}$ to another such set $\{\hatρ_1, \dots, \hatρ_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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑