← all papers · overview

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 qubits.

Related papers

Ranked by semantic similarity — how closely each paper's abstract matches this one (100% = near-identical topic).