Related papers: Solving oscillations problems through affine quant…
We study a simple-harmonic-oscillator quantum computer solving oracle decision problems. We show that such computers can perform better by using nonorthogonal Gaussian wave functions rather than orthogonal top-hat wave functions as input to…
In the context of studying periodic processes, this paper investigates first under which conditions switching affine systems in the plane generate stable limit cycles. Based on these conditions, a design methodology is proposed by which the…
The models we use, habitually, to describe quantum nonlinear optical processes have been remarkably successful yet, with few exceptions, they each contain a mathematical flaw. We present this flaw, show how it can be fixed and, in the…
A function f is said to possess superoscillations if, in a finite region, f oscillates faster than the shortest wavelength that occurs in the Fourier transform of f. I will discuss four aspects of superoscillations: 1. Superoscillations can…
Quantized Neural Networks (QNNs) use low bit-width fixed-point numbers for representing weight parameters and activations, and are often used in real-world applications due to their saving of computation resources and reproducibility of…
Combinatorial optimization problems have wide-ranging applications in industry and academia. Quantum computers may help solve them by sampling from carefully prepared Ansatz quantum circuits. However, current quantum computers are limited…
The Abbe's diffraction limit restricts the resolution of an optical imaging and lithography system. Coherent Rabi oscillation is shown to be able to overcome the diffraction limit in both optical and atom lithography. In previous studies,…
We describe some recent advances in the numerical solution of acoustic scattering problems. A major focus of the paper is the efficient solution of high frequency scattering problems via hybrid numerical-asymptotic boundary element methods.…
In this work we address the problem of the quantization of a simple harmonic oscillator that is perturbed by a time dependent force. The approach consists of removing the perturbation by a canonical change of coordinates. Since the…
We argue that to solve the foundational problems of quantum theory one has to first understand what it means to quantize a classical system. We then propose a quantization method based on replacement of deterministic c-numbers by…
Quantum advantage is notoriously hard to find and even harder to prove. For example the class of functions computable with classical physics actually exactly coincides with the class computable quantum-mechanically. It is strongly believed,…
In the context of optical signal processing, quantum and quantum-inspired machine learning algorithms have massive potential for deployment. One of the applications is in error correction protocols for the received noisy signals. In some…
Fuzzy Transform (F-transform) has been introduced as an approximation method which encompasses both classical transforms and approximation methods studied in fuzzy modeling and fuzzy control. It has been proved that, under some conditions,…
The Canonical Function Method (CFM) is a powerful method that solves the radial Schr\"{o}dinger equation for the eigenvalues directly without having to evaluate the eigenfunctions. It is applied to various quantum mechanical problems in…
One of the major benefits of quantum computing is the potential to resolve complex computational problems faster than can be done by classical methods. There are many prototype-based clustering methods in use today, and the selection of the…
In this paper, we review some features of quantum annealing and related topics from viewpoints of statistical physics, condensed matter physics, and computational physics. We can obtain a better solution of optimization problems in many…
Quantum annealing is a generic algorithm using quantum-mechanical fluctuations to search for the solution of an optimization problem. The present paper first reviews the fundamentals of quantum annealing and then reports on preliminary…
In this paper, we consider a quantum algorithm for solving the following problem: ``Suppose $f$ is a function given as a black box (that is also called an oracle) and $f$ is invariant under some AND-mask. Examine a property of $f$ by…
We examine various generalizations, e.g. exactly solvable, quasi-exactly solvable and non-Hermitian variants, of a quantum nonlinear oscillator. For all these cases, the same mass function has been used and it has also been shown that the…
A method to suppress noise, which is one of the major obstacles to obtain an optimal solution in quantum annealers, is proposed. We generalize the conventionally used Hamiltonian, i.e., the transverse field Hamiltonian, by introducing an…