# Tag Info

3

The Grover search is applied to the randomness that's fed into Schoning's algorithm. The randomness could be a big list of random bits, or for simplicity just a seed for a PRNG. You're searching over the seeds for one that causes Schoning's algorithm to succeed. Given an oracle (Schoning's algorithm) which accepts $(3/4)^n$ of its possible inputs, you only ...

2

Currently, I do not know of any quantum processor allowing to condition a quantum operation on results in a classical register. On IBM Q, it is possible to do so in simulator only. However, if you are dealing with quantum circuits like quantum teleportation or superdense coding, where you use such conditioning, you can simply use controlled quantum gates ...

2

Let me consider this example: if we have $|01\rangle$ then the circuit should give us at the output $|11\rangle$. Here I will try to show why I think this is impossible (by assuming that we don't do any measurements). Let's assume that we have the desired gate and we want to apply it to this state $\frac{1}{\sqrt{3}}(|00\rangle +|01\rangle - |11\rangle)$: $$... 2 This is a misconception. For example, people tends to say the Shor's factoring algorithm help us to do prime factor exponential faster than classical computer because the quantum computer will try out all the possible factors simultaneously then it will tells us the right answer at the end. In reality, the power of shor's algorithm is more subtle than that. ... 1 To roll up some of the comments thread, initially we can consider letting our state have N=2 qubits entangled in one of the Bell states corresponding to a uniform superposition of the positive sum of M=2 of the four "universal set" basis states on 2 qubits, say:$$\vert\Phi^+\rangle=\frac{1}{\sqrt{2}}(\vert 00\rangle+\vert 11\rangle). ...

1

Grover's Algorithm uses 2 simple tricks to search an unordered database (like a phonebook that contains names and phone numbers but not in alphabetical order). It inputs an equal superposition of all possible entries and searches the database in one operation. When it finds the matching entry, it marks it by flipping the sign of the wavefunction of this ...

1

I think it is similar to how Neural Networks are also good at handling noise (up to a certain threshold). VQE uses parameterized quantum circuit and hence it has the ability to adjust its parameters to absorb some of the noise. This is like how neural networks adjust their weights to absorb noise in the training data.

Only top voted, non community-wiki answers of a minimum length are eligible