Related papers: A Quantum Diophantine Equation Solution Finder

In this work, we present a multi-layer quantum search method that generates an exponential speedup of the standard Grover's algorithm. As direct applications, any NP problems can be solved efficiently on a quantum circuit with only…

In this note we find all the solutions of the Diophantine equation $x^4\pm y^4=iz^2$ using elliptic curves over $\mathbb Q(i)$. Also, using the same method we give a new proof of Hilbert's result that the equation $x^4\pm y^4=z^2$ has only…

The paper presents a new generalized integer orthogonal transformation which consists of a well known orthogonal transform followed by stretching the basis vectors maintaining the asymptotic behavior of the number of integer solutions for…

Grover's database search algorithm, although discovered in the context of quantum computation, can be implemented using any physical system that allows superposition of states. A physical realization of this algorithm is described using…

Grover's algorithm achieves a quadratic speedup over classical algorithms, but it is considered necessary to know the value of $\lambda$ exactly [Phys. Rev. Lett. 95, 150501 (2005); Phys. Rev. Lett. 113, 210501 (2014)], where $\lambda$ is…

We solve Diophantine equations of the type $ a \, (x^3 \!+ \! y^3 \!+ \! z^3 ) = (x \! + \! y \! + \! z)^3$, where $x,y,z$ are integer variables, and the coefficient $a\neq 0$ is rational. We show that there are infinite families of such…

We present a full implementation and simulation of a novel quantum reinforcement learning method. Our work is a detailed and formal proof of concept for how quantum algorithms can be used to solve reinforcement learning problems and shows…

Search is one of the most commonly used primitives in quantum algorithm design. It is known that quadratic speedups provided by Grover's algorithm are optimal, and no faster quantum algorithms for Search exist. While it is known that at…

We present a quantum algorithmic routine that extends the realm of Grover-based heuristics for tackling combinatorial optimization problems with arbitrary efficiently computable objective and constraint functions. Building on previously…

The Grover search algorithm is one of the two key algorithms in the field of quantum computing, and hence it is of significant interest to describe it in the most efficient mathematical formalism. We show firstly, that Clifford's formalism…

Let E_n={x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}}. There is an algorithm that for every computable function f:N->N returns a positive integer m(f), for which a second algorithm accepts on the input f and any integer…

Grover's search algorithm is designed to be executed on a quantum mechanical computer. In this paper, the probabilistic wp-calculus is used to model and reason about Grover's algorithm. It is demonstrated that the calculus provides a…

The Discretizable Molecular Distance Geometry Problem (DMDGP) aims to determine the three-dimensional protein structure using distance information from nuclear magnetic resonance experiments. The DMDGP has a finite number of candidate…

Let $\mathfrak{p}=(\mathfrak{p}_1,...,\mathfrak{p}_r)$ be a system of $r$ polynomials with integer coefficients of degree $d$ in $n$ variables $\mathbf{x}=(x_1,...,x_n)$. For a given $r$-tuple of integers, say $\mathbf{s}$, a general local…

The research community has been actively working on the realization of quantum computer. But the large scale commercial quantum computers are not a reality yet quantum computing field has become richer by day with the advent of algorithms…

Consider the equation $q_1\alpha^{x_1}+\dots+q_k\alpha^{x_k} = q$, with constants $\alpha \in \overline{\mathbb{Q}} \setminus \{0,1\}$, $q_1,\ldots,q_k,q\in\overline{\mathbb{Q}}$ and unknowns $x_1,\ldots,x_k$, referred to in this paper as…

Grover's algorithm can solve NP-complete problems on quantum computers faster than all the known algorithms on classical computers. However, Grover's algorithm still needs exponential time. Due to the BBBV theorem, Grover's algorithm is…

Grover's unstructured search algorithm is one of the best examples to date for the superiority of quantum algorithms over classical ones. Its applicability, however, has been questioned by many due to its oracular nature. We propose a…

Grover's algorithm for quantum searching is generalized to deal with arbitrary initial complex amplitude distributions. First order linear difference equations are found for the time evolution of the amplitudes of the marked and unmarked…

We investigate pairs of diagonal cubic equations with integral coefficients. For a class of such Diophantine systems with 11 or more variables, we are able to establish that the number of integral solutions in a large box is at least as…