Chebyshev Approximated Variational Coupled Cluster for Quantum Computing
Luca Erhart, Yuichiro Yoshida, Viktor Khinevich, Wataru Mizukami

TL;DR
This paper introduces Chebyshev polynomial-based methods to approximate variational coupled cluster theory on quantum computers, improving efficiency and accuracy for quantum state preparation and tomography.
Contribution
It proposes the Chebyshev approximated VCC and Hermitian-part Chebyshev VCC methods, enabling efficient non-unitary wave function implementation on quantum computers.
Findings
C^d-VCC converges rapidly with increasing degree d.
HC^d-VCC reduces Chebyshev expansion error.
Methods facilitate initial state preparation and quantum state tomography.
Abstract
We propose an approach to approximately implement the variational coupled cluster (VCC) theory on quantum computers, which struggles with exponential scaling of computational costs on classical computers. To this end, we employ expanding the exponential cluster operator using Chebyshev polynomials and introduce two methods: the Chebyshev approximated VCC (C-VCC) and the Hermitian-part Chebyshev approximated VCC (HC-VCC), where indicates the maximum degree of the Chebyshev polynomials. The latter method decomposes the cluster operator into anti-Hermitian and Hermitian parts, with the anti-Hermitian part represented by the disentangled unitary coupled cluster ansatz and the Hermitian part approximated using Chebyshev expansion. We illustrate the implementation of the HC-VCC in a quantum circuit using the quantum singular value transformation technique. Numerical…
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
TopicsQuantum Computing Algorithms and Architecture
