相关论文: Alternative Numerical Techniques
The quantum Fourier transform (QFT) brings efficiency in many respects, especially usage of resource, for most operations on quantum computers. In this study, the existing QFT-based and non-QFT-based quantum arithmetic operations are…
The Quantum Fourier Transform (QFT) is a fundamental component of many quantum computing algorithms. In this paper, we present an alternative method for factoring this transformation. Inspired by this approach, we introduce a new quantum…
A review of the Hodge and Hopf-algebraic approach to QFT.
This paper proposes a class of power-of-two FFT (Fast Fourier Transform) algorithms, called AM-QFT algorithms, that contains the improved QFT (Quick Fourier Transform), an algorithm recently published, as a special case. The main idea is to…
Recent developments in the evaluation of two-loop pseudo-observables and observables are briefly reviewed.
The Fast Fourier Transform is extended to functions on finite graphs whose edges are identified with intervals of finite length. Spectral and pseudospectral methods are developed to solve a wide variety of time dependent partial…
The classical quadratic formula and some of its lesser known variants for solving the quadratic equation are reviewed. Then, a new formula for the roots of a quadratic polynomial is presented.
In this thesis we investigate two new Amplified Quantum Transforms. In particular we create and analyze the Amplified Quantum Fourier Transform (Amplified-QFT) and the Amplified-Haar Wavelet Transform. First, we provide a brief history of…
Quantum Fourier Transform (QFT) plays a principal role in the development of efficient quantum algorithms. Since the number of quantum bits that can currently built is limited, while many quantum technologies are inherently three- (or more)…
In this study, we propose an efficient quantum multiplication approach based on a QFT-assisted parallelized addition scheme. The multiplication stage is implemented using a structure composed entirely of Toffoli gates, which generate…
An earlier paper gave a means of calculating the Lamb shift via Feynman diagrams. Here we apply the same techniques to TQFT.
We review QFT from the algebraic structure of its perturbative expansion and point out three new results.
Work in progress concerning alternative formalizations of arithmetic.
Alternative approaches to Lebesgue integration are considered.
In this paper we give a streamlined overview of some of the recent constructions provided with K.-H. Neeb, G. \'Olafsson and collaborators for a new geometric approach to Algebraic Quantum Field Theory (AQFT). Motivations, fundamental…
We introduce a new numerical method for the computation of the inverse nonlinear Fourier transform and compare its computational complexity and accuracy to those of other methods available in the literature. For a given accuracy, the…
We present a brief overview of fractional analytic QCD.
We outline two alternative schemes to perform numerical calculations in quantum field theory. In principle, both of these approaches are better suited to study phase structure than conventional Monte Carlo. The first method, Source…
We discuss the advantages of using the approximate quantum Fourier transform (AQFT) in algorithms which involve periodicity estimations. We analyse quantum networks performing AQFT in the presence of decoherence and show that extensive…
The inverse problem of Kohn-Sham density functional theory (DFT) is often solved in an effort to benchmark and design approximate exchange-correlation potentials. The forward and inverse problems of DFT rely on the same equations but the…