Skip to content
Preprint

Alleviating the Sparse Matrix Scaling Bottleneck in Adaptive VQE via Greedy Operator Commutativity Partitioning and High-Order Taylor State Evolution

Jul 2026 · 1 citation · ⚡ 1 influential · 1 references
Physics

Abstract

The Variational Quantum Eigensolver (VQE) and its adaptive variants, such as ADAPT-VQE, are central to the study of strongly correlated quantum systems. However, the classical simulation of the ansatz growth process remains constrained by the exponential scaling of operator space and the associated computational cost of unitary evolution. We introduce the Greedy Operator Commutativity Partitioning (GOCP) framework, an analytical methodology designed to optimize both operator selection and state evolution. By reformulating complex unitary rotations as a chained sequence of fifth-order O(5) Taylor series expansions, GOCP bypasses the need for explicit matrix exponentiation, reducing the computational task to a sequence of sparse matrix-vector operations. We evaluate the performance of this framework across diverse molecular systems, including BeH2 and strongly correlated H2O geometries, utilizing both Jordan-Wigner and Bravyi-Kitaev mappings. Our results demonstrate that the GOCP framework maintains exceptional numerical fidelity-exceeding 1 - 10^-6 in state fidelity-while achieving sub-chemical accuracy in ground-state energy calculations. By enabling the simulation of operator manifolds exceeding 2.68 x 10^8 elements with high efficiency, this approach provides a scalable and rigorous pathway for exploring deep variational circuits in complex quantum many-body systems.

View source

Similar papers

Preprint Jul 2026

A hardware-efficient variational ansatz with an exact diagonal metric for real- and imaginary-time evolution and Haar sampling

A hardware-efficient $n-qubit ansatz, which parametrises states by a binary tree and whose Fubini-Study pullback metric is diagonal in closed form, which reaches reference-level accuracy with one to three orders of magnitude fewer two-qubit gates than leading alternatives.

D. Picozzi · 0 citations
Preprint Jul 2026

Fast two-dimensional tensor-network contraction via subspace iteration

Subspace-iteration CTMRG (SI-CTMRG), a QR-based projector construction that replaces each large-matrix SVD with an SVD of a much smaller matrix, making it highly suited to GPU acceleration and yielding speedups of up to two orders of magnitude over standard CTMRG.

Yining Zhang, Philippe Corboz · 0 citations
Preprint Aug 2026

Optimized Tensor-Network Renormalization for Quantum Dynamics: Resolving the Spectral Function of $\mathrm{K_2Co(SeO_3)_2}$

Tensor-network methods have opened a powerful route for the study of dynamical spectral functions in two-dimensional quantum systems. However, existing approaches within the framework of infinite projected entangled-pair states construct the required renormalization tensors solely from the ground-state environment and...

Jiahang Hu, Runze Chi, B. Normand et al. · 1 citation
Preprint Jul 2026

Variational Learning with Sparse Long-range Entangling Gates

This work examines when structured long-range connectivity provides a useful resource, focusing on sparse power-of-two (PWR2) coupling graphs, and identifies circuit geometry and qubit reconfigurability as task-dependent resources for variational algorithms.

Helene M. Losl, Aydin Deger, Andrew J. Daley · 0 citations
Preprint Jul 2026

Operator-centric Clifford algebra for variational eigensolvers and finite-shot adaptive selection

A sparse operator-centric realization of $n-qubit variational quantum algorithms in the complex Clifford algebra, a density-operator derivation and implementation of the real-sector pool filter, and a reproducible study of measurement-limited adaptive selection are developed.

Ginanjar Utama, H. K. Dipojono · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.