I'm trying to figure out what is the computational complexity of initializing a quantum register of N qubits.
For my research, I have used the initialize method of qiskit, in which you set the amplitudes of the 2^N basis states to get the desired quantum state. The point is that I can't find a reference that discusses the cost of such an operation. Moreover, if we consider a standard Grover's algorithm, why the initialization of a uniform superposition of basis states is not counted in the complexity?
initialize
method probably simply initializes the simulator with the statevector you give it. I doubt it implements the requisite circuit at all, and you shouldn't rely upon it when developing an algorithm for use in quantum hardware. $\endgroup$Instruction
since it contains resets at the beginning, but these can be removed when sending the circuit to a real device since anyways the initial state of the hardware is the ground state. But yes, there are definitely more efficient methods depending on the exact algorithm they are developing. $\endgroup$