arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1902.10087quant-phmath-phmath.MP
收藏

直接量子关联的可恢复性

Recoverability from direct quantum correlations

S. Di Giorgio, P. Mateus, B. Mera

摘要:

我们解决的问题,压缩密度算子定义在有限维希尔伯特空间,假设张量积分解。特别是,我们寻找一个有效的程序学习最可能的密度算子,根据Jaynes的原则,给定一组选择的部分信息从未知的量子系统,我们希望描述。由于复杂性的原因,我们限制我们的分析树结构的二分边缘集。我们专注于三方的情况下,我们解决了问题的夫妇的测量边缘是兼容的量子马尔可夫链,然后提供一个代数的必要和充分条件的兼容性进行验证。我们介绍了推广的过程中的n-部的情况下,给出了一些初步的结果。特别是,我们证明,如果成对马尔可夫条件之间的子部分,然后选择的最佳树结构的二分边缘集可以有效地执行。此外,我们提供了一个新的刻画量子马尔可夫链的量子贝叶斯更新过程。

英文摘要:

We address the problem of compressing density operators defined on a finite dimensional Hilbert space which assumes a tensor product decomposition. In particular, we look for an efficient procedure for learning the most likely density operator, according to Jaynes' principle, given a chosen set of partial information obtained from the unknown quantum system we wish to describe. For complexity reasons, we restrict our analysis to tree-structured sets of bipartite marginals. We focus on the tripartite scenario, where we solve the problem for the couples of measured marginals which are compatible with a quantum Markov chain, providing then an algebraic necessary and sufficient condition for the compatibility to be verified. We introduce the generalization of the procedure to the n-partite scenario, giving some preliminary results. In particular, we prove that if the pairwise Markov condition holds between the subparts then the choice of the best set of tree-structured bipartite marginals can be performed efficiently. Moreover, we provide a new characterisation of quantum Markov chains in terms of quantum Bayesian updating processes.

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

↑