We calculate Wigner function, tomogram of the pair coherent state by using its Sehmidt decomposition in the coherent state representation. It turns out that the Wigner function can be seen as the quantum entanglement ...We calculate Wigner function, tomogram of the pair coherent state by using its Sehmidt decomposition in the coherent state representation. It turns out that the Wigner function can be seen as the quantum entanglement (QE) between two two-variable Hermite polynomials (TVHP) and the tomogram is further simplified as QE of two single-variable Hermite polynomials. The Husimi function of pair coherent state is also calculated.展开更多
GVW algorithm was given by Gao, Wang, and Volny in computing a Grobuer bases for ideal in a polynomial ring, which is much faster and more simple than F5. In this paper, the authors generalize GVW algorithm and presen...GVW algorithm was given by Gao, Wang, and Volny in computing a Grobuer bases for ideal in a polynomial ring, which is much faster and more simple than F5. In this paper, the authors generalize GVW algorithm and present an algorithm to compute a Grobner bases for ideal when the coefficient ring is a principal ideal domain. K展开更多
基金Supported by the National Natural Science Foundation of China under Grant Nos.10775097 and 10874174the Research Foundation of the Education Department of Jiangxi Province
文摘We calculate Wigner function, tomogram of the pair coherent state by using its Sehmidt decomposition in the coherent state representation. It turns out that the Wigner function can be seen as the quantum entanglement (QE) between two two-variable Hermite polynomials (TVHP) and the tomogram is further simplified as QE of two single-variable Hermite polynomials. The Husimi function of pair coherent state is also calculated.
基金supported by the National Natural Science Foundation of China under Grant Nos.11071062,11271208Scientific Research Fund of Hunan Province Education Department under Grant Nos.10A033,12C0130
文摘GVW algorithm was given by Gao, Wang, and Volny in computing a Grobuer bases for ideal in a polynomial ring, which is much faster and more simple than F5. In this paper, the authors generalize GVW algorithm and present an algorithm to compute a Grobner bases for ideal when the coefficient ring is a principal ideal domain. K