In this tutorial, we present an advanced, hands-on tutorial that demonstrates how we use Qrisp to build and execute non-trivial quantum algorithms. We walk through core Qrisp abstractions for quantum ...

Metric spaces form the backbone of modern computational geometry by providing a rigorous framework for measuring distances within abstract sets, while geometric approximation algorithms yield ...

Abstract: Identifying positive influence dominating set (PIDS) with the smallest cardinality can produce positive effect with the minimal cost on a social network. The purpose of this article is to ...

Let $P(m, X, N)$ be an $m$-degree polynomial in $X\in\mathbb{R}$ having fixed non-negative integers $m$ and $N$. Essentially, the polynomial $P(m, X, N)$ is a result ...

Abstract: Finding the shortest vector in a lattice is a NP-hard problem. The best known approximation algorithm for this problem is LLL algorithm with the approximation factor of αn-1\2, α≥4\3, which ...

Institute of Mathematics, National Academy of Sciences of the Republic of Armenia, Yerevan, Armenia. Let’s start with an excursion into the two-century history of studying the classical Fourier series ...

In recent years, neural networks have once again triggered an increased interest among researchers in the machine learning community. So-called deep neural networks model functions using a composition ...

Article Views are the COUNTER-compliant sum of full text article downloads since November 2008 (both PDF and HTML) across all institutions and individuals. These metrics are regularly updated to ...