Quantum algorithms for disordered physics
arXiv:1911.11117 · doi:10.1103/PhysRevA.101.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.
5 pages, 5 figures; version for PRA
References in corpus (11)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Anderson Transitions
- A Formulation of Lattice Gauge Theories for Quantum Simulations
- Digitization of Scalar Fields for Quantum Computing
- General Methods for Digital Quantum Simulation of Gauge Theories
- Linear Response on a Quantum Computer
- Quantum simulation of lattice gauge theories using Wilson fermions
- Critical properties of the Anderson localization transition and the high dimensional limit
- Eliminating fermionic matter fields in lattice gauge theories
- Sigma models on quantum computers
- Scalar Quantum Field Theories as a Benchmark for Near-Term Quantum Computers