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

接受热量子比特输入的量子算法

Quantum algorithms which accept hot qubit inputs

Xinlan Zhou, Debbie W. Leung, Isaac L. Chuang

摘要:

量子计算机的现实物理实现可能需要权衡,这偏离了量子计算的理想模型。尽管这些权衡允许某些量子算法的成功演示,但一个关键问题是它们是否从根本上限制了这些机器的计算能力。我们研究了量子计算模型的局限性,在该模型中,只有测量可观测量的系综平均值是可访问的。此外,我们规定输入量子比特只能在高度随机的“热”混合态中制备。一般来说,这些限制被认为会大大降低系统的计算能力。然而,我们构造了一类算法,这个有限的模型,令人惊讶的是,多项式等价于理想的情况下。这个类包括著名的Deutsch-Jozsa算法。

英文摘要:

Realistic physical implementations of quantum computers can entail tradeoffs which depart from the ideal model of quantum computation. Although these tradeoffs have allowed successful demonstration of certain quantum algorithms, a crucial question is whether they fundamentally limit the computational capacity of such machines. We study the limitations of a quantum computation model in which only ensemble averages of measurement observables are accessible. Furthermore, we stipulate that input qubits may only be prepared in highly random, ``hot'' mixed states. In general, these limitations are believed to dramatically detract from the computational power of the system. However, we construct a class of algorithms for this limited model, which, surprisingly, are polynomially equivalent to the ideal case. This class includes the well known Deutsch-Jozsa algorithm.

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

↑