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), with wk≥0, ∑kwk=1, and 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 f -- amplitude estimation yields S to additive error ε with O(ε−1log(1/γ)) oracle uses and polylog(N) gates per use; all bounds are full gate complexities, and the saving over classical sampling is quadratic in 1/ε. Applying this to the Riemann--Siegel formula, we prove that ζ(σ+it) in the critical strip can be estimated to accuracy δ with O(t(1−σ)/2δ−1) gates, hence O(t1/4δ−1) on the critical line, where O suppresses factors polylogarithmic in t/δ. At fixed accuracy this improves on the t1/2 Riemann--Siegel cost and on the best rigorous classical algorithm's t4/13+o(1); the quantum algorithm is advantageous precisely when δ≫t−3/52, which covers the accuracy needed to locate and count zeros. We show that a polylog(t) algorithm does not follow from these techniques -- undoing the normalization costs the ℓ1 mass ∑k≤Nk−σ=Θ(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∣ 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.