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

具有量子纠缠的Shor算法的实验验证

Experimental demonstration of Shor's algorithm with quantum entanglement

B. P. Lanyon, T. J. Weinhold, N. K. Langford, M. Barbieri, D. F. V. James*, A. Gilchrist, A. G. White

摘要:

Shor强大的量子因式分解算法代表了量子计算的一个重大挑战,它的完全实现将对现代密码学产生重大影响。在这里,我们实现了一个编译版本的肖尔的算法在光子系统中使用单光子和采用测量引起的非线性。我们第一次展示了Shor算法的全面实现所需的核心过程,相干控制和由此产生的纠缠态。这些过程的演示是迈向Shor算法和可扩展量子计算的全面实施的必要步骤。我们的研究结果强调,量子算法的性能是不一样的性能的底层量子线路,并强调开发技术的重要性,为量子算法的特点。

英文摘要:

Shor's powerful quantum algorithm for factoring represents a major challenge in quantum computation and its full realization will have a large impact on modern cryptography. Here we implement a compiled version of Shor's algorithm in a photonic system using single photons and employing the non-linearity induced by measurement. For the first time we demonstrate the core processes, coherent control, and resultant entangled states that are required in a full-scale implementation of Shor's algorithm. Demonstration of these processes is a necessary step on the path towards a full implementation of Shor's algorithm and scalable quantum computing. Our results highlight that the performance of a quantum algorithm is not the same as performance of the underlying quantum circuit, and stress the importance of developing techniques for characterising quantum algorithms.

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

↑