Related papers: Numerical matrix method for quantum periodic poten…
A simple criterion is derived in order that a number sequence ${\cal S}_n$ is a permitted spectrum of a quantized system. The sequence of the prime numbers fulfils the criterion and the corresponding one-dimensional quantum potential is…
We report a new analytical method for solution of a wide class of second-order differential equations with eigenvalues replaced by arbitrary functions. Such classes of problems occur frequently in Quantum Mechanics and Optics. This approach…
The inverse problem of recovery of a potential on a quantum tree graph from Weyl's matrix given at a number of points is considered. A method for its numerical solution is proposed. The overall approach is based on the leaf peeling method…
We offer an improved method for using a nuclear-magnetic-resonance quantum computer (NMRQC) to solve the Deutsch-Jozsa problem. Two known obstacles to the application of the NMRQC are exponential diminishment of density-matrix elements with…
Qualitative numerical planning is classical planning extended with non-negative real variables that can be increased or decreased "qualitatively", i.e., by positive indeterminate amounts. While deterministic planning with numerical…
This paper describes the application of the method of probabilistic solutions (MPS) to numerically solve the Dirichlet generalized and classical harmonic problems for irregular n sided pyramidal domains. Here, generalized means that the…
Quantum metrology plays a fundamental role in many scientific areas. However, the complexity of engineering entangled probes and the external noise raise technological barriers for realizing the expected precision of the to-be-estimated…
Quantum computers have the potential of solving certain problems exponentially faster than classical computers. Recently, Harrow, Hassidim and Lloyd proposed a quantum algorithm for solving linear systems of equations: given an $N\times{N}$…
In this paper, we give quantum algorithms for two fundamental computation problems: solving polynomial systems over finite fields and optimization where the arguments of the objective function and constraints take values from a finite field…
The Helmholtz equation is notoriously difficult to solve with standard numerical methods, increasingly so, in fact, at higher frequencies. Controllability methods instead transform the problem back to the time-domain, where they seek the…
The numerical solution of problems in nonlinear magnetostatics is typically based on a variational formulation in terms of magnetic potentials, the discretization by finite elements, and iterative solvers like the Newton method. The vector…
The numerical solution of large-scale Lyapunov matrix equations with symmetric banded data has so far received little attention in the rich literature on Lyapunov equations. We aim to contribute to this open problem by introducing two…
Recently the authors presented a matrix representation approach to real Appell polynomials essentially determined by a nilpotent matrix with natural number entries. It allows to consider a set of real Appell polynomials as solution of a…
This paper presents a novel framework for high-dimensional nonlinear quantum computation that exploits tensor products of amplified vector and matrix encodings to efficiently evaluate multivariate polynomials. The approach enables the…
In this paper, an inexact Newton method for solving real-valued nonlinear eigenvalue problems with eigenvector dependency (NEPv) is introduced that is able to solve the problem on a matrix level. Our main contribution is to derive a variant…
Besides the standard quantum version of the Coulomb/Kepler problem, an alternative quantum model with not too dissimilar phenomenological (i.e., spectral and scattering) as well as mathematical (i.e., exact-solvability) properties may be…
Quantum computation with quantum data that can traverse closed timelike curves represents a new physical model of computation. We argue that a model of quantum computation in the presence of closed timelike curves can be formulated which…
Supersymmetric quantum mechanics is well known to provide, together with the so-called shape invariance condition, an elegant method to solve the eigenvalue problem of some one-dimensional potentials by simple algebraic manipulations. In…
We present a quantum algorithm that analyzes time series data simulated by a quantum differential equation solver. The proposed algorithm is a quantum version of the dynamic mode decomposition algorithm used in diverse fields such as fluid…
Quantum computing (QC) has gained popularity due to its unique capabilities that are quite different from that of classical computers in terms of speed and methods of operations. This paper proposes hybrid models and methods that…