Almost Optimal Solution of Initial-Value Problems by Randomized and Quantum Algorithms

Simple item page
dc.creatorKacewicz, Boleslaw
dc.date2005-10-06
dc.date2006-10-09
dc.date.accessioned2026-07-07T06:48:40Z
dc.date.available2026-07-07T06:48:40Z
dc.descriptionWe establish essentially optimal bounds on the complexity of initial-value problems in the randomized and quantum settings. For this purpose we define a sequence of new algorithms whose error/cost properties improve from step to step. These algorithms yield new upper complexity bounds, which differ from known lower bounds by only an arbitrarily small positive parameter in the exponent, and a logarithmic factor. In both the randomized and quantum settings, initial-value problems turn out to be essentially as difficult as scalar integration.
dc.description16 pages, minor presentation changes
dc.identifierhttps://arxiv.org/abs/quant-ph/0510045
dc.identifierhttp://arxiv.org/abs/quant-ph/0510045
dc.identifierJournal of Complexity 22 (2006), 676-690
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/104096
dc.subjectQuantum Physics
dc.titleAlmost Optimal Solution of Initial-Value Problems by Randomized and Quantum Algorithms
dc.typetext

Files

Collections

arXiv