Multivariate unbounded quantum regression via log-ratio probabilities mitigating barren plateaus

• URL: http://arxiv.org/abs/2506.20135v1
• Date: Wed, 25 Jun 2025 05:10:24 GMT
• Title: Multivariate unbounded quantum regression via log-ratio probabilities mitigating barren plateaus
• Authors: Jaemin Seo,
• Abstract summary: We introduce a novel and simple post-processing method utilizing log-ratio probabilities (LRPs) of quantum states.<n>Our approach exponentially expands the number of regression outputs relative to qubit count, thus significantly improving parameter and qubit efficiency.
• Score: 1.6317061277457001
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Quantum neural networks (QNNs) have shown remarkable potential due to their capability of representing complex functions within exponentially large Hilbert spaces. However, their application to multivariate regression tasks has been limited, primarily due to inherent constraints of traditional approaches that rely on Pauli expectation values. In this work, we introduce a novel and simple post-processing method utilizing log-ratio probabilities (LRPs) of quantum states, enabling efficient and unbounded multivariate regression within existing QNN architectures. Our approach exponentially expands the number of regression outputs relative to qubit count, thus significantly improving parameter and qubit efficiency. Additionally, by enhancing parameter dependencies in the cost function and leveraging gradient pumping effects from the log-ratio transformation, our method mitigates the well-known barren plateau phenomenon, thereby stabilizing training. We further demonstrate that this approach facilitates robust uncertainty quantification, capturing both epistemic and aleatoric uncertainties simultaneously. Our findings underscore the practical potential of LRP-QNNs for complex multi-output regression tasks, particularly within current resource-constrained quantum hardware environments.

Related papers

• Calibration of Quantum Devices via Robust Statistical Methods [45.464983015777314]
  We numerically analyze advanced statistical methods for Bayesian inference against the state-of-the-art in quantum parameter learning.<n>We show advantages of these approaches over existing ones, namely under multi-modality and high dimensionality.<n>Our findings have applications in challenging quantumcharacterization tasks namely learning the dynamics of open quantum systems.
  arXiv  Detail & Related papers  (2025-07-09T15:22:17Z)
• Looking elsewhere: improving variational Monte Carlo gradients by importance sampling [41.94295877935867]
  Neural-network quantum states (NQS) offer a powerful and expressive ansatz for representing quantum many-body wave functions.<n>It is well known that some scenarios - such as sharply peaked wave functions emerging in quantum chemistry - lead to high-variance gradient estimators hindering the effectiveness of variational optimizations.<n>In this work we investigate a systematic strategy to tackle those sampling issues by means of adaptively tuned importance sampling.<n>Our approach can reduce the computational cost of vanilla VMC considerably, up to a factor of 100x when targeting highly peaked quantum chemistry wavefunctions.
  arXiv  Detail & Related papers  (2025-07-07T18:00:03Z)
• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [60.996803677584424]
  Variational Quantum Circuits (VQCs) offer a novel pathway for quantum machine learning.<n>Their practical application is hindered by inherent limitations such as constrained linear expressivity, optimization challenges, and acute sensitivity to quantum hardware noise.<n>This work introduces VQC-MLPNet, a scalable and robust hybrid quantum-classical architecture designed to overcome these obstacles.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• Physically motivated extrapolation for quantum error mitigation [7.598741686881365]
  We introduce the Physics-Inspired Extrapolation (PIE) method, built upon the EMRE framework, to achieve enhanced accuracy and robustness.<n>We demonstrate the efficacy of this method on IBMQ hardware and apply it to simulate 84-qubit quantum dynamics efficiently.
  arXiv  Detail & Related papers  (2025-05-12T18:20:58Z)
• Leveraging Pre-Trained Neural Networks to Enhance Machine Learning with Variational Quantum Circuits [48.33631905972908]
  We introduce an innovative approach that utilizes pre-trained neural networks to enhance Variational Quantum Circuits (VQC) This technique effectively separates approximation error from qubit count and removes the need for restrictive conditions. Our results extend to applications such as human genome analysis, demonstrating the broad applicability of our approach.
  arXiv  Detail & Related papers  (2024-11-13T12:03:39Z)
• Trainability Enhancement of Parameterized Quantum Circuits via Reduced-Domain Parameter Initialization [3.031137751464259]
  We show that by reducing the initial domain of each parameter proportional to the square root of circuit depth, the magnitude of the cost gradient decays at most inversely to qubit count and circuit depth. This strategy can protect specific quantum neural networks from exponentially many spurious local minima.
  arXiv  Detail & Related papers  (2023-02-14T06:41:37Z)
• Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
  We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits. This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
  arXiv  Detail & Related papers  (2023-02-09T14:05:18Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• Learning Quantile Functions without Quantile Crossing for Distribution-free Time Series Forecasting [12.269597033369557]
  We propose the Incremental (Spline) Quantile Functions I(S)QF, a flexible and efficient distribution-free quantile estimation framework. We also provide a generalization error analysis of our proposed approaches under the sequence-to-sequence setting.
  arXiv  Detail & Related papers  (2021-11-12T06:54:48Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• A variational quantum eigensolver for dynamic correlation functions [0.9176056742068814]
  We show how the calculation of zero-temperature dynamic correlation functions can be recast into a modified VQE algorithm. This allows for important physical expectation values describing the dynamics of the system to be directly converged on the frequency axis. We believe the approach shows potential for the extraction of frequency dynamics of correlated systems on near-term quantum processors.
  arXiv  Detail & Related papers  (2021-05-04T18:52:45Z)
• Importance Sampling Scheme for the Stochastic Simulation of Quantum Spin Dynamics [0.0]
  We develop an importance sampling scheme for the simulation of quantum spin dynamics. An exact transformation is then carried out to preferentially sample trajectories that are close to the dominant one. We demonstrate that this approach is capable of reducing the temporal growth of fluctuations in the quantities.
  arXiv  Detail & Related papers  (2021-03-30T16:18:28Z)
• 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)

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.