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

Quantum Algorithms For Iterations Of Fractal Type Functions with Exponential Sums

Q. Ten

Published Sep 22, 2026• 0 citations
Publisher

Abstract

Quantum Algorithms are given for iterations of fractal type functions with exponential sums
DOI
10.5281/zenodo.22884002

Related papers

High-Performance Fractal Quantum Algorithms for Computation and Cryptography

Stergios Pellis

•Jan 1, 2026•9 citations

Iterative blip-summed path integral for quantum dynamics in strongly dissipative environments

Nancy Makri

The iterative decomposition of the blip-summed path integral [N. Makri, J. Chem. Phys. 141, 134117 (2014)] is described. The starting point is the expression of the reduced density matrix for a quantum system interacting with a harmonic dissipative bath in the form of a forward-backward path sum, where the effects of the bath enter through the Feynman-Vernon influence functional. The path sum is evaluated iteratively in time by propagating an array that stores blip configurations within the memory interval. Convergence with respect to the number of blips and the memory length yields numerically exact results which are free of statistical error. In situations of strongly dissipative, sluggish baths, the algorithm leads to a dramatic reduction of computational effort in comparison with iterative path integral methods that do not implement the blip decomposition. This gain in efficiency arises from (i) the rapid convergence of the blip series and (ii) circumventing the explicit enumeration of between-blip path segments, whose number grows exponentially with the memory length. Application to an asymmetric dissipative two-level system illustrates the rapid convergence of the algorithm even when the bath memory is extremely long.

The Journal of Chemical Physics•Apr 3, 2017•50 citations

Quantum algorithms for exponential sums and the evaluation of the Riemann zeta function

Sandeep Tyagi

We give quantum algorithms for estimating weighted exponential sums $S(f,w,N)= \sum_{k=0}^{N-1} w_k e^{2 πi f(k)}$, with $w_k \ge 0$, $\sum_k w_k =1$, and $N=2^{n}$ exponentially large. Under two explicit oracle assumptions -- efficiently computable prefix sums for the weights, enabling Grover--Rudolph state preparation, and a fixed-point circuit for $f$ -- amplitude estimation yields $S$ to additive error $\varepsilon$ with $O(\varepsilon^{-1}\log(1/γ))$ oracle uses and $\operatorname{polylog}(N)$ gates per use; all bounds are full gate complexities, and the saving over classical sampling is quadratic in $1/\varepsilon$. Applying this to the Riemann--Siegel formula, we prove that $ζ(σ+it)$ in the critical strip can be estimated to accuracy $δ$ with $\widetilde O(t^{(1-σ)/2}\, δ^{-1})$ gates, hence $\widetilde O(t^{1/4}\, δ^{-1})$ on the critical line, where $\widetilde O$ suppresses factors polylogarithmic in $t/δ$. At fixed accuracy this improves on the $t^{1/2}$ Riemann--Siegel cost and on the best rigorous classical algorithm's $t^{4/13+o(1)}$; the quantum algorithm is advantageous precisely when $δ\gg t^{-3/52}$, which covers the accuracy needed to locate and count zeros. We show that a $\operatorname{polylog}(t)$ algorithm does not follow from these techniques -- undoing the normalization costs the $\ell^{1}$ mass $\sum_{k\le N} k^{-σ} = Θ(t^{(1-σ)/2})$ of the main sum -- and that Hiary-type block decompositions cannot improve the quantum query complexity. We also give an estimator for the magnitude of the amplitude sum $\lvert \sum_k a_k \rvert$ of any efficiently preparable state, and review the required amplitude- and phase-estimation subroutines.

arXiv:2002.11094•Feb 25, 2020•0 citations

ON 3-VARIABLE EXPONENTIAL POLYNOMIALS AND QUANTUM ALGORITHMS

Yasuo Ohno, Yoshitaka Sasaki, Chika Yamazaki

•Jul 16, 2012•0 citations

Quantum-Enhanced Fractal Iteration (Qefi)

Jincheng Zhang

Quantum-Enhanced Fractal Iteration (Qefi) proposes a novel method for generating self-similar fractal geometries through the application of quantum entanglement. The core mechanism involves establishing a 'seed' fractal pattern and leveraging entanglement to iteratively refine and explore complex geometries, potentially achieving unprecedented precision and generating highly structured patterns. This approach offers a departure from conventional fractal algorithms, capitalizing on the unique properties of quantum mechanics to unlock new levels of geometric complexity and self-similarity.

•Sep 3, 2026•0 citations

Fractals in quantum theory: Analytical and numerical approaches

P. K. Silaev, Eugene Tyurin, Олег Антонинович Хрусталев

Theoretical and Mathematical Physics•Oct 1, 1991•1 citation
The iterative decomposition of the blip-summed path integral [N. Makri, J. Chem. Phys. 141, 134117 (2014)] is described. The starting point is the expression of the reduced density matrix for a quantum system interacting with a harmonic dissipative bath in the form of a forward-backward path sum, where the effects of the bath enter through the Feynman-Vernon influence functional. The path sum is evaluated iteratively in time by propagating an array that stores blip configurations within the memory interval. Convergence with respect to the number of blips and the memory length yields numerically exact results which are free of statistical error. In situations of strongly dissipative, sluggish baths, the algorithm leads to a dramatic reduction of computational effort in comparison with iterative path integral methods that do not implement the blip decomposition. This gain in efficiency arises from (i) the rapid convergence of the blip series and (ii) circumventing the explicit enumeration of between-blip path segments, whose number grows exponentially with the memory length. Application to an asymmetric dissipative two-level system illustrates the rapid convergence of the algorithm even when the bath memory is extremely long.
We give quantum algorithms for estimating weighted exponential sums S(f,w,N)=∑k=0N−1wke2πif(k)S(f,w,N)= \sum_{k=0}^{N-1} w_k e^{2 πi f(k)}S(f,w,N)=∑k=0N−1​wk​e2πif(k), with wk≥0w_k \ge 0wk​≥0, ∑kwk=1\sum_k w_k =1∑k​wk​=1, and N=2nN=2^{n}N=2n exponentially large. Under two explicit oracle assumptions -- efficiently computable prefix sums for the weights, enabling Grover--Rudolph state preparation, and a fixed-point circuit for fff -- amplitude estimation yields SSS to additive error ε\varepsilonε with O(ε−1log⁡(1/γ))O(\varepsilon^{-1}\log(1/γ))O(ε−1log(1/γ)) oracle uses and polylog⁡(N)\operatorname{polylog}(N)polylog(N) gates per use; all bounds are full gate complexities, and the saving over classical sampling is quadratic in 1/ε1/\varepsilon1/ε. Applying this to the Riemann--Siegel formula, we prove that ζ(σ+it)ζ(σ+it)ζ(σ+it) in the critical strip can be estimated to accuracy δδδ with O~(t(1−σ)/2 δ−1)\widetilde O(t^{(1-σ)/2}\, δ^{-1})O(t(1−σ)/2δ−1) gates, hence O~(t1/4 δ−1)\widetilde O(t^{1/4}\, δ^{-1})O(t1/4δ−1) on the critical line, where O~\widetilde OO suppresses factors polylogarithmic in t/δt/δt/δ. At fixed accuracy this improves on the t1/2t^{1/2}t1/2 Riemann--Siegel cost and on the best rigorous classical algorithm's t4/13+o(1)t^{4/13+o(1)}t4/13+o(1); the quantum algorithm is advantageous precisely when δ≫t−3/52δ\gg t^{-3/52}δ≫t−3/52, which covers the accuracy needed to locate and count zeros. We show that a polylog⁡(t)\operatorname{polylog}(t)polylog(t) algorithm does not follow from these techniques -- undoing the normalization costs the ℓ1\ell^{1}ℓ1 mass ∑k≤Nk−σ=Θ(t(1−σ)/2)\sum_{k\le N} k^{-σ} = Θ(t^{(1-σ)/2})∑k≤N​k−σ=Θ(t(1−σ)/2) of the main sum -- and that Hiary-type block decompositions cannot improve the quantum query complexity. We also give an estimator for the magnitude of the amplitude sum ∣∑kak∣\lvert \sum_k a_k \rvert∣∑k​ak​∣ of any efficiently preparable state, and review the required amplitude- and phase-estimation subroutines.
Quantum-Enhanced Fractal Iteration (Qefi) proposes a novel method for generating self-similar fractal geometries through the application of quantum entanglement. The core mechanism involves establishing a 'seed' fractal pattern and leveraging entanglement to iteratively refine and explore complex geometries, potentially achieving unprecedented precision and generating highly structured patterns. This approach offers a departure from conventional fractal algorithms, capitalizing on the unique properties of quantum mechanics to unlock new levels of geometric complexity and self-similarity.