most citedA Formulation of a Matrix Sparsity Approach for the Quantum Ordered Search Algorithm

1 citations · 1 across the 1 of their papers we have counts for

collaborators

1 paper

quant-ph2016★ 1 cited

A Formulation of a Matrix Sparsity Approach for the Quantum Ordered Search Algorithm

Jupinder Parmar, Saarim Rahman, Jesse Thiara

One specific subset of quantum algorithms is Grovers Ordered Search Problem (OSP), the quantum counterpart of the classical binary search algorithm, which utilizes oracle functions…