arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2101.04971cs.LO
收藏

量子马尔可夫链上基于保真度的模型检测的代数方法

An Algebraic Method to Fidelity-based Model Checking over Quantum Markov Chains

Ming Xu, Jianling Fu, Jingyi Mei, Yuxin Deng

AI总结:

本文提出QCTL逻辑在量子马尔可夫链上进行基于保真度的模型检测,通过归约到实数存在理论的量词消去实现精确计算,证明QCTL公式指数时间可判定,并以量子IPv4协议验证有效性。

摘要:

保真度是量子信息中最广泛使用的量之一,通过有噪信道测量量子态的距离。本文引入了计算树逻辑(CTL)的量子类比,称为QCTL,它在量子马尔可夫链(QMCs)上关注保真度而非概率CTL中的概率。有噪信道由超算子建模,并由QCTL公式指定;初始量子态由密度算子建模,在给定QMC中保持参数化。问题在于计算所有初始态的最小保真度以实现守恒。我们通过将其归约到实数存在理论中的量词消去来实现这一点。该方法绝对精确,从而证明QCTL公式在指数时间内可判定。最后,我们实现了所提方法,并通过量子IPv4协议展示了其有效性。

英文摘要:

Fidelity is one of the most widely used quantities in quantum information that measure the distance of quantum states through a noisy channel. In this paper, we introduce a quantum analogy of computation tree logic (CTL) called QCTL, which concerns fidelity instead of probability in probabilistic CTL, over quantum Markov chains (QMCs). Noisy channels are modelled by super-operators, which are specified by QCTL formulas; the initial quantum states are modelled by density operators, which are left parametric in the given QMC. The problem is to compute the minimumfidelity over all initial states for conservation. We achieve it by a reduction to quantifier elimination in the existential theory of the reals. The method is absolutely exact, so that QCTL formulas are proven to be decidable in exponential time. Finally, we implement the proposed method and demonstrate its effectiveness via a quantum IPv4 protocol.

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

↑