I am trying to ascertain a precise understanding of the relationship between the quantum query model of complexity and the quantum circuit model of complexity. Specifically, is there an established mapping between these two models of complexity?
I have yet to find a precise account of their relationship, but my reading of work by Yao (1993) is that they are polynomially related. Is this the extent of our understanding? Is it even sensible for a mapping between these two models of complexity to exist or should we be satisfied in the notion that they address two separate sets of questions (i.e. different tools for different jobs)?
I've considered that perhaps we may view the quantum circuit complexity as a component of the query complexity in that it might be used to establish the complexity of an quantum oracle as implemented in practice. While not a mapping, is that a plausible way of connecting the two or are there additional considerations?
P.S. I was not able to find a non-paywalled version of Yao's paper, if anyone has one they could link for the purpose of this question that would be excellent.