| CPC G06F 9/3836 (2013.01) [G06N 10/20 (2022.01); G06N 10/60 (2022.01); G06N 10/80 (2022.01)] | 18 Claims |

|
1. A method for optimized quantum searching, comprising:
creating, by a classical computer program executed by a computer processor, a quantum circuit that implements Grover's algorithm;
identifying, by the classical computer program in a pre-transpile step, instances of Hadamard gates (H gates) and Pauli X-gates (X gates) and instances of X gates and H gates in the quantum circuit;
replacing, by the classical computer program, the instances of the H gates and X gates with Rx(π/2) gates and the instances of the X gates and H gates with Rx(−π/2) gates, wherein a number of the instances of the H gates and X gates, and the instances of the X gates and the H gates is greater than a number of Rx(π/2) gates and Rx(−π/2) gates;
implementing, by the classical computer program, a plurality of gates that implement a reflection about the mean in the quantum circuit;
completing, by the classical computer program, transpiling the quantum circuit into a plurality of quantum instructions;
sending, by the classical computer program, the quantum instructions to a quantum computer, wherein the quantum computer is configured to execute the quantum instructions and implement the reflection about the mean without undoing superposition in an amplification step of Grover's algorithm; and
receiving, from the quantum computer, results of execution of the quantum instructions.
|