Quantum Computing.
because the last bit is 1. You can check that 11 is indeed the remainder of 11¹³ divided by 21. The problem is now to devise a unitary transformation on l qbits that performs exponentiation by squaring. Typically this is done by reproducing with unitary transformations the corresponding classical