Constrained Optimal Polynomials for Quantum Linear System Solvers

• URL: http://arxiv.org/abs/2604.20513v2
• Date: Tue, 28 Apr 2026 14:57:41 GMT
• Title: Constrained Optimal Polynomials for Quantum Linear System Solvers
• Abstract summary: We introduce constrained optimal approximations as a framework for solving Krylov subspace theory.<n>We develop two classes of solvers: Constrained Uniform Polynomial solvers and Adaptive Polynomial solvers.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum linear system solvers typically realize the inverse map as a polynomial transformation of the spectrum, so their practical cost hinges on implementing this transformation at a low polynomial degree. We introduce constrained optimal polynomials as a framework for this task, drawing on classical Krylov subspace theory. Within this framework, we develop two classes of solvers. Constrained Uniform Polynomial (CUP) solvers optimize the tradeoff between approximation accuracy and block encoding normalization under a uniform spectral model consistent with the available bounds. Constrained Adaptive Polynomial (CAP) solvers retain this structure but replace the uniform model with a probability measure reconstructed from spectral moments via a maximum entropy ansatz, where the moments are extracted from QSVT measurements. Numerical experiments under hardware and stochastic noise show that these methods achieve lower error than standard QSVT-based and Chebyshev-iteration-type solvers, particularly in noise-limited regimes. CUP offers robust performance under generic spectra, while CAP provides further improvement when the spectral structure can be exploited.

Related papers

• An analysis of iterative refinement for quantum linear system solvers [0.06157382820537719]
  We present an iterative refinement (IR) framework for improving the precision dependence of algorithms that combine a quantum linear system algorithm (QLSA) with quantum state tomography.<n>We evaluate the proposed scheme through numerical experiments on both quantum simulators and real quantum hardware.
  arXiv  Detail & Related papers  (2026-09-09T14:38:28Z)
• Analytical Series Expansion for Efficient Gradient Evaluation in Multi-Qubit Optimal Control [42.97938764966747]
  We present a unifying framework for gradient-based quantum optimal control.<n>For the case of unitary propagators, we derive a series expansion involving time-independent commutators and time-dependent coefficients.<n>The method is particularly suited for simulating optimal control tasks in quantum systems with local interactions.
  arXiv  Detail & Related papers  (2026-07-29T12:50:52Z)
• Constrained Stochastic Spectral Preconditioning Converges for Nonconvex Objectives [48.91820744387913]
  We develop preconditioned gradient methods with a focus on Muon and Scions.<n>We introduce a family of algorithms that can handle a wide variety of convex and non-reduced constraints.
  arXiv  Detail & Related papers  (2026-05-12T09:36:13Z)
• A Unified Poisson Summation Framework for Generalized Quantum Matrix Transformations [2.1496959255800188]
  We present a unified algorithmic framework for quantum simulation of non-unitary dynamics and matrix functions.<n>By reinterpreting discretization errors as spectral folding in dual domains, we synthesize two distinct algorithmic paths.<n>We demonstrate the versatility of this framework by efficiently simulating diverse phenomena.
  arXiv  Detail & Related papers  (2026-04-03T08:42:08Z)
• Physics-Informed Chebyshev Polynomial Neural Operator for Parametric Partial Differential Equations [17.758049557300826]
  We introduce the Physics-Informed Chebyshev Polynomial Neural Operator (CPNO)<n>CPNO replaces unstable monomial expansions with numerically stable Chebyshev spectral basis.<n> Experiments on benchmark parameterized PDEs show that CPNO achieves superior accuracy, faster convergence, and enhanced robustness to hyper parameters.
  arXiv  Detail & Related papers  (2026-02-02T07:19:56Z)
• Variational (Energy-Based) Spectral Learning: A Machine Learning Framework for Solving Partial Differential Equations [0.0]
  We introduce variational spectral learning (VSL), a machine learning framework for solving partial differential equations (PDEs)<n>VSL offers a principled bridge between variational PDE theory, spectral discretization, and contemporary machine learning practice.
  arXiv  Detail & Related papers  (2026-01-05T19:03:58Z)
• Quantum Simulation of Non-unitary Dynamics via Contour-based Matrix Decomposition [6.538464633253838]
  We introduce contour-based matrix decomposition (CBMD), a framework for scalable simulation of non-unitary dynamics.<n>CBMD generalizes Cauchy's residue theorem to matrix-valued functions and directly decomposes a non-Hermitian function into a linear combination of Hermitian ones.
  arXiv  Detail & Related papers  (2025-11-13T12:52:52Z)
• Quantum eigenvalue processing [0.0]
  Problems in linear algebra can be solved on a quantum computer by processing eigenvalues of the non-normal input matrices. We present a Quantum EigenValue Transformation (QEVT) framework for applying arbitrary transformations on eigenvalues of block-encoded non-normal operators. We also present a Quantum EigenValue Estimation (QEVE) algorithm for operators with real spectra.
  arXiv  Detail & Related papers  (2024-01-11T19:49:31Z)
• Polynomial-time Solver of Tridiagonal QUBO, QUDO and Tensor QUDO problems with Tensor Networks [41.94295877935867]
  We present a quantum-inspired tensor network algorithm for solving tridiagonal Quadratic Unconstrained Binary Optimization problems.<n>We also solve the more general quadratic unconstrained discrete optimization problems with one-neighbor interactions in a lineal chain.
  arXiv  Detail & Related papers  (2023-09-19T10:45:15Z)
• Analyzing Prospects for Quantum Advantage in Topological Data Analysis [35.423446067065576]
  We analyze and optimize an improved quantum algorithm for topological data analysis. We show that super-quadratic quantum speedups are only possible when targeting a multiplicative error approximation. We argue that quantum circuits with tens of billions of Toffoli can solve seemingly classically intractable instances.
  arXiv  Detail & Related papers  (2022-09-27T17:56:15Z)
• Controlling the Complexity and Lipschitz Constant improves polynomial nets [55.121200972539114]
  We derive new complexity bounds for the set of Coupled CP-Decomposition (CCP) and Nested Coupled CP-decomposition (NCP) models of Polynomial Nets. We propose a principled regularization scheme that we evaluate experimentally in six datasets and show that it improves the accuracy as well as the robustness of the models to adversarial perturbations.
  arXiv  Detail & Related papers  (2022-02-10T14:54:29Z)
• Fast Convex Optimization for Two-Layer ReLU Networks: Equivalent Model Classes and Cone Decompositions [47.276004075767176]
  We develop software for convex optimization of two-layer neural networks with ReLU activation functions.<n>We show that convex gated ReLU models obtain data-dependent algorithms for the ReLU training problem.
  arXiv  Detail & Related papers  (2022-02-02T23:50:53Z)
• Scalable Variational Gaussian Processes via Harmonic Kernel Decomposition [54.07797071198249]
  We introduce a new scalable variational Gaussian process approximation which provides a high fidelity approximation while retaining general applicability. We demonstrate that, on a range of regression and classification problems, our approach can exploit input space symmetries such as translations and reflections. Notably, our approach achieves state-of-the-art results on CIFAR-10 among pure GP models.
  arXiv  Detail & Related papers  (2021-06-10T18:17:57Z)
• Bilinear Classes: A Structural Framework for Provable Generalization in RL [119.42509700822484]
  Bilinear Classes is a new structural framework which permits generalization in reinforcement learning. The framework incorporates nearly all existing models in which a sample complexity is achievable. Our main result provides an RL algorithm which has sample complexity for Bilinear Classes.
  arXiv  Detail & Related papers  (2021-03-19T16:34:20Z)

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.