摘要 |
PROBLEM TO BE SOLVED: To decompose an arbitrary unitary matrix into a small-sized matrix at low calculation cost. SOLUTION: A matrix X which satisfies G=K×M and X=M<SP>2</SP>is generated to a unitary matrix G. A matrix P which block-diagonalizes the matrix X is generated, and a complex conjugate transposed matrix P<SP>*</SP>of the matrix P is generated. A block diagonal matrix B is generated by the calculation of B=P<SP>*</SP>×X×P from the matrix X, the matrix P and the complex conjugate transposed matrix P<SP>*</SP>, and the block diagonal matrix B is converted to a block diagonal matrix Y of a matrix M (=P<SP>*</SP>×M×P). Then the matrix M is generated by the calculation of M=P×Y×P<SP>*</SP>from the block diagonal matrix Y, the matrix P, and the complex conjugate transposed matrix P<SP>*</SP>, and a complex conjugate transposed matrix M<SP>*</SP>of the matrix M is generated. A matrix K is generated by the calculation of K=G×M<SP>*</SP>from the matrix G and the complex conjugate transposed matrix M<SP>*</SP>. COPYRIGHT: (C)2006,JPO&NCIPI
|