Quantum computation and complexity theory
arXiv:hep-th/9412047
Abstract
The Hilbert space formalism of quantum mechanics is reviewed with emphasis on applications to quantum computing. Standard interferomeric techniques are used to construct a physical device capable of universal quantum computation. Some consequences for recursion theory and complexity theory are discussed.
51 pages, PostScript