In distributed quantum computing, the final solution of a problem is usually achieved by catenating these partial solutions resulted from different computing nodes, but intolerable errors likely yield in this catenation process. In the first part of this talk, I would like to introduce a universal error correction scheme to reduce errors and obtain effective solutions. Then, we apply this error correction scheme to designing a distributed phase estimation algorithm that presents a basic tool for studying distributed Shor’s algorithm and distributed discrete logarithm algorithm as well as other distributed quantum algorithms (for example, distributed quantum counting algorithm and distributed HHL algorithm). In the second part, I would like to introduce a quantum computing model--new quantum pushdown automata. For defining this quantum computing model, I would present a new definition of classical pushdown automata.