Enhancing Quantum Search: The Potential of Partitioned Grover's Algorithm
Ahcène Bounceur, Saadat Mehmood Alhashmi, Mohamed Abdalla Nour, Hüseyin Şeker · 2024
Grover's Algorithm is a prominent quantum search algorithm in the rapidly advancing quantum computing study. By exploiting superposition and quantum parallelism, it has the potential to outperform classical brute-force approaches. Nevertheless, the current practical application of quantum technology in decrypting intricate passwords is restricted by its early stage, namely the restricted qubit quantities and short coherence durations. This work presents an innovative distributed quantum computing paradigm that addresses these difficulties by partitioning the password search space among several quantum processors. Each processor executes Grover's Algorithm on a subset of the search space, minimizing the computational complexity and quantum resource requirements for each individual processor. The partial findings are subsequently transmitted to a central classical computer, which amalgamates them to obtain the ultimate password. This distributed methodology not only allows for practicality with current quantum systems but also provides a scalable paradigm that can adapt to the progress of quantum computer technology. By decomposing the quantum brute-force search problem into smaller, more controllable elements, this approach can significantly decrease the time complexity of password retrieval, which has significant consequences for cryptography and cybersecurity.