Abstract
We construct quantum circuits that exactly encode the spectra of correlated electron models up to errors from rotation synthesis. By invoking these circuits as oracles within the recently introduced “qubitization” framework, one can use quantum phase estimation to sample states in the Hamiltonian eigenbasis with optimal query complexity , where is an absolute sum of Hamiltonian coefficients and is the target precision. For both the Hubbard model and electronic structure Hamiltonian in a second quantized basis diagonalizing the Coulomb operator, our circuits have T-gate complexity , where is the number of orbitals in the basis. This scenario enables sampling in the eigenbasis of electronic structure Hamiltonians with T complexity . Compared to prior approaches, our algorithms are asymptotically more efficient in gate complexity and require fewer T gates near the classically intractable regime. Compiling to surface code fault-tolerant gates and assuming per-gate error rates of one part in a thousand reveals that one can error correct phase estimation on interesting instances of these problems beyond the current capabilities of classical methods using only about a million superconducting qubits in a matter of hours.
18 More- Received 9 May 2018
- Revised 1 August 2018
DOI:https://doi.org/10.1103/PhysRevX.8.041015
Published by the American Physical Society under the terms of the Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article’s title, journal citation, and DOI.
Published by the American Physical Society
Physics Subject Headings (PhySH)
Popular Summary
Among the most anticipated applications of quantum computers is the simulation of physical quantum systems such as chemical reactions and solid-state materials. However, reliably solving these problems will likely require quantum error correction, which comes with high resource overheads. With fault-tolerant cost models in mind, we develop new algorithms to simulate systems of correlated electrons. These algorithms require millions of times fewer gates than prior state-of-the-art approaches, and they can solve interesting problems in chemistry near the threshold for those that cannot be solved with a classical computer.
Our approach involves realizing a quantum walk that exactly encodes the desired simulation results, but in a nonlinear fashion. To increase the efficiency of our algorithm, we introduce a novel form of quantum read-only memory that needs less data loaded into a quantum superposition by leveraging the symmetry of electron-electron interactions.
We investigate the cost of our method for simulating various real materials and models of strongly correlated electrons, and we compile the associated circuits all the way to the equivalent of “assembly language” for quantum error correction codes. We conclude that one would require approximately physical qubits at error rates of one part in a thousand using the surface code.
These results position the simulation of materials as the first valuable application of quantum computing that will be viable within error correction.