38 citations · 38 across the 3 of their papers we have counts for
6 papers
How to Sample From The Limiting Distribution of a Continuous-Time Quantum Walk
Javad Doliskani
We introduce -projectors, using which we can sample from limiting distributions of continuous-time quantum walks. The standard algorithm for sampling from a distributi…
Efficient Quantum Public-Key Encryption From Learning With Errors
Javad Doliskani
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…
On Testing and Debugging Quantum Software
Andriy Miranskyy, Lei Zhang, Javad Doliskani
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 disc…
Is Your Quantum Program Bug-Free?
Andriy Miranskyy, Lei Zhang, Javad Doliskani
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 shou…
Toward an Optimal Quantum Algorithm for Polynomial Factorization over Finite Fields
Javad Doliskani
We present a randomized quantum algorithm for polynomial factorization over finite fields. For polynomials of degree over a finite field $\F_q$, the average-case complexity of…
On Division Polynomial PIT and Supersingularity
Javad Doliskani
For an elliptic curve over a finite field $\F_q$, where is a prime power, we propose new algorithms for testing the supersingularity of . Our algorithms are based on the…