A reasonable upper bound is 43, or 45 if you don't start with the cube in a known orientation. One question for each of the 54 stickers on the cube, minus 6 questions for each center sticker (I'm assuming the cube starts in a fixed orientation; if it doesn't, then add 2, because that's how many center stickers you need to know in order to know the cube's orientation), and minus 3 corner stickers and 2 edge stickers, since you can use the configuration of the other pieces to determine the exact position of the final corner and final edge. This would tell you where every piece is on the cube, and be sufficient for a BLD solve, or even a speedsolve, since we're given amazing deduction, piece tracking, and memory.
54 stickers - 6 centers - 3 corner stickers - 2 edge stickers =
43, plus 2 to determine center orientation if that isn't given =
45.
There are plenty of circumstances where you wouldn't need to know all three stickers on a piece to know what every sticker on that piece was, but I have no idea how to calculate how frequently you wouldn't have to know every sticker. I imagine it would vary a lot depending on how lucky you get with your questions. For example, if you've solving white cross, have solved three white corners already and you get lucky and ask about a particular corner sticker location and are told it's white, you know what the other stickers on that piece are immediately, with no further questions. If you don't get lucky, you'll have to ask more than one question about that specific piece. I imagine there are tons of tricks for getting as much information as possible out of what stickers you do know, and to deduce what the rest of the stickers would have to be, but I wouldn't even know where to begin with calculating what the minimum number of yes/no questions needed to solve the cube 100% of the time is.
One approach that I think technically should be allowed is filling in the colors of the cube, Soduku style. If you know 75% or so of the stickers on the cube, you could use your amazing deduction skills to make a list of every possible state the cube can be in; every possible way the 25% of the stickers you don't know the colors of could go on the cube in a way that makes the cube solvable. You could then find a solution to the cube in every one of those positions, and although you wouldn't know which of your many solutions was actually the solution to the cube, you would know that one of those many solutions does in fact solve the cube. In this case, you wouldn't need anywhere near 43 yes/no questions to solve the cube. This approach is a bit of a slippery slope, though, as it hypothetically would work without knowing any of the stickers. You'd know that one out of your 57 quintillion solutions solved the cube then as well.
I look forward to seeing a true puzzle theoretician get their hands on this question.
EDIT: ninja'd, but I'll leave the ideas here anyway even though some of them were already thought of.
The previous poster is right about only needing to know two corner stickers for each corner; that's a pretty simple mistake I made. I think that lowers my upper bound from 43 to 36, as you need one less corner sticker on each of the seven corners that aren't the final corner, which can be determined by the previous 7 corners alone.
EDIT2: Totally forgot about the yes/no aspect. I was thinking one word answers, not yes/no. So, this post is terribly flawed.