Related papers: Generating Function in Quantum Mechanics: An Appli…
An important question arising from the Frobenius Coin Problem is to decide whether or not a given monetary sum S can be obtained from N coin denominations. We develop a new Generating Function G(x), where the coefficient of x^i is equal to…
In this paper we provide a general account of the causal models which attempt to provide a solution to the famous measurement problem of Quantum Mechanics (QM). We will argue that --leaving aside instrumentalism which restricts the physical…
Quantum annealing is a new method for finding extrema of multidimensional functions. Based on an extension of classical, simulated annealing, this approach appears robust with respect to avoiding local minima. Further, unlike some of its…
The powers of generating functions and its properties are analyzed. A new class of functions is introduced, based on the application of compositions of an integer $n$, called composita. The methods for obtaining reciprocal and reverse…
We introduce a novel, systematic method for the complete symbolic reduction of multi-loop Feynman integrals, leveraging the power of generating functions. The differential equations governing these generating functions naturally yield…
A formulation of quantum mechanics, which begins by postulating assertions for individual physical systems, is given. The statistical predictions of quantum mechanics for infinite ensembles are then derived from its assertions for…
Various approaches of defining and determining work performed on a quantum system are compared. Any operational definition of work, however, must allow for two facts, first, that work characterizes a process rather than an instantaneous…
We propose a new phenomenological model for quantum gravity. This is based on a new interpretation in which quantum gravity is not an interaction, rather it is just responsible for generation of space-time-matter. Then we show this model is…
In the standard formulation of quantum mechanics, one starts by proposing a potential function that models the physical system. The potential is then inserted into the Schr\"odinger equation, which is solved for the wave function, bound…
Several techniques of generating random quantum channels, which act on the set of $d$-dimensional quantum states, are investigated. We present three approaches to the problem of sampling of quantum channels and show under which conditions…
A general and an arbitrarily efficient scheme for entangling the spins (or any spin-like degree of freedom) of two independent uncorrelated identical particles by a combination of two particle interferometry and which way detection is…
Quantum measurement is universal for quantum computation. This universality allows alternative schemes to the traditional three-step organisation of quantum computation: initial state preparation, unitary transformation, measurement. In…
Quantum computers exhibit an inherent randomness, so it seems natural to consider them for procedural content generation. In this work, a quantum version of the famous (classical) wave function collapse algorithm is proposed. This quantum…
Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. In effect, they follow the same logical paradigm as (multi-particle)…
A quantum algorithm is developed to calculate decay rates and cross sections using quantum resources that scale polynomially in the system size assuming similar scaling for state preparation and time evolution. This is done by computing…
We propose an approach to generative quantum machine learning that overcomes the fundamental scaling issues of variational quantum circuits. The core idea is to use a class of generative models based on instantaneous quantum polynomial…
Quantum computers hold great promise, but it remains a challenge to find efficient quantum circuits that solve interesting computational problems. We show that finding optimal quantum circuits is essentially equivalent to finding the…
We have presented a multivariate polynomial function termed as factor elimination function,by which, we can generate prime numbers. This function's mapping behavior can explain the irregularities in the occurrence of prime numbers on the…
Fundamental matrix operations and solving linear systems of equations are ubiquitous in scientific investigations. Using the "Sender-Receiver" model, we propose quantum algorithms for matrix operations such as matrix-vector product,…
This paper develops a deterministic model of quantum mechanics as an accumulation-and-threshold process. The model arises from an analogy with signal processing in wireless communications. Complex wavefunctions are interpreted as expressing…