By using the completeness of quantum state-vector space and the transformation of representation,the rotation operator D∧(α,β,γ) in the {J∧2,J∧z} in matrix can be calculated directly,which indicates that the algorithm is simple and effective.
This chapter illustrates how one can obtain a matrix representation of a state vector, an operator, and an eigenvalue equation in a basis of orthonormal states. It helps to learn that matrix representations are very useful in calculations of the properties of operators, because algebra of matrices is very simple and completely developed. Readers familiar with the algebra of matrices agree that mathematical operations on matrices such as multiplication by a scalar, addition, subtraction, multiplication and diagonalization are simple and easy to perform. In fact, the application of the algebra of matrices to quantum physics results from the direct relations between operators and matrices that any mathematical relation that holds between operators also holds between the corresponding matrices. The eigenvalues and eigenvectors of the matrix representing a given operator  in the basis of orthonormal states are the same as the eigenvalues and eigenvectors of Â.
For the fermion transformation in the space all books of quantum mechanics propose to use the unitary operator Un(φ)=exp(−i2φ(σ⋅n)), where φ is angle of rotation around the axis n. But this operator turns the spin in inverse direction presenting the rotation to the left. The error of defining of Un(φ) action is caused because the spin supposed as simple vector which is independent from σ-operator a priori. In this work it is shown that each fermion marked by number i has own Pauli-vector σi and both of them change together. If we suppose the global σ-operator and using the Bloch Sphere approach define for all fermions the common quantization axis z the spin transformation will be the same: the right hand rotation around the axis n is performed by the operator Un+(φ)=exp(+i2φ(σ⋅n)).
The quantum Fourier transform for discrete variable (dvQFT) is an efficient algorithm for several applications. It is usually considered for the processing of quantum bits (qubits) and its efficient implementation is obtained with two elementary components: the Hadamard gate and the controlled--phase gate. In this paper, the quantum Fourier transform operating with continuous variables (cvQFT) is considered. Thus, the environment becomes the Hilbert space, where the natural definition of the cvQFT will be related to rotation operators, which in the N--mode are completely specified by unitary matrices of order N. Then the cvQFT is defined as the rotation operator whose rotation matrix is given by the discrete Fourier transform (DFT) matrix. For the implementation of rotation operators with primitive components (single--mode rotations and beam splitters), we follow the well known Murnaghan procedure, with appropriate modifications. Moreover, algorithms related to the fast Fourier transform (FFT) are applied to reduce drastically the implementation complexity. The final part is concerned with the application of the cvQFT to general Gaussian states. In particular, we show that cvQFT has the simple effect of transforming the displacement vector by a one-dimensional DFT, the squeeze matrix by a two-dimensional DFT, and the rotation matrix by a Fourier-like similarity transform.