The Dual Role of Low-Weight Pauli Propagation: A Flawed Simulator but a Powerful Initializer for Variational Quantum Algorithms

• URL: http://arxiv.org/abs/2508.06358v1
• Date: Fri, 08 Aug 2025 14:44:00 GMT
• Title: The Dual Role of Low-Weight Pauli Propagation: A Flawed Simulator but a Powerful Initializer for Variational Quantum Algorithms
• Authors: Zong-Liang Li, Shi-Xin Zhang,
• Abstract summary: Variational quantum algorithms (VQAs) rely on a classical pre-optimizer to tune a parameterized quantum circuit.<n>In this work, we investigate the low-weight Pauli propagation (LWPP) algorithm as a potential classical tool for simulating the VQA circuit.
• Score: 0.951494089949975
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Variational quantum algorithms (VQAs) rely on a classical optimizer to tune a parameterized quantum circuit, raising the question of whether classical methods can assist in this process. In this work, we investigate the low-weight Pauli propagation (LWPP) algorithm as a potential classical tool for simulating the VQA circuit. We first find that LWPP is an unreliable estimator of the true energy, limiting its utility as a direct simulator. However, we uncover its real value: despite this numerical inaccuracy, its approximate optimization landscape robustly guides parameters toward high-quality basins of attraction. We therefore propose harnessing LWPP not for simulation, but as a classical pre-optimizer to find superior initial parameters for the main VQA loop. Benchmarking this strategy on Heisenberg models, we demonstrate a remarkable enhancement in both the final accuracy and convergence rate, typically by an order of magnitude, over standard heuristics. Our work thus reframes LWPP from a flawed simulator into a powerful classical pre-processor that effectively mitigates the notorious optimization challenges in VQAs and reduces the computational burden on near-term quantum hardware.

Related papers

• Quantum Approximate Optimization Algorithm with Fixed Number of Parameters [0.0]
  We introduce a novel quantum optimization paradigm: the Fixed--Count Approximate Quantum Optimization Algorithm (FPC-QAOA)<n>It is a scalable variational framework that maintains a constant number of trainable parameters regardless of the number of qubits, Hamiltonian complexity, or circuit depth.<n>We benchmark FPC-QAOA on random MaxCut instances and the Tail Assignment Problem, achieving performance comparable to or better than standard QAOA.
  arXiv  Detail & Related papers  (2025-12-24T14:02:31Z)
• Practical Application of the Quantum Carleman Lattice Boltzmann Method in Industrial CFD Simulations [44.99833362998488]
  This work presents a practical numerical assessment of a hybrid quantum-classical approach to CFD based on the Lattice Boltzmann Method (LBM)<n>We evaluate this method on three benchmark cases featuring different boundary conditions, periodic, bounceback, and moving wall.<n>Our results confirm the validity of the approach, achieving median error fidelities on the order of $10-3$ and success probabilities sufficient for practical quantum state sampling.
  arXiv  Detail & Related papers  (2025-04-17T15:41:48Z)
• Application of Langevin Dynamics to Advance the Quantum Natural Gradient Optimization Algorithm [47.47843839099175]
  A Quantum Natural Gradient (QNG) algorithm for optimization of variational quantum circuits has been proposed recently.<n>Momentum-QNG is more effective to escape local minima and plateaus in the variational parameter space.
  arXiv  Detail & Related papers  (2024-09-03T15:21:16Z)
• Parameter Setting Heuristics Make the Quantum Approximate Optimization Algorithm Suitable for the Early Fault-Tolerant Era [3.734751161717204]
  Quantum Approximate Optimization Algorithm (QAOA) is one of the most promising quantum optimizations. Recent advances in parameter setting in QAOA make EFTQC experiments with QAOA practically viable.
  arXiv  Detail & Related papers  (2024-08-18T16:48:14Z)
• Challenges of variational quantum optimization with measurement shot noise [0.0]
  We study the scaling of the quantum resources to reach a fixed success probability as the problem size increases. Our results suggest that hybrid quantum-classical algorithms should possibly avoid a brute force classical outer loop.
  arXiv  Detail & Related papers  (2023-07-31T18:01:15Z)
• Benchmarking of Different Optimizers in the Variational Quantum Algorithms for Applications in Quantum Chemistry [0.0]
  Classical yardsticks play a crucial role in determining the accuracy and convergence of variational quantum algorithms. We consider a few popular yardsticks and assess their performance in variational quantum algorithms for applications in quantum chemistry.
  arXiv  Detail & Related papers  (2022-08-22T13:02:00Z)
• LAWS: Look Around and Warm-Start Natural Gradient Descent for Quantum Neural Networks [11.844238544360149]
  Vari quantum algorithms (VQAs) have recently received significant attention due to their promising performance in Noisy Intermediate-Scale Quantum computers (NISQ) VQAs run on parameterized quantum circuits (PQC) with randomlyational parameters are characterized by barren plateaus (BP) where the gradient vanishes exponentially in the number of qubits. In this paper, we first quantum natural gradient (QNG), which is one of the most popular algorithms used in VQA, from the classical first-order point of optimization. Then, we proposed a underlineAround underline
  arXiv  Detail & Related papers  (2022-05-05T14:16:40Z)
• Robust resource-efficient quantum variational ansatz through evolutionary algorithm [0.46180371154032895]
  Vari quantum algorithms (VQAsational) are promising methods to demonstrate quantum advantage on near-term devices. We show that a fixed VQA circuit design, such as the widely-used hardware efficient ansatz, is not necessarily robust against imperfections. We propose a genome-length-adjustable evolutionary algorithm to design a robust VQA circuit that is optimized over variations of both circuit ansatz and gate parameters.
  arXiv  Detail & Related papers  (2022-02-28T12:14:11Z)
• Quantum Approximate Optimization Algorithm Based Maximum Likelihood Detection [80.28858481461418]
  Recent advances in quantum technologies pave the way for noisy intermediate-scale quantum (NISQ) devices. Recent advances in quantum technologies pave the way for noisy intermediate-scale quantum (NISQ) devices.
  arXiv  Detail & Related papers  (2021-07-11T10:56:24Z)
• FLIP: A flexible initializer for arbitrarily-sized parametrized quantum circuits [105.54048699217668]
  We propose a FLexible Initializer for arbitrarily-sized Parametrized quantum circuits. FLIP can be applied to any family of PQCs, and instead of relying on a generic set of initial parameters, it is tailored to learn the structure of successful parameters. We illustrate the advantage of using FLIP in three scenarios: a family of problems with proven barren plateaus, PQC training to solve max-cut problem instances, and PQC training for finding the ground state energies of 1D Fermi-Hubbard models.
  arXiv  Detail & Related papers  (2021-03-15T17:38:33Z)
• 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)
• Cross Entropy Hyperparameter Optimization for Constrained Problem Hamiltonians Applied to QAOA [68.11912614360878]
  Hybrid quantum-classical algorithms such as Quantum Approximate Optimization Algorithm (QAOA) are considered as one of the most encouraging approaches for taking advantage of near-term quantum computers in practical applications. Such algorithms are usually implemented in a variational form, combining a classical optimization method with a quantum machine to find good solutions to an optimization problem. In this study we apply a Cross-Entropy method to shape this landscape, which allows the classical parameter to find better parameters more easily and hence results in an improved performance.
  arXiv  Detail & Related papers  (2020-03-11T13:52:41Z)

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.