Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Scientific Reports

A general quantum algorithm for numerical integration

Guoqiang Shu, Zheng Shan, Jinchen Xu, Jie Zhao, Shuya Wang

Published May 7, 2024• 7 citations
Publisher

Abstract

Quantum algorithms have shown their superiority in many application fields. However, a general quantum algorithm for numerical integration, an indispensable tool for processing sophisticated science and engineering issues, is still missing. Here, we first proposed a quantum integration algorithm suitable for any continuous functions that can be approximated by polynomials. More impressively, the algorithm achieves quantum encoding of any integrable functions through polynomial approximation, then constructs a quantum oracle to mark the number of points in the integration area and finally converts the statistical results into the phase angle in the amplitude of the superposition state. The quantum algorithm introduced in this work exhibits quadratic acceleration over the classical integration algorithms by reducing computational complexity from O(N) to O(√N). Our work addresses the crucial impediments for improving the generality of quantum integration algorithm, which provides a meaningful guidance for expanding the superiority of quantum computing.

DOI
10.1038/s41598-024-61010-9

Related papers

Quantum Algorithms for Continuous Problems and Their Applications

Anargyros Papageorgiou, Joseph F. Traub

This chapter summarizes the model of computation that is used for classical algorithms solving continuous problems. It talks about the quantum model of computation. In the study of the classical complexity of continuous problems, the real number model with oracles is often used. The information operations are represented as black-box or oracle calls. This model of computation is an abstraction of fixed precision floating point arithmetic used in science and engineering. It has also been used in the study of the complexity of algebraic problems such as matrix multiplication. Inputs to quantum algorithms are often given using quantum queries. Classical algorithms for integration have been extensively studied in the literature and optimal algorithms are known for numerous classes of functions. Quantum algorithms for integration have been used to derive optimal quantum algorithms for other continuous problems, such as path integration, certain approximation problems, and the solution of ordinary differential equations.

Advances in chemical physics•Feb 14, 2014•6 citations

基于量子算法的非标准积分的优化

Jincheng Zhang

This paper explores the potential of quantum algorithms to revolutionize the computation of non-standard integrals, offering a pathway towards significantly enhanced computational efficiency and precise solution of complex functions. Traditional methods often struggle with the computational demands of integrating functions, particularly those exhibiting non-linearity or intricate shapes. We investigate the application of quantum algorithms, specifically Quantum Approximate Optimization Algorithm (QAOA), to optimize numerical integration procedures. The core mechanism focuses on leveraging QAOA's ability to search for optimal solutions within a defined parameter space, thereby reducing computational bottlenecks and improving accuracy in handling complex integration challenges. This research aims to demonstrate the feasibility and advantages of quantum computation in accelerating and refining the calculation of non-standard integrals, contributing to advancements in various scientific and engineering fields.

•Sep 5, 2026•0 citations

Quantum algorithm for polynomial multiplication and its applications

Shang Bing Gao, Rui‐Chen Huang, Bing‐Xin Liu +6 more

Polynomial multiplication is a fundamental operation in various fields of science and engineering. This paper proposes a quantum algorithm for polynomial multiplication that achieves improved efficiency over classical approaches. The core innovation is the use of a quantum Fourier transform with digital encoding. The practical utility and versatility of this algorithm are highlighted through its application to several related computational problems, including string matching, Toeplitz matrix-vector multiplication, and matrix decomposition algorithm. Furthermore, an enhanced version of the quantum polynomial multiplication algorithm is introduced, offering improvements in both execution process and time complexity.

EPJ Quantum Technology•Oct 15, 2025•0 citations

Fast quantum algorithms for numerical integrals and stochastic processes

Abrams, Daniel S., Colin P. Williams

We discuss quantum algorithms that calculate numerical integrals and descriptive statistics of stochastic processes. With either of two distinct approaches, one obtains an exponential speed increase in comparison to the fastest known classical deterministic algorithms and a quadratic speed increase in comparison to classical Monte Carlo (probabilistic) methods. We derive a simpler and slightly faster version of Grover's mean algorithm, demonstrate how to apply quantum counting to the problem, develop some variations of these algorithms, and show how both (apparently quite different) approaches can be understood from the same unified framework. Finally, we discuss how the exponential speed increase appears to (but does not) violate results obtained via the method of polynomials, from which it is known that a bounded-error quantum algorithm for computing a total function can be only polynomially more efficient than the fastest deterministic classical algorithm.

arXiv:quant-ph/9908083•Aug 28, 1999•84 citations

From Block-encoding to Generalized Quantum Signal Processing: Principles, Algorithms and Applications

Tal Gurfinkel, Kaushika De Silva, Anuradha Mahasinghe +9 more

Modern quantum algorithms are increasingly formulated as coherent procedures for implementing polynomial transformations of operators and singular values. This perspective provides a powerful and unifying language for quantum algorithm design, connecting a wide range of distinct problems through five closely related key tools: block-encoding, qubitization, QSP, QSVT and GQSP. Block-encoding embeds non-unitary matrices into larger unitaries; qubitization converts block-encodings into structured operators; QSP, QSVT and GQSP enable polynomial transformations with near-optimal query complexity. Together, these techniques form a general toolkit for transforming matrix functions into implementable quantum circuits. This paper develops these techniques from first principles as a unified framework for constructing quantum algorithms. We apply this framework to representative applications to highlight design principles and demonstrate how distinct algorithms can be constructed from a unified sequence of operator transformations. A central contribution is a systematic decision workflow for selecting the appropriate approach according to the operator structure and the desired transformation polynomial. This perspective clarifies when direct GQSP or through qubitization, or Laurent expansion, or QSVT is most appropriate. We organize algorithmic design into an end-to-end pipeline: identifying the target matrix function, constructing an appropriate block-encoding, determining the relevant spectral domain, designing a polynomial or Laurent-polynomial approximation, synthesizing the phase factors, and translating the transformation into an executable quantum circuit. By applying this unified framework to example applications, we showcase a practical methodology for reasoning, designing, and implementing quantum algorithms based on polynomial transformations.

quant-pharXiv:2609.09977•Sep 10, 2026•0 citations

Efficient quantum amplitude encoding of polynomial functions

Javier Gonzalez-Conde, Thomas W. Watts, Pablo Rodriguez-Grasa +1 more

Loading functions into quantum computers represents an essential step in several quantum algorithms, such as quantum partial differential equation solvers. Therefore, the inefficiency of this process leads to a major bottleneck for the application of these algorithms. Here, we present and compare two efficient methods for the amplitude encoding of real polynomial functions on n qubits. This case holds special relevance, as any continuous function on a closed interval can be uniformly approximated with arbitrary precision by a polynomial function. The first approach relies on the matrix product state representation (MPS). We study and benchmark the approximations of the target state when the bond dimension is assumed to be small. The second algorithm combines two subroutines. Initially we encode the linear function into the quantum registers either via its MPS or with a shallow sequence of multi-controlled gates that loads the linear function's Hadamard-Walsh series, and we explore how truncating the Hadamard-Walsh series of the linear function affects the final fidelity. Applying the inverse discrete Hadamard-Walsh transform converts the state encoding the series coefficients into an amplitude encoding of the linear function. Thus, we use this construction as a building block to achieve an exact block encoding of the amplitudes corresponding to the linear function on k0 qubits and apply the quantum singular value transformation that implements a polynomial transformation to the block encoding of the amplitudes. This unitary together with the Amplitude Amplification algorithm will enable us to prepare the quantum state that encodes the polynomial function on k0 qubits. Finally we pad n−k0 qubits to generate an approximated encoding of the polynomial on n qubits, analyzing the error depending on k0 . In this regard, our methodology proposes a method to improve the state-of-the-art complexity by introducing controllable errors.

arXiv:2307.10917•Quantum•Mar 21, 2024•55 citations
Quantum algorithms have shown their superiority in many application fields. However, a general quantum algorithm for numerical integration, an indispensable tool for processing sophisticated science and engineering issues, is still missing. Here, we first proposed a quantum integration algorithm suitable for any continuous functions that can be approximated by polynomials. More impressively, the algorithm achieves quantum encoding of any integrable functions through polynomial approximation, then constructs a quantum oracle to mark the number of points in the integration area and finally converts the statistical results into the phase angle in the amplitude of the superposition state. The quantum algorithm introduced in this work exhibits quadratic acceleration over the classical integration algorithms by reducing computational complexity from O(N) to O(√N). Our work addresses the crucial impediments for improving the generality of quantum integration algorithm, which provides a meaningful guidance for expanding the superiority of quantum computing.
This chapter summarizes the model of computation that is used for classical algorithms solving continuous problems. It talks about the quantum model of computation. In the study of the classical complexity of continuous problems, the real number model with oracles is often used. The information operations are represented as black-box or oracle calls. This model of computation is an abstraction of fixed precision floating point arithmetic used in science and engineering. It has also been used in the study of the complexity of algebraic problems such as matrix multiplication. Inputs to quantum algorithms are often given using quantum queries. Classical algorithms for integration have been extensively studied in the literature and optimal algorithms are known for numerous classes of functions. Quantum algorithms for integration have been used to derive optimal quantum algorithms for other continuous problems, such as path integration, certain approximation problems, and the solution of ordinary differential equations.
This paper explores the potential of quantum algorithms to revolutionize the computation of non-standard integrals, offering a pathway towards significantly enhanced computational efficiency and precise solution of complex functions. Traditional methods often struggle with the computational demands of integrating functions, particularly those exhibiting non-linearity or intricate shapes. We investigate the application of quantum algorithms, specifically Quantum Approximate Optimization Algorithm (QAOA), to optimize numerical integration procedures. The core mechanism focuses on leveraging QAOA's ability to search for optimal solutions within a defined parameter space, thereby reducing computational bottlenecks and improving accuracy in handling complex integration challenges. This research aims to demonstrate the feasibility and advantages of quantum computation in accelerating and refining the calculation of non-standard integrals, contributing to advancements in various scientific and engineering fields.
Polynomial multiplication is a fundamental operation in various fields of science and engineering. This paper proposes a quantum algorithm for polynomial multiplication that achieves improved efficiency over classical approaches. The core innovation is the use of a quantum Fourier transform with digital encoding. The practical utility and versatility of this algorithm are highlighted through its application to several related computational problems, including string matching, Toeplitz matrix-vector multiplication, and matrix decomposition algorithm. Furthermore, an enhanced version of the quantum polynomial multiplication algorithm is introduced, offering improvements in both execution process and time complexity.
We discuss quantum algorithms that calculate numerical integrals and descriptive statistics of stochastic processes. With either of two distinct approaches, one obtains an exponential speed increase in comparison to the fastest known classical deterministic algorithms and a quadratic speed increase in comparison to classical Monte Carlo (probabilistic) methods. We derive a simpler and slightly faster version of Grover's mean algorithm, demonstrate how to apply quantum counting to the problem, develop some variations of these algorithms, and show how both (apparently quite different) approaches can be understood from the same unified framework. Finally, we discuss how the exponential speed increase appears to (but does not) violate results obtained via the method of polynomials, from which it is known that a bounded-error quantum algorithm for computing a total function can be only polynomially more efficient than the fastest deterministic classical algorithm.
Modern quantum algorithms are increasingly formulated as coherent procedures for implementing polynomial transformations of operators and singular values. This perspective provides a powerful and unifying language for quantum algorithm design, connecting a wide range of distinct problems through five closely related key tools: block-encoding, qubitization, QSP, QSVT and GQSP. Block-encoding embeds non-unitary matrices into larger unitaries; qubitization converts block-encodings into structured operators; QSP, QSVT and GQSP enable polynomial transformations with near-optimal query complexity. Together, these techniques form a general toolkit for transforming matrix functions into implementable quantum circuits. This paper develops these techniques from first principles as a unified framework for constructing quantum algorithms. We apply this framework to representative applications to highlight design principles and demonstrate how distinct algorithms can be constructed from a unified sequence of operator transformations. A central contribution is a systematic decision workflow for selecting the appropriate approach according to the operator structure and the desired transformation polynomial. This perspective clarifies when direct GQSP or through qubitization, or Laurent expansion, or QSVT is most appropriate. We organize algorithmic design into an end-to-end pipeline: identifying the target matrix function, constructing an appropriate block-encoding, determining the relevant spectral domain, designing a polynomial or Laurent-polynomial approximation, synthesizing the phase factors, and translating the transformation into an executable quantum circuit. By applying this unified framework to example applications, we showcase a practical methodology for reasoning, designing, and implementing quantum algorithms based on polynomial transformations.
Loading functions into quantum computers represents an essential step in several quantum algorithms, such as quantum partial differential equation solvers. Therefore, the inefficiency of this process leads to a major bottleneck for the application of these algorithms. Here, we present and compare two efficient methods for the amplitude encoding of real polynomial functions on n qubits. This case holds special relevance, as any continuous function on a closed interval can be uniformly approximated with arbitrary precision by a polynomial function. The first approach relies on the matrix product state representation (MPS). We study and benchmark the approximations of the target state when the bond dimension is assumed to be small. The second algorithm combines two subroutines. Initially we encode the linear function into the quantum registers either via its MPS or with a shallow sequence of multi-controlled gates that loads the linear function's Hadamard-Walsh series, and we explore how truncating the Hadamard-Walsh series of the linear function affects the final fidelity. Applying the inverse discrete Hadamard-Walsh transform converts the state encoding the series coefficients into an amplitude encoding of the linear function. Thus, we use this construction as a building block to achieve an exact block encoding of the amplitudes corresponding to the linear function on k0 qubits and apply the quantum singular value transformation that implements a polynomial transformation to the block encoding of the amplitudes. This unitary together with the Amplitude Amplification algorithm will enable us to prepare the quantum state that encodes the polynomial function on k0 qubits. Finally we pad n−k0 qubits to generate an approximated encoding of the polynomial on n qubits, analyzing the error depending on k0 . In this regard, our methodology proposes a method to improve the state-of-the-art complexity by introducing controllable errors.