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.

中文翻译：

---

比特旋转：经典和量子观点

位旋转是类似于移位的操作，不同之处在于，一端掉落的位会放回到另一端。在向左旋转时，从左端掉落的钻头会放回到右端。在向右旋转时，从右端掉落的钻头会放回到左端。比特旋转的应用包括：寄存器，密码学，基于某个位置将单个位字符串循环地向右或向左移位的计算，但是尚未完成有关一次将位移位一个位置以生成等于位数-1的紧急位字符串的工作从入射位串中提取信息，然后从每个位串或单词中重新组合或提取一个或多个位，以形成入射位串。在本文中，作者提出了一种旋转经典位串的新方法，称为CRotate。还提出了一种称为QRotate的量子旋转方法。量子透视图使用通过jsqubits中的量子交换门的途径进行位交换的概念。适当介绍了模型和算法。