Related papers: Alternative Numerical Techniques
Digital Transforms have important applications on subjects such as channel coding, cryptography and digital signal processing. In this paper, two Fourier Transforms are considered, the discrete time Fourier transform (DTFT) and the finite…
With the race to build large-scale quantum computers and efforts to exploit quantum algorithms for efficient problem solving in science and engineering disciplines, the requirement to have efficient and scalable verification methods are of…
We investigate two possible techniques to authenticate the q-digest data structure, along with a worst-case study of the computational complexity both in time and space of the proposed solutions, and considerations on the feasibility of the…
Revisiting the old problem of existence of interacting models of QFT with new conceptual ideas and mathematical tools, one arrives at a novel view about the nature of QFT. The recent success of algebraic methods in establishing the…
We present five examples where quantum finite automata (QFAs) outperform their classical counterparts. This may be useful as a relatively simple technique to introduce quantum computation concepts to computer scientists. We also describe a…
Here, we report briefly two topics: 1) The latest version of ``Analytic Perturbation Theory" (APT) devised recently for the QCD observables both in the Euclidean and Minkowskian regions. 2) Results of the APT--based calculation for some…
Today's quantum field theory (QFT) relies heavenly on canonical quantization (CQ), which fails for $\varphi^4_4$ leading only to a "free" result. Affine quantization (AQ), an alternative quantization procedure, leads to a "non-free" result…
We present a hybrid numerical-quantum method for solving the Poisson equation under homogeneous Dirichlet boundary conditions, leveraging the Quantum Fourier Transform (QFT) to enhance computational efficiency and reduce time and space…
We set new speed records for multiplying long polynomials over finite fields of characteristic two. Our multiplication algorithm is based on an additive FFT (Fast Fourier Transform) by Lin, Chung, and Huang in 2014 comparing to previously…
The paper improves the accuracy of the one-dimensional fractional Fourier transform (FRFT) by leveraging closed Newton-Cotes quadrature rules. Using the weights derived from the Composite Newton-Cotes rules of order QN, we demonstrate that…
The Arithmetic Fourier Transform is a numerical formulation for computing Fourier series and Taylor series coefficients. It competes with the Fast Fourier Transform in terms of speed and efficiency, requiring only addition operations and…
Two methods to reduce the CPU time needed for the numerical evaluation of cross-sections and similar quantities are discussed.
In this paper, we revisit the diffusive representations of fractional integrals established in \cite{diethelm2023diffusive} to explore novel variants of such representations which provide highly efficient numerical algorithms for the…
We introduce four q-analogs of the double Laplace transform and prove some of their main properties. Next we show how they can be used to solve some q-functional equations and partial q-differential equations.
We present a general methodology to obtain the basis of qudits which are admissible to Quantum Fourier Transform (QFT). We first study this method for qubits to characterize the ensemble that works for the Hadamard transformation (QFT for…
It has previously been established that the logarithmic-depth approximate quantum Fourier transform (AQFT) provides a suitable replacement for the regular QFT in many quantum algorithms. Since the AQFT is less accurate by definition,…
We present a brief overview of fractional analytic QCD, basically following the results recently obtained in Refs. [1,2].
Some explanations and implications of the underlying theory approach for quantum theories (QM or QFT) are discussed and suggested. This simple idea seems to have significantly nontrivial effects for our understanding of the quantum…
In this paper we shall evaluate two alternating sums of binomial coefficients by a combinatorial argument. Moreover, by combining the same combinatorial idea with partition theoretic techniques, we provide $q$-analogues involving the…
There are essentially two different approaches to the axiomatization of quantum field theory (QFT): algebraic QFT, going back to Haag and Kastler, and functorial QFT, going back to Atiyah and Segal. More recently, based on ideas by Baez and…