Fig. 9: Anticipated performance of the two-solution Grover search on logical qubits.
From: Demonstration of measurement-free universal logical quantum computation
We simulate Grover’s search algorithm for the set of noise parameters as characterized by the current experimental setup (blue), indicating a success probability of psuccess = 0.40(4). For a slightly lower two-qubit-gate error rate of \({p}_{2}^{{\prime} }={p}_{2}-0.01=0.015\), we already obtain a total success probability of 0.52(1), which is above the classical optimal success probability of 0.46, as discussed in Section ‘Grover search on logical qubits’. If instead of lowering p2, we increase T2 by a factor of 2–100 ms (orange), we find even higher success rates of psuccess = 0.67(1).
