Security weaknesses in the symmetric-key components of a cipher can compromise its overall security assurances. With the rapid progress in quantum computing in recent years, there is a growing focus on assessing the resilience of symmetric-key cryptography against possible quantum attacks. This paper is dedicated to examining the quantum attack resistance of CHAM, a family of lightweight block ciphers. We provide an optimized quantum circuit implementation of CHAM and evaluate its complexity metrics, such as the number of qubits, gate count, and circuit depth, within the context of Grover’s search algorithm. For Grover’s key search, minimizing the circuit depth is the key optimization goal, particularly when parallel search capabilities are taken into account. Our approach enhances parallelism for a low-depth quantum circuit of CHAM, aiming to reduce both the Toffoli depth and overall circuit depth.