Gradient-Based Excitation Filter for Molecular Ground-State Simulation

• URL: http://arxiv.org/abs/2506.20398v2
• Date: Mon, 07 Jul 2025 01:20:02 GMT
• Title: Gradient-Based Excitation Filter for Molecular Ground-State Simulation
• Authors: Runhong He, Qiaozhen Chai, Xin Hong, Ji Guan, Guolong Cui, Shengbin Wang, Shenggang Ying,
• Abstract summary: We introduce a method to efficiently simplify the Unitary Coupled-Cluster with Single and Double Excitations (UCCSD) ansatz on classical computers.<n>We demonstrate that our approach achieves up to $46%$ parameter decrease, $60%$ circuit depth reduction and $678times runtime.
• Score: 6.627541720714792
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Molecular ground-state simulation is one of the most promising fields for demonstrating practical quantum advantage on near-term quantum computers. However, the Variational Quantum Eigensolver (VQE), a leading algorithm for this task, still faces significant challenges due to excessive circuit depth. This paper introduces a method to efficiently simplify the Unitary Coupled-Cluster with Single and Double Excitations (UCCSD) ansatz on classical computers. We propose to estimate the correlation energy contributions of excitations using their gradients at Hartree-Fock state, supported by a theoretical proof. For molecular systems with $K$ orbitals, these gradients can be obtained with complexity only $O(K^8)$, which can be efficiently implemented on classical computers, especially in parallel. By sorting and truncating the excitations based on these gradients, the simplified ansatz can be obtained immediately, avoiding the challenging task of optimizing ansatz structure on a quantum computer. Furthermore, we introduce a strategy to indirectly identify critical excitations through spin-adapted constraints, reducing gradient computations by $60\%$. Numerical experiments on prototype molecular systems (H${_4}$, HF, H${_2}$O, BeH${_2}$ and NH$_3$) demonstrate that our approach achieves up to $46\%$ parameter decrease, $60\%$ circuit depth reduction and $678\times$ runtime speedup compared to the state-of-the-art ADAPT-VQE algorithm, enabling significantly more compact quantum circuits with enhanced near-term feasibility.

Related papers

• Optimizing Quantum Chemistry Simulations with a Hybrid Quantization Scheme [11.915190522925199]
  We propose a hybrid quantization scheme for electronic simulations that employs a conversion circuit to switch efficiently between the two quantizations.<n>This way, plane-wave Hamiltonian simulations can be done efficiently in the first-quantization before converting to the second quantization.<n>We discuss applications of this hybrid quantization scheme to bring improvements in the characterization of ground-state and excited-state properties.
  arXiv  Detail & Related papers  (2025-07-06T06:06:48Z)
• Q2SAR: A Quantum Multiple Kernel Learning Approach for Drug Discovery [39.58317527488534]
  This research demonstrates the successful application of a Quantum Multiple Kernel Learning framework to enhance QSAR classification.<n>We apply this methodology to a dataset for identifying DYRK1A kinase inhibitors.<n>By benchmarking the QMKL-SVM against a classical Gradient Boosting model, we show that the quantum-enhanced approach achieves a superior AUC score.
  arXiv  Detail & Related papers  (2025-06-17T19:00:47Z)
• Quantum-Trajectory-Inspired Lindbladian Simulation [15.006625290843187]
  We propose two quantum algorithms for simulating the dynamics of open quantum systems governed by Lindbladians. The first algorithm achieves a gate complexity independent of the number of jump operators, $m$, marking a significant improvement in efficiency. The second algorithm achieves near-optimal dependence on the evolution time $t$ and precision $epsilon$ and introduces only an additional $tildeO(m)$ factor.
  arXiv  Detail & Related papers  (2024-08-20T03:08:27Z)
• Non-unitary Coupled Cluster Enabled by Mid-circuit Measurements on Quantum Computers [37.69303106863453]
  We propose a state preparation method based on coupled cluster (CC) theory, which is a pillar of quantum chemistry on classical computers. Our approach leads to a reduction of the classical computation overhead, and the number of CNOT and T gates by 28% and 57% on average.
  arXiv  Detail & Related papers  (2024-06-17T14:10:10Z)
• Size-consistency and orbital-invariance issues revealed by VQE-UCCSD calculations with the FMO scheme [0.0]
  fragment molecular orbital (FMO) scheme is one of the popular fragmentation-based methods. We used a GPU-accelerated quantum simulator (cuQuantum) to perform the electron correlation part of the FMO calculation.
  arXiv  Detail & Related papers  (2024-02-28T02:16:14Z)
• Neutron-nucleus dynamics simulations for quantum computers [49.369935809497214]
  We develop a novel quantum algorithm for neutron-nucleus simulations with general potentials. It provides acceptable bound-state energies even in the presence of noise, through the noise-resilient training method. We introduce a new commutativity scheme called distance-grouped commutativity (DGC) and compare its performance with the well-known qubit-commutativity scheme.
  arXiv  Detail & Related papers  (2024-02-22T16:33:48Z)
• A multiple-circuit approach to quantum resource reduction with application to the quantum lattice Boltzmann method [39.671915199737846]
  We introduce a multiple-circuit algorithm for a quantum lattice Boltzmann method (QLBM) solve of the incompressible Navier--Stokes equations.<n>The presented method is validated and demonstrated for 2D lid-driven cavity flow.
  arXiv  Detail & Related papers  (2024-01-20T15:32:01Z)
• Simulation of IBM's kicked Ising experiment with Projected Entangled Pair Operator [71.10376783074766]
  We perform classical simulations of the 127-qubit kicked Ising model, which was recently emulated using a quantum circuit with error mitigation. Our approach is based on the projected entangled pair operator (PEPO) in the Heisenberg picture. We develop a Clifford expansion theory to compute exact expectation values and use them to evaluate algorithms.
  arXiv  Detail & Related papers  (2023-08-06T10:24:23Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• Iterative Qubit Coupled Cluster using only Clifford circuits [36.136619420474766]
  An ideal state preparation protocol can be characterized by being easily generated classically. We propose a method that meets these requirements by introducing a variant of the iterative qubit coupled cluster (iQCC) We demonstrate the algorithm's correctness in ground-state simulations and extend our study to complex systems like the titanium-based compound Ti(C5H5)(CH3)3 with a (20, 20) active space.
  arXiv  Detail & Related papers  (2022-11-18T20:31:10Z)
• Improving the Accuracy of Variational Quantum Eigensolvers With Fewer Qubits Using Orbital Optimization [5.266892492931388]
  Near-term quantum computers will be limited in the number of qubits on which they can process information as well as the depth of the circuits that they can coherently carry out. To-date, experimental demonstrations of algorithms such as the Variational Quantum Eigensolver (VQE) have been limited to small molecules using minimal basis sets. We propose incorporating an orbital optimization scheme into quantum eigensolvers wherein a parameterized partial unitary transformation is applied to the basis functions set.
  arXiv  Detail & Related papers  (2022-08-30T17:50:23Z)
• Efficient Quantum Analytic Nuclear Gradients with Double Factorization [0.0]
  We report a Lagrangian-based approach for evaluating relaxed one- and two-particle reduced density matrices from double factorized Hamiltonians. We demonstrate the accuracy and feasibility of our Lagrangian-based approach to recover all off-diagonal density matrix elements in classically-simulated examples.
  arXiv  Detail & Related papers  (2022-07-26T18:47:48Z)
• A single $T$-gate makes distribution learning hard [56.045224655472865]
  This work provides an extensive characterization of the learnability of the output distributions of local quantum circuits. We show that for a wide variety of the most practically relevant learning algorithms -- including hybrid-quantum classical algorithms -- even the generative modelling problem associated with depth $d=omega(log(n))$ Clifford circuits is hard.
  arXiv  Detail & Related papers  (2022-07-07T08:04:15Z)
• Unitary Selective Coupled-Cluster Method [0.8258451067861933]
  Simulating molecules using the Variational Quantum Eigensolver method is one of the promising applications for NISQ-era quantum computers. Designing an efficient ansatz to represent the electronic wave function is crucial in such simulations. We present a unitary selective coupled-cluster method, a way to construct a unitary coupled-cluster ansatz iteratively using a selection procedure with excitations up to fourth order.
  arXiv  Detail & Related papers  (2021-09-26T17:02:16Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
  We study two different methods to prepare excited states on a quantum computer. We benchmark these techniques on emulated and real quantum devices. These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
  arXiv  Detail & Related papers  (2020-09-28T17:21:25Z)
• Shallow-circuit variational quantum eigensolver based on symmetry-inspired Hilbert space partitioning for quantum chemical calculations [3.8117315001626966]
  partitioning of the Hilbert space greatly reduces the number of variational operators. A single-term representation suffices to reach required accuracy for various molecules tested. The number of controlled-NOT gates, a measure of the quantum-circuit depth, is reduced by a factor of as large as 35.
  arXiv  Detail & Related papers  (2020-06-19T16:28:26Z)
• Hartree-Fock on a superconducting qubit quantum computer [30.152226344347064]
  Here, we perform a series of quantum simulations of chemistry the largest of which involved a dozen qubits, 78 two-qubit gates, and 114 one-qubit gates. We model the binding energy of $rm H_6$, $rm H_8$, $rm H_10$ and $rm H_12$ chains as well as the isomerization of diazene. We also demonstrate error-mitigation strategies based on $N$-representability which dramatically improve the effective fidelity of our experiments.
  arXiv  Detail & Related papers  (2020-04-08T18:00:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.