I am currently working on the algorithm of Deutsch. The algorithm defines two starting states, which are for $|x\rangle = |0\rangle$ and for $|y\rangle = |1\rangle$. So far, that's clear to me. But what would happen if you change the input bits, lets say the qubits are initially in the state: $|x\rangle = |0\rangle$ and $ |y\rangle = |0\rangle$, what are the implications for the algorithm? And what would happen, if the bits in the original algorithm were switched: $|x\rangle = |1\rangle$ and for $|y\rangle = |0\rangle$ does the last idea just switch the last bit in the final states?
Suppose the input bits are 0 and 0 (according to my calculation): I apply the H matrix to both input bits: $$ H(|0\rangle)H(|0\rangle)=|+\rangle\cdot|+\rangle$$ $$=\frac{1}{2}(|00\rangle+|01\rangle+|10\rangle+|11\rangle)$$ By $f'$ I mean the negation of $f$ $$\frac{1}{2}(|0,f(0)\rangle+|0,f'(0)\rangle+|1,f(1)\rangle+|1,f'(1)\rangle))$$ Now let's say $ f (0) = f (1) $ (constant) then: $$\frac{1}{2}((|0\rangle+|1\rangle)(|f(0)\rangle+|f'(0)\rangle))$$ But what would happen if $ f (0) = f '(1)$ (balanced)?
I hope that my question has come across as understandable.