相关论文: Construction of an algorithm in parallel for the F…

Detailed detector simulation and reconstruction of physics objects at the LHC are very CPU intensive and hence time consuming due to the high energy and multiplicity of the Monte-Carlo events and the complexity of the detectors. We present…

In many applications data are measured or defined on a spherical manifold; spherical harmonic transforms are then required to access the frequency content of the data. We derive algorithms to perform forward and inverse spin spherical…

Fourier representations play a central role in operator learning methods for partial differential equations and are increasingly being explored in quantum machine learning architectures. The classical fast Fourier transform (FFT),…

This paper considers a convolutional neural network transformation that reduces computation complexity and thus speedups neural network processing. Usage of convolutional neural networks (CNN) is the standard approach to image recognition…

We demonstrate a method of creating photonic two-dimensional cluster states that is considerably more efficient than previously proposed approaches. Our method uses only local unitaries and type-I fusion operations. The increased efficiency…

The ability to implement the Quantum Fourier Transform (QFT) efficiently on a quantum computer facilitates the advantages offered by a variety of fundamental quantum algorithms, such as those for integer factoring, computing discrete…

In this study, we present a technique based on the quantum Fourier transform (QFT) that allows the generation of disjoint sets of entangled particles, in such a way that particles of the same set are entangled with each other, while…

Quantum computers have attracted much attention in recent years. This is because the development of the actual quantum machine is accelerating. Research on how to use quantum computers is active in the fields such as quantum chemistry and…

Image processing is a fascinating field for exploring quantum algorithms. However, achieving quantum speedups turns out to be a significant challenge. In this work, we focus on image filtering to identify a class of images that can achieve…

We propose a numerical interferometry method for identification of optical multiply-scattering systems when only intensity can be measured. Our method simplifies the calibration of optical transmission matrices from a quadratic to a linear…

Various applications such as MRI, solution of PDEs, etc. need to perform an inverse nonequispaced fast Fourier transform (NFFT), i. e., compute $M$ Fourier coefficients from given $N$ nonequispaced data. In the present paper we consider…

We introduce a Fourier-based fast algorithm for Gaussian process regression in low dimensions. It approximates a translationally-invariant covariance kernel by complex exponentials on an equispaced Cartesian frequency grid of $M$ nodes.…

Optical networks implementing single-qudit quantum computation gates may exhibit superior properties to those for qubits as each of the optical elements in the network can work in parallel on many optical modes simultaneously. We present an…

Polynomial multiplication is a key algorithm underlying computer algebra systems (CAS) and its efficient implementation is crucial for the performance of CAS. In this paper we design and implement algorithms for polynomial multiplication…

We present efficient methods to interpolate data with a quantum computer that complement uploading techniques and quantum post-processing. The quantum algorithms are supported by the efficient Quantum Fourier Transform (QFT) and classical…

Scalar diffraction calculations such as the angular spectrum method (ASM) and Fresnel diffraction, are widely used in the research fields of optics, X-rays, electron beams, and ultrasonics. It is possible to accelerate the calculation using…

Computationally efficient numerical methods for high-order approximations of convolution integrals involving weakly singular kernels find many practical applications including those in the development of fast quadrature methods for…

Computed Tomographic Imaging Spectrometers (CTIS) capture hyperspectral images in realtime. However, post processing the imagery can require enormous computational resources; thus, limiting its application to non-realtime scenarios. To…

Optical computing harnesses the speed of light to perform vector-matrix operations efficiently. It leverages interference, a cornerstone of quantum computing algorithms, to enable parallel computations. In this work, we interweave quantum…

We present a parallel algorithm for the fast Fourier transform (FFT) in higher dimensions. This algorithm generalizes the cyclic-to-cyclic one-dimensional parallel algorithm to a cyclic-to-cyclic multidimensional parallel algorithm while…