There is a famous paper by Childs, et al, in which it is shown that a quantum algorithm can find the name of the exit node for a certain graph in a way that is exponentially faster than any classical algorithm. This speedup assumes an oracle that tells you which nodes are connected to a given nod...

Last time I modelled the Groover search algorithm with Pyquil from Rigetti. It works on simulator. My question is, if it is possible to use this algorithm for a real search problem (yes I know, Quantum computers still far apart from performance to do) in databases or files - theoretically, or is ...

I am trying to understand the grover algorithm. I did read, that this algorithm is able to find an entry in an unsorted list in just $\sqrt N$ steps and needs only $\log N$ space. I understand entanglement and superposition, and I also understand most parts of Shor's Algorithm. But when it comes...

Wikipedia states that a controlled U gate maps the basis states to the following: $$ |00\rangle \mapsto |00\rangle\\ |01\rangle \mapsto |01\rangle\\ |10\rangle \mapsto |1 \rangle \otimes U |0 \rangle = |1 \rangle \otimes \left(u_{00}|0 \rangle + u_{10}|1 \rangle\right)\\ |11\rangle \maps...