Optimization of the Qubit Coupled Cluster Ansatz on classical computers
Ilya G. Ryabinkin, Seyyed Mehdi Hosseini Jenab, and Scott N. Genin

TL;DR
This paper introduces two novel schemes to improve amplitude optimization in the iterative qubit coupled cluster method on classical computers, enabling more efficient and accurate simulations of molecular systems.
Contribution
It presents two innovative approximation schemes for the QCC ansatz that enhance optimization efficiency and scalability on classical hardware.
Findings
Both schemes allow inclusion of more generators in QCC.
They reduce iteration counts and improve accuracy.
The methods are demonstrated on molecular systems with up to 80 qubits.
Abstract
Immense interest in quantum computing has prompted development of electronic structure methods that are suitable for quantum hardware. However, the slow pace at which quantum hardware progresses, forces researchers to implement their ideas on classical computers despite the obvious loss of any "quantum advantage." As a result, the so-called quantum inspired methods emerge. They allow one to look at the electronic structure problem from a different angle; yet, to fully exploit their capacity, efficient implementations are highly desirable. Here we report two schemes for improving the amplitude optimisation in the iterative qubit coupled cluster (iQCC) method -- a variational quantum eigensolver-type approach which is based on the qubit coupled cluster (QCC) Ansatz. Our first scheme approximates the QCC unitary as a sum of symmetrical polynomials of generators up to a given order. The…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBenford’s Law and Fraud Detection · Computability, Logic, AI Algorithms · Quantum Mechanics and Applications
