
Constant Time Quantum search Algorithm Over A Datasets: An Experimental Study Using IBM Q Experience
In this work, a constant time Quantum searching algorithm over a dataset...
read it

Improved Classical and Quantum Algorithms for SubsetSum
We present new classical and quantum algorithms for solving random subse...
read it

Lorentz Quantum Computer
A theoretical model of computation is proposed based on Lorentz quantum ...
read it

Quantum routing with fast reversals
We present methods for implementing arbitrary permutations of qubits und...
read it

Solving Highly Constrained Search Problems with Quantum Computers
A previously developed quantum search algorithm for solving 1SAT proble...
read it

Quantum Boosting
Suppose we have a weak learning algorithm A for a Booleanvalued problem...
read it

Quantum Search with Prior Knowledge
Searchbase algorithms have widespread applications in different scenari...
read it
Faster Quantum Concentration via Grover's Search
We present quantum algorithms for routing concentration assignments on full capacity fatandslim concentrators, bounded fatandslim concentrators, and regular fatandslim concentrators. Classically, the concentration assignment takes O(n) time on all these concentrators, where n is the number of inputs. Powered by Grover's quantum search algorithm, our algorithms take O(√(nc)lnc) time, where c is the capacity of the concentrator. Thus, our quantum algorithms are asymptotically faster than their classical counterparts, when cln^2c=o(n).In general, c = n^μ, satisfies cln^2c=o(n), implying a time complexity of O(n^0.5(1+ μ )ln n), for any μ, 0 < μ < 1.
READ FULL TEXT
Comments
There are no comments yet.