Quantum computation of the Anderson transition in presence of imperfections

Simple item page
dc.creatorPomeransky, Andrei A.
dc.creatorShepelyansky, Dima L.
dc.date2003-06-30
dc.date.accessioned2026-07-07T06:07:13Z
dc.date.available2026-07-07T06:07:13Z
dc.descriptionWe propose a quantum algorithm for simulation of the Anderson transition in disordered lattices and study numerically its sensitivity to static imperfections in a quantum computer. In the vicinity of the critical point the algorithm gives a quadratic speedup in computation of diffusion rate and localization length, comparing to the known classical algorithms. We show that the Anderson transition can be detected on quantum computers with $7 - 10$ qubits.
dc.descriptionrevtex, 4 pages, 4 figures, research at Quantware MIPS Center http://www.quantware.ups-tlse.fr
dc.identifierhttps://arxiv.org/abs/quant-ph/0306203
dc.identifierhttp://arxiv.org/abs/quant-ph/0306203
dc.identifierPhys. Rev. A 69, 014302 (2004)
dc.identifierdoi:10.1103/PhysRevA.69.014302
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/91212
dc.subjectQuantum Physics
dc.subjectCondensed Matter
dc.subjectChaotic Dynamics
dc.titleQuantum computation of the Anderson transition in presence of imperfections
dc.typetext

Files

Collections

arXiv