In　this　paper,　we　propose　some　new　quantum　circuit　implementations　of　SM4　block　cipher　and　SM3　hash　function,　which　are　based　on　the　following　ideas.　Firstly,　we　propose　an　improved　classical　circuit　of　SM4’s　S-box,　which　requires　less　AND　gates　than　the　previous　works.　Our　improved　classical　circuit　of　SM4’s　S-box　can　be　used　for　constructing　a　new　quantum　circuit　of　SM4’s　S-box.　Secondly,　we　propose　a　new　implementation　of　the　Feistel-like　structure　of　SM4　so　as　to　reduce　the　number　of　qubits　and　T-depth　simultaneously.　Thirdly,　we　reduce　the　number　of　qubits　in　our　quantum　circuit　of　SM3　by　making　use　of　linear　message　expansion　algorithm　of　SM3.　Fourthly,　we　propose　some　in-place　implementations　of　the　linear　permutations　of　SM4　and　SM3.　Based　on　our　new　techniques,　our　stand-alone　memory-efficient　quantum　circuit　implementation　of　SM4　only　requires　384　qubits,　seven　ancilla　qubits　and　33,024　T-depth,　while　our　depth-efficient　quantum　circuit　of　SM4　requires　384　qubits,　1080　ancilla　qubits　and　455　T-depth.　Furthermore,　we　propose　a　stand-alone　memory-efficient　quantum　circuit　implementation　of　SM3　with　768　qubits,　33　ancilla　qubits　and　144,768　T-depth,　while　our　depth-efficient　quantum　circuit　of　SM3　requires　768　qubits,　202　ancilla　qubits,　and　25,344　T-depth.　Compared　to　the　previous　work,　our　new　quantum　circuits　of　SM3　requires　less　qubits　and　T-depth.　©　2022,　The　Author(s),　under　exclusive　licence　to　Springer　Science+Business　Media,　LLC,　part　of　Springer　Nature.