Abstract: The unitary matrices of nodes extended ware analyzed for 3-puzzle problem in quantum computing. By a 3-puzzle problem instance coding of the elements and nodes ware defined, the unitary matrices of the 3-puzzle problem instance ware given, and controlled-NOT gates ware used for realizing the unitary matrices in quantum logic circuit. A logic circuit model of N-puzzle quantum computing is discussed.The ground states and the best initial state in preparation for qubits are analyzed. The framework of heuristic search in quantum computing is discussed for N-puzzle.

Key words: heuristic search