Needs["Wolfram`QuantumFramework`"];

QFT

Table[With[{op=QuantumCircuitOperator["Fourier"[i]]},{i,op["Diagram"],op["MatrixRepresentation"]//MatrixForm}],{i,3}]

Grover’s Algorithm

grover=QuantumCircuitOperator["Grover"];

{grover["Diagram"],grover["MatrixRepresentation"]//MatrixForm}

Euclidean Algorithm Tracer

gcdList[a_,b_]:=NestWhileList[{Last[#],(Mod[#1,#2]&)@@#}&,{a,b},Last[#]!=0&,1];
euclideanAlgorithm[a_,b_]:={HoldForm[GCD[a,b]],TableForm[gcdList[a,b],TableHeadings->{None,{"Quotient", "Remainder"}}],GCD[a,b]};

euclideanAlgorithm[28,91]

Period-Finding Simulator

periodFinder[a_,N_]:=Table[{x,a^x,Mod[a^x,N]},{x,0,10}]; (* Upper bound of 10... *)

periodFinderTable[a_,N_]:=TableForm[periodFinder[a,N],TableHeadings->{None,{HoldForm[x],a^HoldForm[x],HoldForm[Mod[a^HoldForm[x],N]]}}];

periodFinderTable[3,91]