Yes, you could treat a quantum computer as an oracle for a Turing machine and calculate complexity that way. An extreme (though contrived) case is the Deutsch-Jozsa algorithm, which is exponential on classical computers, but $O(1)$ on quantum ones.
spam fails_task lang_mismatch pii not_appropriate hate_speech sexual_content quality toxicity humor helpfulness creativity violence