Qubit Complexity of Continuous Problems
Quantum Physics
2007-05-23 v1
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
Cite
@article{arxiv.quant-ph/0512082,
title = {Qubit Complexity of Continuous Problems},
author = {A. Papageorgiou and J. F. Traub},
journal= {arXiv preprint arXiv:quant-ph/0512082},
year = {2007}
}
Comments
6 pages, 2 figures