no code implementations • 20 Feb 2024 • Ammar Daskin
We show that they can be used either as a parameterized quantum circuits to represent neural networks or as an underlying structure to construct graph neural networks on quantum computers.
no code implementations • 24 Jan 2024 • Ammar Daskin
This can provide efficiency over the models where the parameter vector is sent via classical or quantum channels and local gradients are obtained through the obtained values of these parameters.
no code implementations • 13 Nov 2023 • Ammar Daskin
In general, through performing this task, row and column permutations affect the fitness value in optimization: For an $N\times N$ matrix, it requires $O(N)$ computations to find (or update) the fitness value of a candidate solution.
no code implementations • 9 Feb 2023 • Ammar Daskin, Rishabh Gupta, Sabre Kais
We show that data with distributions such as uniform, Poisson, exponential, or similar to these distributions can be approximated by using only a few terms which can be easily mapped onto quantum circuits.
no code implementations • 12 Jan 2023 • Ammar Daskin
Ridge functions are used to describe and study the lower bound of the approximation done by the neural networks which can be written as a linear combination of activation functions.
no code implementations • 2 May 2022 • Ammar Daskin
Since some time series data can be also considered as continuous functions, we can expect quantum machine learning models to do many data analysis tasks successfully on time series data.
no code implementations • 20 Apr 2018 • Ammar Daskin
In this paper, we propose a simple neural net that requires only $O(nlog_2k)$ number of qubits and $O(nk)$ quantum gates: Here, $n$ is the number of input parameters, and $k$ is the number of weights applied to these parameters in the proposed neural net.
1 code implementation • 29 Jan 2018 • Ammar Daskin, Sabre Kais
In this paper, we present a method for the Hamiltonian simulation in the context of eigenvalue estimation problems which improves earlier results dealing with Hamiltonian simulation through the truncated Taylor series.
no code implementations • 19 Sep 2016 • Ammar Daskin
In quantum computing, the phase estimation algorithm is known to provide speed-ups over the conventional algorithms for the eigenvalue-related problems.