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

量子力学的罗塞塔石碑与量子计算导论

A Rosetta Stone for Quantum Mechanics with an Introduction to Quantum Computation

Samuel J. Lomonaco, jr

摘要:

这些课堂讲稿的目的是为那些有一些数学背景但很少或根本没有接触到量子力学和量子计算的读者提供足够的材料,以开始阅读量子计算和量子信息理论的研究文献。本文是2000年1月在美国华盛顿举行的美国数学学会(AMS)量子计算短期课程中八个一小时讲座的第一个书面版本,并将出现在AMS PSAPM卷中,题为“量子计算”。“论文的第一部分是量子比特概念的介绍。第二部分介绍了量子力学,包括狄拉克符号,量子测量,海森堡不确定性,薛定谔方程,密度算符,部分迹,多体量子系统,海森堡与薛定谔图像,量子纠缠,EPR悖论,量子熵等主题。第三部分简要介绍了量子计算,包括基本量子计算器件、布线图、不可克隆定理、量子隐形传态、Shor算法、Grover算法等。列举了许多实例。提供了目录和索引供读者挑选。“由于这篇论文是为不同的读者准备的,所以它是以非正式的风格写成的,从最初级到更高级,难度和复杂程度各不相同。

英文摘要:

The purpose of these lecture notes is to provide readers, who have some mathematical background but little or no exposure to quantum mechanics and quantum computation, with enough material to begin reading the research literature in quantum computation and quantum information theory. This paper is a written version of the first of eight one hour lectures given in the American Mathematical Society (AMS) Short Course on Quantum Computation held in conjunction with the Annual Meeting of the AMS in Washington, DC, USA in January 2000, and will appear in the AMS PSAPM volume entitled "Quantum Computation." Part 1 of the paper is an introduction the to the concept of the qubit. Part 2 gives an introduction to quantum mechanics covering such topics as Dirac notation, quantum measurement, Heisenberg uncertainty, Schrodinger's equation, density operators, partial trace, multipartite quantum systems, the Heisenberg versus the Schrodinger picture, quantum entanglement, EPR paradox, quantum entropy. Part 3 gives a brief introduction to quantum computation, covering such topics as elementary quantum computing devices, wiring diagrams, the no-cloning theorem, quantum teleportation, Shor's algorithm, Grover's algorithm. Many examples are given. A table of contents as well as an index are provided for readers who wish to "pick and choose." Since this paper is intended for a diverse audience, it is written in an informal style at varying levels of difficulty and sophistication from the very elementary to the more advanced.

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

↑