Abstract

We construct quantum circuits which 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 $O(\lambda / \epsilon)$ where $\lambda$ is an absolute sum of Hamiltonian coefficients and $\epsilon$ is 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 $O({N + \log (1/\epsilon}))$ where $N$ is number of orbitals in the basis. This enables sampling in the eigenbasis of electronic structure Hamiltonians with T complexity $O(N^3 /\epsilon + N^2 \log(1/\epsilon)/\epsilon)$. 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.

Highlights

  • The ubiquitous problem of predicting material properties and chemical reactions from ab initio quantum mechanics is among the most anticipated applications of quantum computing

  • We introduced especially efficient faulttolerant quantum circuits for using phase estimation to estimate the spectra of electronic Hamiltonians

  • Unlike past work, which has focused on realizing phase estimation unitaries encoding e−iHτ, corresponding to time evolution under H for duration τ, we focused on a recent idea that one might more cheaply realize phase estimation unitaries encoding the quantum walk ei arccosðH=λÞ, where λ is a parameter closely related to the induced 1-norm of the system Hamiltonian [26,27]

Read more

Summary

INTRODUCTION

The ubiquitous problem of predicting material properties and chemical reactions from ab initio quantum mechanics is among the most anticipated applications of quantum computing. Performing quantum phase estimation to sample Hamiltonian spectra requires a quantum circuit to implement an operation WðHÞ, which has eigenvalues that are a known (and efficient-to-compute) function of the eigenvalues of H. We show that one can perform fault-tolerant phase estimation on interesting instances of both Fermi-Hubbard and molecular electronic structure beyond the capabilities of known classical algorithms using roughly 1 × 106 physical qubits in the surface code, assuming an architecture with two-qubit error rates of about one part in a thousand. VII with an outlook on future directions for quantum simulating correlated electron models

PHASE ESTIMATING SPECTRA OF HERMITIAN LINEAR COMBINATIONS
Encoding spectra in Szegedy quantum walks using qubitization oracles
Heisenberg-limited phase estimation of the qubitized quantum walk
Error scaling and query complexity
LOW T COMPLEXITY PRIMITIVES FOR LCU ORACLES
Unary iteration and indexed operations
Selective application of Majorana fermion operators
QROM for low T complexity data lookup
Subsampling the coefficient oracle
CONSTRUCTIONS FOR THE ELECTRONIC STRUCTURE HAMILTONIAN
Electronic structure Hamiltonian selection oracle
Electronic structure coefficient preparation oracle
Resources required for electronic structure simulation
CONSTRUCTIONS FOR THE HUBBARD MODEL
Hubbard model Hamiltonian selection oracle
Hubbard model resources
Exploiting locality in simulations of lattice Hamiltonians
RESOURCE ANALYSIS FOR FAULT-TOLERANT IMPLEMENTATION
Findings
CONCLUSION

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.