Title:
Qubit Complexity of Continuous Problems
Author(s):
A. Papageorgiou, J. Traub
Paper #:
06-03-010
Date:
March 1, 2006
Abstract:
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.
Facebook
Twitter
Email Newsletter
SFI News Feed
Google+
YouTube
iTunes U