Quantum computation of the Anderson transition in the presence of imperfections

2003/06/30 by Andrei A. Pomeransky, A. A. Pomeransky, Dima L. Shepelyansky · 3 citations
Physics and Astronomy · #Quantum chaos and dynamical systems #Quantum many-body systems #Theoretical and Computational Physics #cond-mat #nlin.CD #quant-ph

paper · pdf · doi:10.1103/physreva.69.014302

published as Phys. Rev. A 69, 014302 (2004) · revtex, 4 pages, 4 figures, research at Quantware MIPS Center http://www.quantware.ups-tlse.fr

arxiv created 2003/06/30 · openalex publication_date 2004/01/12 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Cited by

• Classical versus quantum errors in quantum computation of dynamical systems
• Entropy of entanglement and multifractal exponents for random states
• Effects of imperfections for Shor’s factorization algorithm

Related

• To Study the Effect of Boundary Conditions and Disorder in Spin Chain Systems Using Quantum Computers
• Computational leakage: Grover's algorithm with imperfections
• Quantum Computation of a Complex System : the Kicked Harper Model
• Efficient Quantum Computing of Complex Dynamics
• Mapping the metal-insulator phase diagram by algebraically fast-forwarding dynamics on a cloud quantum computer