In this paper we introduce a primal-dual potential reduction algorithm for positivesemi-definite programming. Using the symetric preserving scalings for both primal anddual interior matrices, we can construct an algorithm which is very similar to the primal-dual potential reduction algorithm of Huang and Kortanek [6] for linear programming. Thecomplexity of the algorithm is either O(n log(X0 @ S0/ε) or O(√nlog(X0 @ S0/ε) dependson the value of ρ in the primal-dual potential function, where X0 and S0 is the initialinterior matrices of the positive semi-definite programming.