Quantum Computing, Qiskit, Fourier Transform, Addition.
#Flip the corresponding qubit in register a if a bit in the #string first is a 1 for i in range(0, n): if first[i] == "1": qc.x(a[n-(i+1)]) #Flip the corresponding qubit in register b if a bit in the #string second is a 1 for i in range(0, n): if second[i] == "1": qc.x(b[n-(i+1)]) Now we can call