Quantum computers can use a superposition to run many states simultaneously through an algorithm, rather than sequentially as in a classical computer. This principle is called quantum parallelism. This chapter refines our notion of quantum parallelism and introduces computational complexity to quantify the power of quantum computers.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Quantum Parallelism and Computational Complexity

  • Ray LaPierre

摘要

Quantum computers can use a superposition to run many states simultaneously through an algorithm, rather than sequentially as in a classical computer. This principle is called quantum parallelism. This chapter refines our notion of quantum parallelism and introduces computational complexity to quantify the power of quantum computers.