  Relational quantum queries are sometimes capable to effectively decide
between collections of mutually exclusive elementary cases without completely
resolving and determining those individual instances. Thereby the set of
mutually exclusive elementary cases is effectively partitioned into equivalence
classes pertinent to the respective query. In the second part of the paper, we
review recent progress in theoretical certifications (relative to the
assumptions made) of quantum value indeterminacy as a means to build quantum
oracles for randomness.
