arXiv Analytics

Sign in

arXiv:2206.11246 [quant-ph]AbstractReferencesReviewsResources

Exploiting subspace constraints and ab initio variational methods for quantum chemistry

Cica Gustiani, Richard Meister, Simon C. Benjamin

Published 2022-06-22Version 1

Variational methods offer a highly promising route to exploiting quantum computers for chemistry tasks. Here we employ methods described in a sister paper to the present report, entitled ab initio machine synthesis of quantum circuits, in order to solve problems using adaptively evolving quantum circuits. Consistent with prior authors we find that this approach can outperform human-designed circuits such as the coupled-cluster or hardware-efficient ans\"atze, and we make comparisons for larger instances up to 14 qubits. Moreover we introduce a novel approach to constraining the circuit evolution in the physically relevant subspace, finding that this greatly improves performance and compactness of the circuits. We consider both static and dynamics properties of molecular systems. The emulation environments used is QuESTlink; all resources are open source and linked from this paper.

Comments: 8 pages, 8 figures, 8 pages of appendix, and 12 figures in the appendix
Categories: quant-ph
Related articles: Most relevant | Search more
arXiv:2006.00961 [quant-ph] (Published 2020-06-01)
Concept of orbital entanglement and correlation in quantum chemistry
arXiv:quant-ph/0208003 (Published 2002-08-01)
Gate-Level Simulation of Quantum Circuits
arXiv:1312.2579 [quant-ph] (Published 2013-12-09, updated 2013-12-15)
Quantum Algorithms for Quantum Chemistry based on the sparsity of the CI-matrix