In dealing with the algorithmic aspects of intelligent systems, the analogy with the biological brain has always been attractive, and has often had a dual function. On the one hand, it has been an effective source of inspiration for their design, while, on the other hand, it has been used as the justification for their success, especially in the case of Deep Learning (DL) models. However, in recent years, inspiration from the brain has lost its grip on its first role, yet it continues to be proposed in its second role, although we believe it is also becoming less and less defensible. Outside the chorus, there are theoretical proposals that instead identify important demarcation lines between DL and human cognition, to the point of being even incommensurable. In this article we argue that, paradoxically, the partial indifference of the developers of deep neural models to the functioning of biological neurons is one of the reasons for their success, having promoted a pragmatically opportunistic attitude. We believe that it is even possible to glimpse a biological analogy of a different kind, in that the essentially heuristic way of proceeding in modern DL development bears intriguing similarities to natural evolution.
A circular shift operator (or cyclic rotation gate) $${{\,\mathrm{\texttt {ROT}}\,}}_k$$ applies a rightward (or leftward) shift to an input register of n qubits o by as many positions as encoded by an additional input $$k \in \mathbb N$$ . Specifically, the qubit at position x is moved to position $$(x+k) \mod n$$ . While it is known that there exists a quantum rotation operator that can be implemented in $${{\,\mathrm{\mathcal {O}}\,}}(\log (n))$$ -time, through the repeated parallel application of the elementary $${{\,\mathrm{\texttt {Swap}}\,}}$$ operators, there is no systematic procedure that concretely constructs the quantum operator $${{\,\mathrm{\texttt {ROT}}\,}}$$ for variable size n of the quantum register and a variable parameter k. We fill the gap, providing a systematic implementation of the cyclic rotation operator (denoted $${{\,\mathrm{\texttt {ROT}}\,}}$$ ) in a quantum circuit model of computation whose depth is $${{\,\mathrm{\mathcal {O}}\,}}(\log (n))$$ . We show how the circular shift operator can be utilized in quantum approaches to text processing, focusing on the problem of getting all possible cyclic rotations of a string in $${{\,\mathrm{\mathcal {O}}\,}}(\log ^2(n))$$ depth.