Zobrazeno 1 - 10
of 52
pro vyhledávání: '"Doliskani, Javad"'
Autor:
Doliskani, Javad
We introduce $\varepsilon$-projectors, using which we can sample from limiting distributions of continuous-time quantum walks. The standard algorithm for sampling from a distribution that is close to the limiting distribution of a given quantum walk
Externí odkaz:
http://arxiv.org/abs/2209.13028
We investigate the security assumptions behind three public-key quantum money schemes. Aaronson and Christiano proposed a scheme based on hidden subspaces of the vector space $\mathbb{F}_2^n$ in 2012. It was conjectured by Pena et al in 2015 that the
Externí odkaz:
http://arxiv.org/abs/2205.10488
Autor:
Booher, Jeremy, Bowden, Ross, Doliskani, Javad, Fouotsa, Tako Boris, Galbraith, Steven D., Kunzweiler, Sabrina, Merz, Simon-Philipp, Petit, Christophe, Smith, Benjamin, Stange, Katherine E., Ti, Yan Bo, Vincent, Christelle, Voloch, José Felipe, Weitkämper, Charlotte, Zobernig, Lukas
An important open problem in supersingular isogeny-based cryptography is to produce, without a trusted authority, concrete examples of "hard supersingular curves" that is, equations for supersingular curves for which computing the endomorphism ring i
Externí odkaz:
http://arxiv.org/abs/2205.00135
Autor:
Doliskani, Javad
Our main result is a quantum public-key encryption scheme based on the Extrapolated Dihedral Coset problem (EDCP) which is equivalent, under quantum polynomial-time reductions, to the Learning With Errors (LWE) problem. For limited number of public k
Externí odkaz:
http://arxiv.org/abs/2105.12790
Quantum computers are becoming more mainstream. As more programmers are starting to look at writing quantum programs, they need to test and debug their code. In this paper, we discuss various use-cases for quantum computers, either standalone or as p
Externí odkaz:
http://arxiv.org/abs/2103.09172
Quantum computers are becoming more mainstream. As more programmers are starting to look at writing quantum programs, they face an inevitable task of debugging their code. How should the programs for quantum computers be debugged? In this paper, we d
Externí odkaz:
http://arxiv.org/abs/2001.10870
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Doliskani, Javad
We present a randomized quantum algorithm for polynomial factorization over finite fields. For polynomials of degree $n$ over a finite field $\F_q$, the average-case complexity of our algorithm is an expected $O(n^{1 + o(1)} \log^{2 + o(1)}q)$ bit op
Externí odkaz:
http://arxiv.org/abs/1807.09675
Autor:
Doliskani, Javad
For an elliptic curve $E$ over a finite field $\F_q$, where $q$ is a prime power, we propose new algorithms for testing the supersingularity of $E$. Our algorithms are based on the Polynomial Identity Testing (PIT) problem for the $p$-th division pol
Externí odkaz:
http://arxiv.org/abs/1801.02664
We present a novel randomized algorithm to factor polynomials over a finite field $\F_q$ of odd characteristic using rank $2$ Drinfeld modules with complex multiplication. The main idea is to compute a lift of the Hasse invariant (modulo the polynomi
Externí odkaz:
http://arxiv.org/abs/1712.00669