Quantum Universality, Computability, & Complexity

Abstract

In this chapter we surveyed issues of complexity, computability, and universality in the quantum and classical domains. Although there is no function a quantum computer can compute that a classical computer cannot also compute, given enough time and memory, there are computational tasks , such as generating true random numbers and teleporting information, that quantum computers can do but which classical ones cannot.