Abstarct: We design classes of quantum low-density parity-check (LDPC) codes, called quasicyclic stabilizer (QCS) codes, from conventional QC-LDPC codes. The proposed QCS codes belong to the family of non-CSS stabilizer codes. The QC-LDPC codes are selforthogonal with respect to the symplectic inner product (SIP), and are constructed from submatrices of non-orthogonal Latin squares via array dispersion. The Latin squares are constructed using quadratic (non)-residue sets of prime modulus p, where p = 4n±1. For p = 4n − 1, two constructions, namely Type-I-A and Type-I-B QCS codes, are proposed baxsed on matrix superposition and matrix concatenation, respectively. For p = 4n + 1, Type-II QCS codes are proposed baxsed on permutations of a baxse matrix. We show that the parity-check matrix for Type-I-B and Type-II QCS codes is self-orthogonal with respect to the SIP for all orders of circulant permutation matrix. This results in designing some QCS codes characterized by a single baxse matrix. We show that the minimum distance of Type-II QCS codes can be lower bounded by the minimum distance of the QC-LDPC codes. Simulation results show that the proposed QCS codes outperform some codes in the literature with a noteworthy low error floor, below 10−7, over quantum depolarizingchannels.