Dynamical localization simulated on a few qubits quantum computer

Simple item page
dc.creatorBenenti, Giuliano
dc.creatorCasati, Giulio
dc.creatorMontangero, Simone
dc.creatorShepelyansky, Dima L.
dc.date2002-10-08
dc.date.accessioned2026-07-07T06:05:09Z
dc.date.available2026-07-07T06:05:09Z
dc.descriptionWe show that a quantum computer operating with a small number of qubits can simulate the dynamical localization of classical chaos in a system described by the quantum sawtooth map model. The dynamics of the system is computed efficiently up to a time $t\geq \ell$, and then the localization length $\ell$ can be obtained with accuracy $ν$ by means of order $1/ν^2$ computer runs, followed by coarse grained projective measurements on the computational basis. We also show that in the presence of static imperfections a reliable computation of the localization length is possible without error correction up to an imperfection threshold which drops polynomially with the number of qubits.
dc.description8 pages, 8 figures
dc.identifierhttps://arxiv.org/abs/quant-ph/0210052
dc.identifierhttp://arxiv.org/abs/quant-ph/0210052
dc.identifierPhys. Rev. A 67, 052312 (2003)
dc.identifierdoi:10.1103/PhysRevA.67.052312
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/90548
dc.subjectQuantum Physics
dc.subjectCondensed Matter
dc.subjectChaotic Dynamics
dc.titleDynamical localization simulated on a few qubits quantum computer
dc.typetext

Files

Collections

arXiv