一位复杂性理论家对量子计算的看法
One Complexity Theorist's View of Quantum Computing
摘要：
量子计算的复杂性仍然知之甚少。虽然物理学家试图找到创造量子计算机的方法，但我们仍然没有太多证据表明这些机器将有多大用处。计算复杂性理论的工具应该对这些重要问题产生影响。量子计算经常吓跑许多潜在的研究人员从计算机科学，因为明显的背景需要在量子力学和陌生的外观符号中使用的论文的主题。本文将从复杂性理论家的角度对量子计算进行概述。我们将看到，人们可以将BQP视为另一个复杂性类，并在不关注其背后的物理方面的情况下研究其功能。
英文摘要：
The complexity of quantum computation remains poorly understood. While physicists attempt to find ways to create quantum computers, we still do not have much evidence one way or the other as to how useful these machines will be. The tools of computational complexity theory should come to bear on these important questions. Quantum computing often scares away many potential researchers from computer science because of the apparent background need in quantum mechanics and the alien looking notation used in papers on the topic. This paper will give an overview of quantum computation from the point of view of a complexity theorist. We will see that one can think of BQP as yet another complexity class and study its power without focusing on the physical aspects behind it.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
