It is claimed that a quantum Turing machine is "computationally" equivalent to the circuit model. Quantum computing also includes all classical computing. However, we know that there are classical Turing machines that do not halt on certain inputs.
How does a quantum circuit capture this non-halting "ability" of classical Turing machines? The way we draw them, every quantum circuit inevitably halts when we perform the measurements at the end.