{
  "id": "quant-ph/0306203",
  "version": "v1",
  "published": "2003-06-30T12:51:56.000Z",
  "updated": "2003-06-30T12:51:56.000Z",
  "title": "Quantum computation of the Anderson transition in presence of imperfections",
  "authors": [
    "Andrei A. Pomeransky",
    "Dima L. Shepelyansky"
  ],
  "comment": "revtex, 4 pages, 4 figures, research at Quantware MIPS Center http://www.quantware.ups-tlse.fr",
  "journal": "Phys. Rev. A 69, 014302 (2004)",
  "doi": "10.1103/PhysRevA.69.014302",
  "categories": [
    "quant-ph",
    "cond-mat",
    "nlin.CD"
  ],
  "abstract": "We 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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2003-06-30T12:51:56.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "anderson transition",
      "quantum computation",
      "quantum computer",
      "localization length",
      "diffusion rate"
    ],
    "tags": [
      "journal article"
    ],
    "publication": {
      "publisher": "APS",
      "journal": "Phys. Rev. A"
    },
    "note": {
      "typesetting": "RevTeX",
      "pages": 4,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}