In the Deutsch algorithm, the oracle implementation for the function f is taken as a black box, but physically, how is the oracle implemented? Why can we assume such a black box exists for the computer?
The algorithm itself makes sense but how do we intuitively understand the existence of such an oracle for any function f. Is the correct analogy that in a computer, the implementation of a function is some sequence of gates. In a quantum computer, the abstraction of a function is that idea that it is also underneath just a sequence of gates.