Mixed Grover: A Hybrid Version to Improve Grover’s Algorithm for Unstructured Database Search

Abstract: In this article, we propose a new strategy to exploit Grover’s algorithm for unstructured search problems. We first show that running Grover’s routine with a reduced number of iterations but allowing several trials presents a complexity advantage while keeping the same success probability. Then, by a theoretical analysis of the performance, we provide a […]

A Proposed Quantum Framework for Low-Complexity Quantum Simulation and Spectrum Estimation of Hankel-Patterned Systems

The structured matrix completion problem (SMCP) is ubiquitous in several signal processing applications. In this article, we consider a fixed pattern, namely, the Hankel-structure for the SMCP under quantum formalism. By exploiting its structure, a lower-gate-complexity quantum circuit realization of a Hankel system is demonstrated. Further, we propose a quantum simulation algorithm for the Hankel-structured […]