Qubit Complexity of Continuous Problems
COLUMBIA UNIV NEW YORK DEPT OF COMPUTER SCIENCE
Pagination or Media Count:
The number of qubits used by a quantum algorithm will be a crucial computational resource for the foreseeable future. The authors show how to obtain the classical query complexity for continuous problems. They then establish a simple formula for a lower bound on the qubit complexity in terms of the classical query complexity. Sections discuss classical information complexity, fundamental concepts and notation for quantum computation, and lower bound on qubit complexity.
- Information Science
- Numerical Mathematics
- Quantum Theory and Relativity