{'fraction_non_alphanumeric': 0.020209580838323353, 'fraction_numerical': 0.002245508982035928, 'mean_word_length': 5.3971291866028706, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
The performance impact of the graph topology in Ibm’s Quantum devices on Grover’s search algorithm

In the context of actual information technology, data processing and storage have increased exponentially. Searching through large databases is considered an important problem, with multiple applications, where the properties of quantum computing could be used to find a potential solution. In this paper, the authors present an implementation for Grover’s search algorithm, a fast quantum algorithm for database search, and analyze the results for various graph topologies used in some of the real quantum devices provided by IBM. The algorithm provides a quadratic speedup over its classical counterpart (linear complexity). The code used in the implementation is possible with the help of the Qiskit framework and IBM Q Experience platform. Multiple tests with their results are presented. The experiments include three implementations of Grover’s search algorithm for different input register sizes: 2, 3 and 4 qubits, and exploration of multiple running configurations. We focus on the performance impact of selecting different groups of qubits on various real quantum devices, such as the probability to find the desired state and the execution time. For each experiment, we present the motivation, the results and their analysis.