Let . The positive-exponent quantum Fourier transform gives . Reindexing the cyclic shift operator gives
Thus is an eigenstate with eigenvalue , with this sign fixed by the printed quantum Fourier transform convention.
Prepare the first two qutrits in and the answer qutrit in . The modular-addition quantum oracle applies to the answer. Its eigenvalue produces quantum phase kickback, leaving
Apply to each input qutrit, then measure them in the computational basis. The result is
The preparation, inverse transforms and measurements are independent of , and there is exactly one use of . This is qutrit linear-function identification, the ternary version of Bernstein-Vazirani phase kickback.
Use the quantum Fourier transform convention , where . Reindexing the shifted sum gives
Thus the cyclic shift operator has these eigenvectors, with eigenvalues . This is cyclic shift diagonalization by the quantum Fourier transform, and it implies with .
For , the binary encoding is , with the more significant qubit. The required diagonal phase is
so . The allowed-gate circuit is therefore
In execution order, apply the inverse QFT, then the two phase gates, then the forward QFT. There is no extra global phase. Reversing the Fourier sign convention would conjugate both phase gate parameters.
A shift-invariant basis is a common eigenbasis of all cyclic shift operators . For the displayed Fourier states, orthonormality follows from the root-of-unity filter:
There are vectors in this orthonormal set in the -dimensional Hilbert space, so they form a basis. Reindexing the finite sum gives
Thus every is simultaneously an eigenvector of every shift, with eigenvalue for .