Quantum Computing of Poincare Recurrences and Periodic Orbits

Simple item page
dc.creatorGeorgeot, B.
dc.date2003-07-31
dc.date2004-01-30
dc.date.accessioned2026-07-07T06:07:29Z
dc.date.available2026-07-07T06:07:29Z
dc.descriptionQuantum algorithms are built enabling to find Poincaré recurrence times and periodic orbits of classical dynamical systems. It is shown that exponential gain compared to classical algorithms can be reached for a restricted class of systems. Quadratic gain can be achieved for a larger set of dynamical systems. The simplest cases can be implemented with small number of qubits.
dc.descriptionrevtex, 5 pages, research at Quantware MIPS Center (see http://www.quantware.ups-tlse.fr); minor changes and references added
dc.identifierhttps://arxiv.org/abs/quant-ph/0307233
dc.identifierhttp://arxiv.org/abs/quant-ph/0307233
dc.identifierPhysical Review A 69, 032301 (2004)
dc.identifierdoi:10.1103/PhysRevA.69.032301
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/91313
dc.subjectQuantum Physics
dc.subjectCondensed Matter
dc.subjectChaotic Dynamics
dc.titleQuantum Computing of Poincare Recurrences and Periodic Orbits
dc.typetext

Files

Collections

arXiv