Qubit Complexity of Continuous Problems

@inproceedings{Papageorgiou2005QubitCO,
  title={Qubit Complexity of Continuous Problems},
  author={A. Papageorgiou and Joseph F. Traub},
  year={2005}
}
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.