Figure 2
From: Characterizing Grover search algorithm on large-scale superconducting quantum computers

Results obtained from executing the GSA for single-solution scenarios on a 3-qubit database (000, 001, 010, 011, 100, 101, 110, 111) in various environments. The left side presents data from algorithm execution in a noisy environment, while the right side displays data from execution on IBM Quantum’s real quantum computers. The graphs illustrate the probability distribution for each output state. We observed a median \({\mathcal {ASP}}\) of 76.79% in the noisy execution and 44.80% on the IBM quantum computers. Additionally, we obtained a median \({\mathcal {SSO}}\) of 82.49% in the noisy environment and 72.63% on real IBM quantum computers. All percentages are calculated relative to the expected state \(\left| \psi _E\right\rangle _\text {Single}\), defined as \(\left| \psi _E\right\rangle _\text {Single} = \frac{5}{4\sqrt{2}} \left| \chi ^*\right\rangle +\frac{1}{4\sqrt{2}} \sum _{\chi \ne \chi ^*} \left| \chi \right\rangle\), where \(\left| \chi ^*\right\rangle\) represents the single marked state. The \(\left| \,\right\rangle\) notation was omitted from the figures for simplicity.