Fig. 5: Implementation of the two-qubit Grover’s algorithm with a quantum network.
From: Realising and compressing quantum circuits with quantum reservoir computing
a A quantum circuit implementing the two-qubit Grover’s algorithm. The circuit in the blue box contains 11 gates, which we have replaced with a single operation acting on a state \(\left|\psi \right\rangle\). Here, \(\left|\psi \right\rangle\) is created with a state preparation circuit (green box) and an oracle (red box). We achieved an average fidelity 0.99 with six sites in the quantum network. The obtained output probabilities (expressed in percentage) for the Grover’s search task are presented in panels b–e for different \(\left|\psi \right\rangle\), where the x-axis represents the measurement basis states. Here, we use E0/K0 = 300, P/K0 = 98 and τK0/ℏ = 10.6 and 10 randomly generated pure states for training. Here, H, X and the yellow box represent Hadamard, Pauli-X and controlled-NOT gates, and E0, K0, P and τ are energy, hopping strength, driving strength and evolution time, respectively.
