- #1
dreamspy
- 41
- 3
How would this operator be implemented physically if we had a quantum computer?
In Grover's algorithm this magical operator is often called "phase inversion". Here is the operator from wiki:
https://wikimedia.org/api/rest_v1/media/math/render/svg/07fb23bffa787430b084971c6a108a8f6ff6c2b3
It’s an operator that does nothing to most of the states, except it inverts the phase of the states we’re looking for. (for all states x where f(x) = 1).
I assume we are using the feature of quantum mechanics that we can input a superposition of all possible states, and acting upon them all at the same time with our operators, then at the end, measuring the state of the system, giving us the state we're looking for with high probability (p > 1/2).
So I repeat my question:
How would this operator be implemented physically if we had a quantum computer?
Thanks
Frímann Kjerúlf
BSc Physics - University of Iceland
In Grover's algorithm this magical operator is often called "phase inversion". Here is the operator from wiki:
https://wikimedia.org/api/rest_v1/media/math/render/svg/07fb23bffa787430b084971c6a108a8f6ff6c2b3
It’s an operator that does nothing to most of the states, except it inverts the phase of the states we’re looking for. (for all states x where f(x) = 1).
I assume we are using the feature of quantum mechanics that we can input a superposition of all possible states, and acting upon them all at the same time with our operators, then at the end, measuring the state of the system, giving us the state we're looking for with high probability (p > 1/2).
So I repeat my question:
How would this operator be implemented physically if we had a quantum computer?
Thanks
Frímann Kjerúlf
BSc Physics - University of Iceland