  We give an oracle separation between QMA and QCMA for quantum algorithms that
have bounded adaptivity in their oracle queries; that is, the number of rounds
of oracle calls is small, though each round may involve polynomially many
queries in parallel. Our oracle construction is a simplified version of the
construction used recently by Li, Liu, Pelecanos, and Yamakawa (2023), who
showed an oracle separation between QMA and QCMA when the quantum algorithms
are only allowed to access the oracle classically. To prove our results, we
introduce a property of relations called \emph{slipperiness}, which may be
useful for getting a fully general classical oracle separation between QMA and
QCMA.
