A Quantum Algorithm for finding the Maximum
read the original abstract
This paper describes a quantum algorithm for finding the maximum among N items. The classical method for the same problem takes O(N) steps because we need to compare two numbers in one step. This algorithm takes O(sqrt(N)) steps by exploiting the property of quantum states to exist in a superposition of states and hence performing an operation on a number of elements in one go. A tight upper bound of 6.8(sqrt(N)) for the number of steps needed using this algorithm was found. These steps are the number of queries made to the oracle.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Identifying vulnerable nodes and detecting malicious entanglement patterns to handle st-connectivity attacks in quantum networks
Quantum subroutines approximate Shapley-value node centrality for st-connectivity in quantum networks and QSVM detects entanglement-swapping attacks, with released simulation code.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.