Quantum computation of the Anderson transition in presence of imperfections

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.

revtex, 4 pages, 4 figures, research at Quantware MIPS Center http://www.quantware.ups-tlse.fr

References in corpus (1)

• Dynamical localization simulated on a few qubits quantum computer

Cited by in corpus (10)

• NMR quantum simulation of localization effects induced by decoherence
• Quantum Computation of a Complex System : the Kicked Harper Model
• Quantum computation and analysis of Wigner and Husimi functions: toward a quantum image treatment
• A quantitative model for the effective decoherence of a quantum computer with imperfect unitary operations
• Entropy of entanglement and multifractal exponents for random states
• Effects of imperfections for Shor's factorization algorithm
• Classical versus quantum errors in quantum computation of dynamical systems
• Quantum computation of multifractal exponents through the quantum wavelet transform
• Phase diagram for the Grover algorithm with static imperfections
• Critical Dynamics of the Anderson Transition on Small-World Graphs