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

NMR量子计算机奇偶性问题的多项式时间解

A polynomial-time solution to the parity problem on an NMR quantum computer

Xijia Miao

摘要:

提出了一种有效的量子算法,在多项式时间内解决奇偶性问题,无论是在传统的量子计算和经典计算,NMR量子计算机上的最困难的问题之一。它基于量子系综中的量子平行性原理、选择性退相干操作和NMR相敏测量。量子算法的量子线路是明确设计的。

英文摘要:

An efficient quantum algorithm is proposed to solve in polynomial time the parity problem, one of the hardest problems both in conventional quantum computation and in classical computation, on NMR quantum computers. It is based on the quantum parallelism principle in a quantum ensemble, the selective decoherence manipulation, and the NMR phase-sensitive measurement. The quantum circuit for the quantum algorithm is designed explicitly.

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

↑