A Neural-Guided Variational Quantum Algorithm for Efficient Sign Structure Learning in Hybrid Architectures

• URL: http://arxiv.org/abs/2507.07555v1
• Date: Thu, 10 Jul 2025 08:54:49 GMT
• Title: A Neural-Guided Variational Quantum Algorithm for Efficient Sign Structure Learning in Hybrid Architectures
• Authors: Mengzhen Ren, Yu-Cheng Chen, Yangsen Ye, Min-Hsiu Hsieh, Alice Hu, Chang-Yu Hsieh,
• Abstract summary: Variational quantum algorithms hold great promise for unlocking the power of near-term quantum processors.<n>Here, we introduce sVQNHE, a neural-guided variational quantum algorithm that decouples amplitude and sign learning across classical and quantum modules.<n>This hybrid quantum-classical synergy not only reduces measurement costs but also achieves high expressivity with limited quantum resources.
• Score: 11.258303973058377
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Variational quantum algorithms hold great promise for unlocking the power of near-term quantum processors, yet high measurement costs, barren plateaus, and challenging optimization landscapes frequently hinder them. Here, we introduce sVQNHE, a neural-guided variational quantum algorithm that decouples amplitude and sign learning across classical and quantum modules, respectively. Our approach employs shallow quantum circuits composed of commuting diagonal gates to efficiently model quantum phase information, while a classical neural network learns the amplitude distribution and guides circuit optimization in a bidirectional feedback loop. This hybrid quantum-classical synergy not only reduces measurement costs but also achieves high expressivity with limited quantum resources and improves the convergence rate of the variational optimization. We demonstrate the advancements brought by sVQNHE through extensive numerical experiments. For the 6-qubit J1-J2 model, a prototypical system with a severe sign problem for Monte Carlo-based methods, it reduces the mean absolute error by 98.9% and suppresses variance by 99.6% relative to a baseline neural network, while requiring nearly 19x fewer optimization steps than a standard hardware-efficient VQE. Furthermore, for MaxCut problems on 45-vertex Erdos-Renyi graphs, sVQNHE improves solution quality by 19% and quantum resource efficiency by 85%. Importantly, this framework is designed to be scalable and robust against hardware noise and finite-sampling uncertainty, making it well-suited for both current NISQ processors and future high-quality quantum computers. Our results highlight a promising path forward for efficiently tackling complex many-body and combinatorial optimization problems by fully exploiting the synergy between classical and quantum resources in the NISQ era and beyond.

Related papers

• Provably Robust Training of Quantum Circuit Classifiers Against Parameter Noise [49.97673761305336]
  Noise remains a major obstacle to achieving reliable quantum algorithms.<n>We present a provably noise-resilient training theory and algorithm to enhance the robustness of parameterized quantum circuit classifiers.
  arXiv  Detail & Related papers  (2025-05-24T02:51:34Z)
• Learning to Learn with Quantum Optimization via Quantum Neural Networks [1.7819574476785418]
  We introduce a quantum meta-learning framework that combines quantum neural networks, specifically Quantum Long Short-Term Memory (QLSTM)<n>Our approach rapidly generalizes to larger, more complex problems, substantially reducing the number of iterations required for convergence.
  arXiv  Detail & Related papers  (2025-05-01T14:39:26Z)
• Enhancing variational quantum algorithms by balancing training on classical and quantum hardware [1.8377902806196762]
  Variational Quantum Eigensolver (VQE) and quantum phase classification for up to 12-qubit Hamiltonians using quantum neural networks.<n>We numerically evaluate our approach for ground-state estimation of 6 to 18-qubit Hamiltonians using VQE and quantum phase classification for up to 12-qubit Hamiltonians using quantum neural networks.
  arXiv  Detail & Related papers  (2025-03-20T17:17:58Z)
• Hybrid Quantum-Classical Optimisation of Traveling Salesperson Problem [0.0]
  The Traveling Salesperson Problem (TSP) is a fundamental NP-hard optimisation challenge.<n>We present a hybrid quantum-classical approach that integrates quantum optimisation techniques with classical machine learning methods.
  arXiv  Detail & Related papers  (2025-02-28T22:07:28Z)
• Bias-field digitized counterdiabatic quantum optimization [39.58317527488534]
  We call this protocol bias-field digitizeddiabatic quantum optimization (BF-DCQO) Our purely quantum approach eliminates the dependency on classical variational quantum algorithms. It achieves scaling improvements in ground state success probabilities, increasing by up to two orders of magnitude.
  arXiv  Detail & Related papers  (2024-05-22T18:11:42Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)
• Space-efficient binary optimization for variational computing [68.8204255655161]
  We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem. We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
  arXiv  Detail & Related papers  (2020-09-15T18:17:27Z)

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.