Efficient quantum algorithm for weighted partial sums and numerical integration

• URL: http://arxiv.org/abs/2411.10986v1
• Date: Sun, 17 Nov 2024 07:03:32 GMT
• Title: Efficient quantum algorithm for weighted partial sums and numerical integration
• Authors: Alok Shukla, Prakash Vedula,
• Abstract summary: This paper presents a quantum algorithm for efficiently computing partial sums and specific weighted partial sums of quantum state amplitudes. The proposed quantum algorithm uses a custom unitary construction to achieve the desired partial sums with gate complexity and circuit depth. We also extend the algorithm to evaluate partial sums of even or odd components and more complex weighted sums over specified intervals.
• Score: 0.0
• License:
• Abstract: This paper presents a quantum algorithm for efficiently computing partial sums and specific weighted partial sums of quantum state amplitudes. Computation of partial sums has important applications, including numerical integration, cumulative probability distributions, and probabilistic modeling. The proposed quantum algorithm uses a custom unitary construction to achieve the desired partial sums with gate complexity and circuit depth of \(O(\log_2 M)\), where \(M\) represents the number of terms in the partial sum. For cases where \(M\) is a power of two, the unitary construction is straightforward; however, for arbitrary \(M\), we develop an efficient quantum algorithm to create the required unitary matrix. Computational examples for evaluation certain partial sums and numerical integration based on our proposed algorithm are provided. We also extend the algorithm to evaluate partial sums of even or odd components and more complex weighted sums over specified intervals.

Related papers

• Genuine Multipartite Entanglement in Quantum Optimization [0.3495246564946556]
  We show that multipartite entanglement provides an upper bound to the overlap of the instantaneous state with an exact solution. Our results help to shed light on how complex quantum correlations come to bear as a resource in quantum optimization.
  arXiv  Detail & Related papers  (2024-11-12T19:00:16Z)
• Quantum-Based Feature Selection for Multi-classification Problem in Complex Systems with Edge Computing [15.894122816099133]
  A quantum-based feature selection algorithm for the multi-classification problem, namely, QReliefF, is proposed. Our algorithm is superior in finding the nearest neighbor, reducing the complexity from O(M) to O(sqrt(M)).
  arXiv  Detail & Related papers  (2023-10-01T03:57:13Z)
• Multi-sequence alignment using the Quantum Approximate Optimization Algorithm [0.0]
  We present a Hamiltonian formulation and implementation of the Multiple Sequence Alignment problem with the variational Quantum Approximate Optimization Algorithm (QAOA) We consider a small instance of our QAOA-MSA algorithm in both a quantum simulator and its performance on an actual quantum computer. While the ideal solution to the instance of MSA investigated is shown to be the most probable state sampled for a shallow p5 quantum circuit, the level of noise in current devices is still a formidable challenge.
  arXiv  Detail & Related papers  (2023-08-23T12:46:24Z)
• Determining the ability for universal quantum computing: Testing controllability via dimensional expressivity [39.58317527488534]
  Controllability tests can be used in the design of quantum devices to reduce the number of external controls. We devise a hybrid quantum-classical algorithm based on a parametrized quantum circuit.
  arXiv  Detail & Related papers  (2023-08-01T15:33:41Z)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• End-to-end resource analysis for quantum interior point methods and portfolio optimization [63.4863637315163]
  We provide a complete quantum circuit-level description of the algorithm from problem input to problem output. We report the number of logical qubits and the quantity/depth of non-Clifford T-gates needed to run the algorithm.
  arXiv  Detail & Related papers  (2022-11-22T18:54:48Z)
• 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)
• Detailed Account of Complexity for Implementation of Some Gate-Based Quantum Algorithms [55.41644538483948]
  In particular, some steps of the implementation, as state preparation and readout processes, can surpass the complexity aspects of the algorithm itself. We present the complexity involved in the full implementation of quantum algorithms for solving linear systems of equations and linear system of differential equations.
  arXiv  Detail & Related papers  (2021-06-23T16:33:33Z)
• Quantum Amplitude Arithmetic [20.84884678978409]
  We propose the notion of quantum amplitude arithmetic (QAA) that intent to evolve the quantum state by performing arithmetic operations on amplitude. QAA is expected to find applications in a variety of quantum algorithms.
  arXiv  Detail & Related papers  (2020-12-21T00:17:18Z)
• Quantum Speedup of Monte Carlo Integration with respect to the Number of Dimensions and its Application to Finance [0.0]
  In Monte Carlo integration, many random numbers are used for calculation of the integrand. In this paper, we point out that we can reduce the number of such repeated operations by a combination of the nested QAE and the use of pseudorandom numbers. We pick up one use case of this method in finance, the credit portfolio risk measurement, and estimate to what extent the complexity is reduced.
  arXiv  Detail & Related papers  (2020-11-04T07:40: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.