Quantum computation and complexity theory
classification
✦ hep-th
quant-ph
keywords
quantumtheorycomplexitycomputationapplicationscapablecomputingconsequences
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.