Pruned-ADAPT-VQE: compacting molecular ansätze by removing irrelevant operators

• URL: http://arxiv.org/abs/2504.04652v2
• Date: Thu, 28 Aug 2025 03:13:28 GMT
• Title: Pruned-ADAPT-VQE: compacting molecular ansätze by removing irrelevant operators
• Abstract summary: ADAPT-VQE is a problem-tailored variational quantum eigensolver.<n>It selects operators based on their gradient, constructing ans"atze that continuously evolve to match the energy landscape.<n>We propose an automated, cost-free refinement method that removes unnecessary operators from the ansatz.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The adaptive derivative-assembled problem-tailored variational quantum eigensolver (ADAPT-VQE) is one of the most widely used algorithms for electronic structure calculations in quantum computers. It adaptively selects operators based on their gradient, constructing ans\"atze that continuously evolve to match the energy landscape, helping avoid local traps and barren plateaus. However, this flexibility in reoptimization can lead to the inclusion of redundant or inefficient operators that have almost zero parameter value, barely contributing to the ansatz. We identify three phenomena responsible for the appearance of these operators: poor operator selection, operator reordering, and fading operators. In this work, we propose an automated, cost-free refinement method that removes unnecessary operators from the ansatz without disrupting convergence. Our approach evaluates each operator after ADAPT-VQE optimization by using a function that considers both its parameter value and position in the ansatz, striking a balance between eliminating low-coefficient operators while preserving the natural reduction of coefficients as the ansatz grows. Additionally, a dynamic threshold based on the parameters of recent operators enables efficient convergence. We apply this method to several molecular systems and find that it reduces ansatz size and accelerates convergence, particularly in cases with flat energy landscapes. The refinement process incurs, at most, a small additional computational cost and consistently improves or maintains ADAPT-VQE performance.

Related papers

• Reducing quantum resources for ADAPT-VQE via plateau-operator elimination and correlated mean-field downfolding [0.0]
  We propose a simple strategy of operator elimination that removes non-contributing operators from the pool.<n>We find that the former converges more smoothly and faster than the latter and the standard ADAPT-VQE.<n>Our results show that operator elimination significantly reduces circuit depth and count.
  arXiv  Detail & Related papers  (2026-07-01T07:59:13Z)
• Hamiltonian-Aware ADAPT Variational Quantum Eigensolver for Molecular Ground-State Simulation [10.162876846520374]
  We propose the Hamiltonian-Aware (HA) ADAPT-VQE algorithm to address improper operator selection and accumulation of degraded operators.<n>It breaks the local constraint of existing criteria by incorporating Hamiltonian information, prioritizes physically meaningful excitation operators, and incurs no extra classical or quantum computational overhead.<n>We also develop a problem-adaptive method for discriminating and pruning redundant excitation operators stemming from improper selection and inevitable degradation.
  arXiv  Detail & Related papers  (2026-06-11T09:44:41Z)
• AOT-POT: Adaptive Operator Transformation for Large-Scale PDE Pre-training [50.28798360093496]
  We propose to transform complex and diverse solution operators into simpler, better-aligned forms that are easier to model jointly.<n>We instantiate this idea as AOT-POT (adaptive operator-transformation for pre-training operator transformer), which expands hidden representations into multiple parallel streams.<n>AOT-POT achieves state-of-the-art performance on 12 PDE benchmarks with only 3% additional parameters, reducing relative L2 error by up to 77.6% (40.9% on average)
  arXiv  Detail & Related papers  (2026-05-15T09:50:34Z)
• Efficient Operator Selection and Warm-Start Strategy for Excitations in Variational Quantum Eigensolvers [0.0]
  We present a novel approach for efficient preparation of electronic ground states, leveraging the Excitation and Energy Sorting tools.<n>We show that this approach reduces the computational complexity associated with traditional optimization methods.<n>Overall, we empirically observe a quadratic convergence speedup beyond state-of-the-art methods, advancing the realization of quantum advantage in quantum chemistry.
  arXiv  Detail & Related papers  (2026-02-11T12:07:52Z)
• Variational Entropic Optimal Transport [67.76725267984578]
  We propose Variational Entropic Optimal Transport (VarEOT) for domain translation problems.<n>VarEOT is based on an exact variational reformulation of the log-partition $log mathbbE[exp(cdot)$ as a tractable generalization over an auxiliary positive normalizer.<n> Experiments on synthetic data and unpaired image-to-image translation demonstrate competitive or improved translation quality.
  arXiv  Detail & Related papers  (2026-02-02T15:48:44Z)
• Strategies for Overcoming Gradient Troughs in the ADAPT-VQE Algorithm [1.3135750017147134]
  ADAPT-VQE is a problem-tailored variational quantum eigensolver.<n>ADAPT-VQE avoids many of the shortcomings of other VQEs.<n>It is sometimes hindered by a phenomenon known as gradient troughs.
  arXiv  Detail & Related papers  (2025-12-31T17:52:47Z)
• Operator Commutativity Screening and Progressive Operator Block Reordering toward Many-body Inspired Quantum State Preparation [0.0]
  The variational quantum eigensolver (VQE) has emerged as a highly promising approach to determine molecular energies and properties.<n>We propose a systematic dynamic ansatz construction strategy in which the dominant operator blocks are initially identified.<n>We show that this strategy of progressive operator-block addition achieves accurate energetics with significantly fewer parameters while efficiently bypassing local traps.
  arXiv  Detail & Related papers  (2025-10-17T16:36:42Z)
• Accelerating PDE Solvers with Equation-Recast Neural Operator Preconditioning [9.178290601589365]
  Minimal-Data Parametric Neural Operator Preconditioning (MD-PNOP) is a new paradigm for accelerating parametric PDE solvers.<n>It recasts the residual from parameter deviation as additional source term, where trained neural operators can be used to refine the solution in an offline fashion.<n>It consistently achieves 50% reduction in computational time while maintaining full order fidelity for fixed-source, single-group eigenvalue, and multigroup coupled eigenvalue problems.
  arXiv  Detail & Related papers  (2025-09-01T12:14:58Z)
• Thompson Sampling in Function Spaces via Neural Operators [14.0301500809197]
  We propose an extension of Thompson sampling to optimization problems over function spaces where the objective is a known functional of an unknown operator's output.<n>Our algorithm employs a sample-then-optimize approach using neural operator surrogates.
  arXiv  Detail & Related papers  (2025-06-27T04:21:57Z)
• Projective Quantum Eigensolver with Generalized Operators [0.0]
  We develop a methodology for determining the generalized operators in terms of a closed form residual equations in the PQE framework. With the application on several molecular systems, we have demonstrated our ansatz achieves similar accuracy to the (disentangled) UCC with singles, doubles and triples.
  arXiv  Detail & Related papers  (2024-10-21T15:40:22Z)
• Fast gradient-free optimization of excitations in variational quantum eigensolvers [1.6874375111244329]
  We introduce Excitation, a globally-informed gradient-free excitation for physically-motivated ans"atze operators. Excitation achieves accuracy in a single sweep over the parameters of a fixed ansatz.
  arXiv  Detail & Related papers  (2024-09-09T18:00:00Z)
• Reducing measurement costs by recycling the Hessian in adaptive variational quantum algorithms [0.0]
  We propose an improved quasi-Newton optimization protocol specifically tailored to adaptive VQAs. We implement a quasi-Newton algorithm where an approximation to the inverse Hessian matrix is continuously built and grown across the iterations of an adaptive VQA.
  arXiv  Detail & Related papers  (2024-01-10T14:08:04Z)
• Energy-Preserving Reduced Operator Inference for Efficient Design and Control [0.0]
  This work presents a physics-preserving reduced model learning approach that targets partial differential equations. EP-OpInf learns efficient and accurate reduced models that retain this energy-preserving structure.
  arXiv  Detail & Related papers  (2024-01-05T16:39:48Z)
• Parameterized Projected Bellman Operator [64.129598593852]
  Approximate value iteration (AVI) is a family of algorithms for reinforcement learning (RL) We propose a novel alternative approach based on learning an approximate version of the Bellman operator. We formulate an optimization problem to learn PBO for generic sequential decision-making problems.
  arXiv  Detail & Related papers  (2023-12-20T09:33:16Z)
• Stable Nonconvex-Nonconcave Training via Linear Interpolation [51.668052890249726]
  This paper presents a theoretical analysis of linearahead as a principled method for stabilizing (large-scale) neural network training. We argue that instabilities in the optimization process are often caused by the nonmonotonicity of the loss landscape and show how linear can help by leveraging the theory of nonexpansive operators.
  arXiv  Detail & Related papers  (2023-10-20T12:45:12Z)
• Multi-Grid Tensorized Fourier Neural Operator for High-Resolution PDEs [93.82811501035569]
  We introduce a new data efficient and highly parallelizable operator learning approach with reduced memory requirement and better generalization. MG-TFNO scales to large resolutions by leveraging local and global structures of full-scale, real-world phenomena. We demonstrate superior performance on the turbulent Navier-Stokes equations where we achieve less than half the error with over 150x compression.
  arXiv  Detail & Related papers  (2023-09-29T20:18:52Z)
• HEAT: Hardware-Efficient Automatic Tensor Decomposition for Transformer Compression [69.36555801766762]
  We propose a hardware-aware tensor decomposition framework, dubbed HEAT, that enables efficient exploration of the exponential space of possible decompositions. We experimentally show that our hardware-aware factorized BERT variants reduce the energy-delay product by 5.7x with less than 1.1% accuracy loss.
  arXiv  Detail & Related papers  (2022-11-30T05:31:45Z)
• Symmetric Tensor Networks for Generative Modeling and Constrained Combinatorial Optimization [72.41480594026815]
  Constrained optimization problems abound in industry, from portfolio optimization to logistics. One of the major roadblocks in solving these problems is the presence of non-trivial hard constraints which limit the valid search space. In this work, we encode arbitrary integer-valued equality constraints of the form Ax=b, directly into U(1) symmetric networks (TNs) and leverage their applicability as quantum-inspired generative models.
  arXiv  Detail & Related papers  (2022-11-16T18:59:54Z)
• TETRIS-ADAPT-VQE: An adaptive algorithm that yields shallower, denser circuit ans\"atze [0.0]
  We introduce an algorithm called TETRIS-ADAPT-VQE, which iteratively builds up variational ans"atze a few operators at a time. It results in denser but significantly shallower circuits, without increasing the number of CNOT gates or variational parameters. These improvements bring us closer to the goal of demonstrating a practical quantum advantage on quantum hardware.
  arXiv  Detail & Related papers  (2022-09-21T18:00:02Z)
• Structured Sparsity Inducing Adaptive Optimizers for Deep Learning [94.23102887731417]
  In this paper, we derive the weighted proximal operator, which is a necessary component of proximal gradient methods. We show that this adaptive method, together with the weighted proximal operators derived here, is indeed capable of finding solutions with structure in their sparsity patterns.
  arXiv  Detail & Related papers  (2021-02-07T18:06:23Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)
• Variance Reduction with Sparse Gradients [82.41780420431205]
  Variance reduction methods such as SVRG and SpiderBoost use a mixture of large and small batch gradients. We introduce a new sparsity operator: The random-top-k operator. Our algorithm consistently outperforms SpiderBoost on various tasks including image classification, natural language processing, and sparse matrix factorization.
  arXiv  Detail & Related papers  (2020-01-27T08:23:58Z)

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.