Not necessarily. Although potentially faster than classical computers, quantum computers still have a non-zero time complexity and can only solve the problems that can also be computed with a classical computer. In other words, quantum computers adhere to the Church–Turing thesis: they cannot compute more things than classical computers, they can only compute them faster.

The oracle is a theoretical construct that can compute any problem in a single step, including ones like the halting problem (whether a program will stop eventually or run forever). The halting problem is impossible to compute using classical computers. Since the halting problem is impossible to compute with a classical computer, a quantum computer would be bound by the same limitation. A computer that cannot compute the halting problem in a single step is not considered an oracle, therefore quantum computers cannot be oracles.
spam fails_task lang_mismatch pii not_appropriate hate_speech sexual_content quality toxicity humor helpfulness creativity violence