REVIEW 1 cited by
Quantum chemistry on quantum annealers
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
Quantum chemistry calculations for small molecules on quantum hardware have been demonstrated to date only on universal-gate quantum computers, not quantum annealers. The latter devices are limited to finding the lowest eigenstate of the Ising Hamiltonian whereas the electronic Hamiltonian could not be mapped to the Ising form without exponential growth of the Ising Hamiltonian with the size of the system [J. Phys. Chem. B 122, 3384 (2018)]. Here we propose a novel mixed discrete-continuous optimization algorithm, which finds the lowest eigenstate of the qubit coupled cluster (QCC) method using a quantum annealer for solving a discrete part of the problem. The QCC method is a potentially exact approach for constructing the electronic wave function in the qubit space. Therefore, our methodology allows for systematically improvable quantum chemistry calculations using quantum annealears. We illustrate capabilities of our approach by calculating QCC ground electronic states for the LiH, H$_2$O, and C$_6$H$_6$ molecules. C$_6$H$_6$ calculations involve 36 qubits and are the largest quantum chemistry calculations made on a quantum annealer (the D-Wave 2000Q system) to date. Our findings opens up a new perspective for use quantum annealers in high-throughput material discovery.
Forward citations
Cited by 1 Pith paper
-
Bridging Quantum Chemistry and MaxCut: Classical Performance Guarantees and Quantum Algorithms for the Hartree-Fock Method
Hartree-Fock energy minimization is reformulated as a sequence of QUBO/MaxCut problems, with approximation guarantees at each step and demonstrations on OH- and N2.
Discussion (0). Continue with ORCID to comment.