Improvement of performance of Grover's algorithm on three generations of Heron family IBM QPUs without and with topological dynamical decoupling

TL;DR

This paper evaluates Grover's algorithm performance on IBM Heron QPUs across three generations, demonstrating improvements with dynamical decoupling and analyzing success probabilities for 3-6 qubits.

Contribution

It provides new empirical results on Grover's algorithm success probabilities on multiple IBM Heron QPU generations, including enhancements with topological dynamical decoupling.

Findings

Success probabilities for 3-5 qubits improved over previous QPU generations.

Dynamical decoupling enhances Grover's algorithm performance for 5 qubits.

Clear results for 6 qubits with suboptimal iterations using dynamical decoupling.

Abstract

We investigate the performance of Grover's algorithm on three different generations of IBM Heron QPUs. On Heron family of IBM QPUs the success probabilities for three, four and five qubits without dynamical decoupling is better than results reported for previous generations of QPUs. The success probability as function of number of iterations of Grover operator is considered. A study of the improvement of results of Grover's algorithm for five qubit case with the help of topological dynamical decoupling is considered. For a six qubit case on Heron r3 QPU a clear result for finding the sought-after bitstring is reported for theoretically suboptimal number of iterations of Grover operator with the help of dynamical decoupling.