Preconditioned Multivariate Quantum Solution Extraction

• URL: http://arxiv.org/abs/2601.05077v1
• Date: Thu, 08 Jan 2026 16:21:49 GMT
• Title: Preconditioned Multivariate Quantum Solution Extraction
• Authors: Gumaro Rendon, Stepan Smid,
• Abstract summary: Quantum computers can potentially provide high-degree speed-ups for solving PDEs.<n>Many algorithms simply end with preparing the quantum state encoding the solution in its amplitudes.<n>We present a technique for extracting a smooth positive function encoded in the amplitudes of a quantum state.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Numerically solving partial differential equations is a ubiquitous computational task with broad applications in many fields of science. Quantum computers can potentially provide high-degree polynomial speed-ups for solving PDEs, however many algorithms simply end with preparing the quantum state encoding the solution in its amplitudes. Trying to access explicit properties of the solution naively with quantum amplitude estimation can subsequently diminish the potential speed-up. In this work, we present a technique for extracting a smooth positive function encoded in the amplitudes of a quantum state, which achieves the Heisenberg limit scaling. We improve upon previous methods by allowing higher dimensional functions, by significantly reducing the quantum complexity with respect to the number of qubits encoding the function, and by removing the dependency on the minimum of the function using preconditioning. Our technique works by sampling the cumulative distribution of the given function, fitting it with Chebyshev polynomials, and subsequently extracting a representation of the whole encoded function. Finally, we trial our method by carrying out small scale numerical simulations.

Related papers

• Quantum Random Feature Method for Solving Partial Differential Equations [36.58357595906332]
  Quantum computing holds promise for scientific computing due to its potential for exponential speedups over classical methods.<n>In this work, we introduce a quantum random method (QRFM) that leverages advantages from both numerical analysis and neural analysis.
  arXiv  Detail & Related papers  (2025-10-09T08:42:09Z)
• Efficient quantum state tomography with Chebyshev polynomials [25.72183861471451]
  We introduce an approximate tomography method for pure quantum states encoding complex-valued functions.<n>By treating the truncation order of the Chebyshevs as a controllable parameter, the method provides a practical balance between efficiency and accuracy.
  arXiv  Detail & Related papers  (2025-09-02T09:09:23Z)
• Towards efficient quantum algorithms for diffusion probabilistic models [27.433686030846072]
  Diffusion model (DPM) is renowned for its ability to produce high-quality outputs in tasks such as image and audio generation.<n>We introduce efficient quantum algorithms for implementing DPMs through various quantum solvers.
  arXiv  Detail & Related papers  (2025-02-20T04:39:09Z)
• Sample-Efficient Estimation of Nonlinear Quantum State Functions [5.641998714611475]
  We introduce the quantum state function (QSF) framework by extending the SWAP test via linear combination of unitaries and parameterized quantum circuits.<n>Our framework enables the implementation of arbitrarily normalized degree-$n$ functions of quantum states with precision.<n>We apply QSF for developing quantum algorithms for fundamental tasks, including entropy, fidelity, and eigenvalue estimations.
  arXiv  Detail & Related papers  (2024-12-02T16:40:17Z)
• Calculating response functions of coupled oscillators using quantum phase estimation [40.31060267062305]
  We study the problem of estimating frequency response functions of systems of coupled, classical harmonic oscillators using a quantum computer.<n>Our proposed quantum algorithm operates in the standard $s-sparse, oracle-based query access model.<n>We show that a simple adaptation of our algorithm solves the random glued-trees problem in time.
  arXiv  Detail & Related papers  (2024-05-14T15:28:37Z)
• Quantum Realization of the Finite Element Method [0.0]
  This paper presents a quantum algorithm for the solution of second-order linear elliptic partial differential equations discretized by $d$-linear finite elements.<n>An essential step in the construction is a BPX preconditioner, which transforms the linear system into a sufficiently well-conditioned one.<n>We provide a constructive proof demonstrating that, for any fixed dimension, our quantum algorithm can compute suitable functionals of the solution to a given tolerance.
  arXiv  Detail & Related papers  (2024-03-28T15:44:20Z)
• Real-time error mitigation for variational optimization on quantum hardware [45.935798913942904]
  We define a Real Time Quantum Error Mitigation (RTQEM) algorithm to assist in fitting functions on quantum chips with VQCs. Our RTQEM routine can enhance VQCs' trainability by reducing the corruption of the loss function.
  arXiv  Detail & Related papers  (2023-11-09T19:00:01Z)
• Quantum Semidefinite Programming with Thermal Pure Quantum States [0.5639904484784125]
  We show that a quantization'' of the matrix multiplicative-weight algorithm can provide approximate solutions to SDPs quadratically faster than the best classical algorithms. We propose a modification of this quantum algorithm and show that a similar speedup can be obtained by replacing the Gibbs-state sampler with the preparation of thermal pure quantum (TPQ) states.
  arXiv  Detail & Related papers  (2023-10-11T18:00:53Z)
• Quantum Signal Processing, Phase Extraction, and Proportional Sampling [0.0]
  Quantum Signal Processing (QSP) is a technique that can be used to implement a transformation $P(x)$ applied to the eigenvalues of a unitary $U$. We show that QSP can be used to tackle a new problem, which we call phase extraction, and that this can be used to provide quantum speed-up for proportional sampling.
  arXiv  Detail & Related papers  (2023-03-20T13:05:29Z)
• Quantum-inspired optimization for wavelength assignment [51.55491037321065]
  We propose and develop a quantum-inspired algorithm for solving the wavelength assignment problem. Our results pave the way to the use of quantum-inspired algorithms for practical problems in telecommunications.
  arXiv  Detail & Related papers  (2022-11-01T07:52:47Z)
• 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)
• Extracting a function encoded in amplitudes of a quantum state by tensor network and orthogonal function expansion [0.0]
  We present a quantum circuit and its optimization procedure to obtain an approximating function of $f$ that has a number of degrees of freedom with respect to $d$. We also conducted a numerical experiment to approximate a finance-motivated function to demonstrate that our method works.
  arXiv  Detail & Related papers  (2022-08-31T04:10:24Z)
• Bosonic field digitization for quantum computers [62.997667081978825]
  We address the representation of lattice bosonic fields in a discretized field amplitude basis. We develop methods to predict error scaling and present efficient qubit implementation strategies.
  arXiv  Detail & Related papers  (2021-08-24T15:30:04Z)

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.