- #1
Ricardo Belchior
- 13
- 0
Hi!
So I'm studying Gover's Algorithm and I have this doubt:
Does 'Phase inversion gate' grows exponentially? I mean, if I want to signal the one combination that is the answer, I must be able to represent all 2^N states, where N is the number of qubits in the system. How do I do this without representing all states?
Cheers,
RB
So I'm studying Gover's Algorithm and I have this doubt:
Does 'Phase inversion gate' grows exponentially? I mean, if I want to signal the one combination that is the answer, I must be able to represent all 2^N states, where N is the number of qubits in the system. How do I do this without representing all states?
Cheers,
RB