arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1210.6367quant-phcs.CC
收藏

局域测量下的量子de Finetti定理及其应用

Quantum de Finetti Theorems under Local Measurements with Applications

Fernando G. S. L. Brandao, Aram W. Harrow

摘要:

量子de Finetti定理是研究量子多体态关联的一个有用工具。在本文中,我们证明了两个新的量子de Finetti定理,都表明,在本地测量形成的测试下,可以得到一个大大改善的误差依赖于子系统的尺寸。我们也得到了类似的结果,非信令概率分布。我们给出了以下应用的结果:我们证明了最优性的Chen-Drucker协议3-SAT下,指数时间假设。我们证明了自由博弈的最大获胜概率可以用线性规划在多项式时间内估计。我们还表明,3-SAT与m个变量可以减少到获得一个恒定的误差近似的纠缠策略下的O(m^{1/2})-球员的一轮非局部游戏,其中的球员沟通O(m^{1/2})位在一起的最大获胜概率。我们表明,优化的某些多项式的超球可以在quasipolynomial时间的变量数n考虑O(log(n))轮的平方和(Parrilo/Lasserre)层次的半定程序。作为纠缠理论的一个应用,我们找到了一个判定多体可分性的准多项式时间算法。我们考虑由于Aaronson的结果-表明,给定一个未知的n量子比特状态,可以通过仅测量O(n)独立和同分布(i.i.d.)状态的副本--并将具有状态的i.i.d副本的假设放宽到仅仅是从量子多体状态中随机选择子系统的能力。新的量子de Finetti定理的证明是基于信息论,特别是基于互信息链规则。

英文摘要:

Quantum de Finetti theorems are a useful tool in the study of correlations in quantum multipartite states. In this paper we prove two new quantum de Finetti theorems, both showing that under tests formed by local measurements one can get a much improved error dependence on the dimension of the subsystems. We also obtain similar results for non-signaling probability distributions. We give the following applications of the results: We prove the optimality of the Chen-Drucker protocol for 3-SAT, under the exponential time hypothesis. We show that the maximum winning probability of free games can be estimated in polynomial time by linear programming. We also show that 3-SAT with m variables can be reduced to obtaining a constant error approximation of the maximum winning probability under entangled strategies of O(m^{1/2})-player one-round non-local games, in which the players communicate O(m^{1/2}) bits all together. We show that the optimization of certain polynomials over the hypersphere can be performed in quasipolynomial time in the number of variables n by considering O(log(n)) rounds of the Sum-of-Squares (Parrilo/Lasserre) hierarchy of semidefinite programs. As an application to entanglement theory, we find a quasipolynomial-time algorithm for deciding multipartite separability. We consider a result due to Aaronson -- showing that given an unknown n qubit state one can perform tomography that works well for most observables by measuring only O(n) independent and identically distributed (i.i.d.) copies of the state -- and relax the assumption of having i.i.d copies of the state to merely the ability to select subsystems at random from a quantum multipartite state. The proofs of the new quantum de Finetti theorems are based on information theory, in particular on the chain rule of mutual information.

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

↑