We propose an experimentally feasible teleportation scheme with three-atom W-class state,which was first proposed by Agrawal and Pati [P.Agrawal and A.Pati,Phys.Rev.A 74 (2006) 062320 ],in cavity QED.In this scheme at...We propose an experimentally feasible teleportation scheme with three-atom W-class state,which was first proposed by Agrawal and Pati [P.Agrawal and A.Pati,Phys.Rev.A 74 (2006) 062320 ],in cavity QED.In this scheme atoms interact simultaneously with a nonresonant cavity and there is no energy exchange between the atoms and the cavity.Thus it is insensitive to the cavity decay,which is of importance in view of experiment.展开更多
In this paper, a projected gradient trust region algorithm for solving nonlinear equality systems with convex constraints is considered. The global convergence results are developed in a very general setting of comput...In this paper, a projected gradient trust region algorithm for solving nonlinear equality systems with convex constraints is considered. The global convergence results are developed in a very general setting of computing trial directions by this method combining with the line search technique. Close to the solution set this method is locally Q-superlinearly convergent under an error bound assumption which is much weaker than the standard nonsingularity condition.展开更多
文摘We propose an experimentally feasible teleportation scheme with three-atom W-class state,which was first proposed by Agrawal and Pati [P.Agrawal and A.Pati,Phys.Rev.A 74 (2006) 062320 ],in cavity QED.In this scheme atoms interact simultaneously with a nonresonant cavity and there is no energy exchange between the atoms and the cavity.Thus it is insensitive to the cavity decay,which is of importance in view of experiment.
基金Supported by the National Natural Science Foundation of China (10871130)the Research Fund for the Doctoral Program of Higher Education of China (20093127110005)the Scientific Computing Key Laboratory of Shanghai Universities
文摘In this paper, a projected gradient trust region algorithm for solving nonlinear equality systems with convex constraints is considered. The global convergence results are developed in a very general setting of computing trial directions by this method combining with the line search technique. Close to the solution set this method is locally Q-superlinearly convergent under an error bound assumption which is much weaker than the standard nonsingularity condition.
