quantum computing

Q.4 (Qiskit 10 pts.) Submit this question as a separate Jupyter notebook file. Implement in Qiskit the following circuit for the function f:Z4Z22 defined by f(0)=f(2)=(0,0)andf(1)=f(3)=(0,1). Run your algorithm 128 times and plot the greatest common divisor gcd(xi,xi+1) of the i-th and the (i+1)-th outcome for odd i 's. (By Q.3 part (a) we expect with high probability gcd(xi,xi+1)=1 and part (b) can be used to extract the period 2 from your data.)