In this paper, we introduce a method of threshold secret sharing scheme (TSSS) in which secret reconstruction is based on Babai's nearest plane algorithm. In order to supply secure public channels for transmitting shares to parties, we need to ensure that there are no quantum threats to these channels. A solution to this problem can be utilization of lattice-based cryptosystems for these channe...

Grover's quantum algorithm improves any classical search algorithm. We show how random Gaussian noise at each step of the algorithm can be modelled easily because of the exact recursion formulas available for computing the quantum amplitude in Grover's algorithm. We study the algorithm's intrinsic robustess when no quantum correction codes are used, and evaluate how much noise the algorithm can...

The problem of phase estimation (or amplitude estimation) admits a quadratic quantum speedup. Wang, Higgott, and Brierley [Wang, Brierley, Phys. Rev. Lett. 122, 140504 (2019)] have shown that there is continuous tradeoff between speedup circuit depth [by defining family algorithms known as $\ensuremath{\alpha}$-quantum $(\ensuremath{\alpha}\text{\ensuremath{-}}\mathrm{QPE})$]. In this paper, we...

The execution of quantum circuits on real systems has largely been limited to those which are simply time-ordered sequences unitary operations followed by a projective measurement. As hardware platforms for computing continue mature in size and capability, it is imperative enable beyond their conventional construction. Here we break into the realm dynamic superconducting-based system. Dynamic i...

A generalized quantum search algorithm, where phase inversions for the marked state and the prepared state are replaced by π/2 phase rotations, is realized in a 2-qubit NMR heteronuclear system. The quantum algorithm searches a marked state with a smaller step compared to standard Grover algorithm. Phase matching requirement in quantum searching is demonstrated by comparing it with another gene...

We present a quantum algorithm which simulates the quantum kicked rotator model exponentially faster than classical algorithms. This shows that important physical problems of quantum chaos, localization, and Anderson transition can be modeled efficiently on a quantum computer. We also show that a similar algorithm simulates efficiently classical chaos in certain area-preserving maps.