Qubit Complexity of Continuous Problems
classification
🪐 quant-ph
keywords
complexityclassicalcontinuousproblemsqubitqueryalgorithmbound
read the original 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
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.