-2
$\begingroup$

I want to know what happens to the time complexity in terms of big O analysis

$\endgroup$
3
$\begingroup$

Number of shots tells you how many times you repeat algorithm run. It is not connected with a complexity of algorithm itself.

Running time of simulation depends on number of shots linearly, so something what you can call "total complexity" is given by complexity of an algorithm multiplied by number of shots.

| improve this answer | |
$\endgroup$

Not the answer you're looking for? Browse other questions tagged or ask your own question.