arXivDaily arXiv每日学术速递 周一至周五更新
arXiv quant-ph/9806029quant-ph
收藏

混合态量子线路

Quantum Circuits with Mixed States

Dorit Aharonov, Alexei Kitaev, Noam Nisan

摘要:

我们用密度矩阵定义了量子线路的模型,其中允许非幺正门。在计算过程中的测量,噪声和消相干在这个模型中,这是一个自然的方式来实现,这是在计算能力相当于标准的量子线路。本文的主要结果是子程序问题的一个解决方案:量子线路输出的一般函数是一个概率函数,但用纯态语言,这样的函数不能作为黑箱用于其他计算。我们给出了一个自然的定义,使用一般的子程序,并分析其计算能力。我们提出了混合态量子计算的方便度量。对于密度矩阵,我们分析了所谓的"迹度量",并利用这个度量定义和讨论了超算子上的"钻石度量"。这些度量标准使得能够对计算中的错误进行正式讨论。利用密度矩阵的一个"容性"引理,我们还证明了概率函数的一个简单下界。

英文摘要:

We define the model of quantum circuits with density matrices, where non-unitary gates are allowed. Measurements in the middle of the computation, noise and decoherence are implemented in a natural way in this model, which is shown to be equivalent in computational power to standard quantum circuits. The main result in this paper is a solution for the subroutine problem: The general function that a quantum circuit outputs is a probabilistic function, but using pure state language, such a function can not be used as a black box in other computations. We give a natural definition of using general subroutines, and analyze their computational power. We suggest convenient metrics for quantum computing with mixed states. For density matrices we analyze the so called ``trace metric'', and using this metric, we define and discuss the ``diamond metric'' on superoperators. These metrics enable a formal discussion of errors in the computation. Using a ``causality'' lemma for density matrices, we also prove a simple lower bound for probabilistic functions.

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

↑