Qubit Complexity of Continuous Problems

Simple item page
dc.creatorPapageorgiou, A.
dc.creatorTraub, J. F.
dc.date2005-12-12
dc.date.accessioned2026-07-07T06:56:34Z
dc.date.available2026-07-07T06:56:34Z
dc.descriptionThe 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
dc.description6 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/quant-ph/0512082
dc.identifierhttp://arxiv.org/abs/quant-ph/0512082
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/106689
dc.subjectQuantum Physics
dc.titleQubit Complexity of Continuous Problems
dc.typetext

Files

Collections

arXiv