HackerPapers

arXiv:1805.03662quant-ph

Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity

Ryan Babbush, Craig Gidney, Dominic W. Berry, Nathan Wiebe, Jarrod McClean, Alexandru Paler, Austin Fowler, Hartmut Neven

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

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(λ/ ε)$ where $λ$ is an absolute sum of Hamiltonian coefficients and $ε$ 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/ε}))$ 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 /ε+ N^2 \log(1/ε)/ε)$. 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.

arXiv comments
39 pages, 25 figures, 9 tables; fixed minor errors from v1
Journal reference
Phys. Rev. X 8, 041015 (2018)
DOI
doi:10.1103/PhysRevX.8.041015
Subjects
quant-phQuantum Physics cond-mat.str-elStrongly Correlated Electrons physics.chem-phChemical Physics

On Hacker News

Linked by 1 identifiable commenter in 2 comments across 2 threads, from Jun 2018 to Dec 2021.

Comments linking this paper, per year.

Discussed in comments2 threads

    • I kinda of worry that if this site succeeded, it would slowly do to papers what news aggregators and the internet already did to news. Grind and incentivize them down into clickbait with no meat, with as few things as possible that people won't immediately understand. For…

      StrilancView on HNParent context

    • Even if the number of qubits doubled every year from here on out, it would be 15+ years until we had enough working space to run Shor's algorithm on modern cryptographic key sizes. Back of the envelope: - It takes 9n error-corrected qubits to break an n-bit ECDH key [1] - Each…

      StrilancView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.