2005 Reports
Qubit Complexity of Continuous Problems
The number of qubits used by a quantum algorithm will be a crucial computational resource for the foreseeable future. We show how to obtain the classical query complexity for continuous problems. We then establish a simple formula for a lower bound on the qubit complexity in terms of the classical query complexity.
Subjects
Files
-
cucs-051-05.pdf application/pdf 177 KB Download File
More About This Work
- Academic Units
- Computer Science
- Publisher
- Department of Computer Science, Columbia University
- Series
- Columbia University Computer Science Technical Reports, CUCS-051-05
- Published Here
- April 21, 2011