| Summary: | Abstract Bit rotation is an operation similar to shift except that the bits that fall off at one end are put back to the other end. In left rotation, the bits that fall off at left end are put back at right end. In right rotation, the bits that fall off at the right end are put back at the left end. Applications of bit rotation include; registers, cryptography, computing with a single bit string circularly shifted to the right or left based on some position but no work has been done with respect to shifting the bits one position at a time generating emergent bit strings equal to the number of bits-1 from the incident bit string, and then recombining or extracting bit(s) from each of the bit strings or words to form back the incident bit string. In this article, the authors present a new approach of rotating classical bit strings known as CRotate. A quantum approach to bit rotation known as QRotate is presented as well. The quantum perspective uses the concept of bit swapping by avenue of the quantum swap gate in jsqubits. Models and algorithms are duly presented.
|
|---|
