摘要A methodology is presented to obtain the basis of qudits which are admissible to quantum Fourier transform (QFT) in the sense that the set of such kets are related by the QFT in the same way as the kets of the computational basis. We first study this method for qubits to characterize the ensemble that works for the Hadamard transformation (QFT for two dimension). In this regard we identify certain incompleteness in the result of Maitra and Parashar (Int. J. Quantum Inform. 4 (2006) 653). Next we characterize the ensemble of qutrits for which QFT is possible. Further, some theoretical results related to higher dimensions are also discussed. Considering the unitary matrix Un related to QFT, the issue boils down to the problem of characterizing matrices that commute with Un.
Abstract：A methodology is presented to obtain the basis of qudits which are admissible to quantum Fourier transform (QFT) in the sense that the set of such kets are related by the QFT in the same way as the kets of the computational basis. We first study this method for qubits to characterize the ensemble that works for the Hadamard transformation (QFT for two dimension). In this regard we identify certain incompleteness in the result of Maitra and Parashar (Int. J. Quantum Inform. 4 (2006) 653). Next we characterize the ensemble of qutrits for which QFT is possible. Further, some theoretical results related to higher dimensions are also discussed. Considering the unitary matrix Un related to QFT, the issue boils down to the problem of characterizing matrices that commute with Un.
[1] Deutsch D and Jozsa R 1992 Proc. R. Soc. London A 439 553
[2] Nielsen M A and Chuang I L 2002 Quantum Computation and Quantum Information (Cambridge: Cambridge University)
[3] Shor P W 1994 Proceedings of 35th Annual Symposium on Foundations of Computer Science p 124
[4] Pati A K 2002 Phys. Rev. A 66 062319
[5] Maitra A and Parashar P 2006 Int. J. Quantum Inform. 4 653
[6] Yosida K 1968 Functional Analysis (Berlin: Springer)
[7] http://www.sagemath.org/
[8] Mathematica 7. 0 2008 (Wolfram Research, Illinois)
[9] Bennett C H and Brassard G 1984 Proceedings of the IEEE International Conference on Computers Systems, and Signal Processing (Bangalore, India) p 175
[10] Bruß D and Macchiavello C 2002 Phys. Rev. Lett. 88 127901
2012, Vol. 29 
