Quantum algorithms for disordered physics
- 19 March 2020
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 101 (3) , 032325
Abstract
We show how a quantum computer may efficiently simulate a disordered Hamiltonian, by incorporating a pseudo-random-number generator directly into the time evolution circuit. This technique is applied to quantum simulation of few-body disordered systems in the large volume limit, in particular, Anderson localization. The method requires a number of (error corrected) qubits proportional to the logarithm of the volume of the system, and each time evolution step requires a number of gates polylogarithmic in the volume. We simulate the method to observe the metal-insulator transition on a three-dimensional lattice. Additionally, we demonstrate the algorithm on a one-dimensional lattice, using physical quantum processors.Keywords
All Related Versions
Funding Information
- U.S. Department of Energy (DE-FG02-95ER-40907, DE-FG02-93ER-40762)
This publication has 19 references indexed in Scilit:
- Critical properties of the Anderson localization transition and the high-dimensional limitPhysical Review B, 2017
- Real-time dynamics of lattice gauge theories with a few-qubit quantum computerNature, 2016
- Formulation of lattice gauge theories for quantum simulationsPhysical Review D, 2015
- Quantum Algorithms for Quantum Field TheoriesScience, 2012
- Anderson transitionsReviews of Modern Physics, 2008
- Universal Quantum SimulatorsScience, 1996
- Anderson localization and interactions in one-dimensional metalsPhysical Review B, 1988
- Interactions and the Anderson transitionPhysical Review B, 1980
- Scaling Theory of Localization: Absence of Quantum Diffusion in Two DimensionsPhysical Review Letters, 1979
- Absence of Diffusion in Certain Random LatticesPhysical Review B, 1958