Timeline for How to separate initializing qubits from runing algorithm several times
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 18, 2021 at 11:20 | comment | added | Tristan Nemoz♦ | @nckm You're right about that! This is why there is some research trying to determine what it the circuit depth of some algorithms (see here for instance: quantumcomputing.stackexchange.com/questions/21518/…). On the particular case of computing the power of a gate (which is the case here), there may be some optimization (for instance in Shor's) but there is none in general (see here: quantumcomputing.stackexchange.com/questions/11414/…) | |
| Oct 18, 2021 at 11:09 | vote | accept | nckm | ||
| Oct 18, 2021 at 11:09 | comment | added | nckm | Thanks for explaining this. But to be honest this is not what I expected to hear. My understanding is that gates are very expensive parts. I have FPGA development experience and in FPGA world logic elements in chip are also very expensive, but logic can have loopbacks, so cycles can be implemented. Unrolling circuit cycle in quantum computing probably should be very-very expensive. Seem in real world that way circuits would require thousands gates and thousands cycles. | |
| Oct 18, 2021 at 10:54 | comment | added | Tristan Nemoz♦ | @nckm Oh ok! I was misunderstanding what you meant. This is just an artifact to help drawing the circuit. The way to do that on a quantum computer is simply to repeat the gates. If you want to get the final circuit, you simply have to unroll the repetition step by concatenating the Oracle+Amplifier gates to itself as many times as required. | |
| Oct 18, 2021 at 10:43 | comment | added | Tristan Nemoz♦ | @nckm In the Qiskit's terminology, a "shot" is simply an execution of the algorithm. Running 1024 shots is going through the workflow I've described 1024 times, noting down the result you got each time. Is there something else that you don't understand? | |
| Oct 18, 2021 at 10:11 | comment | added | nckm | Sorry, I still do not understand. Or maybe I am wrong with terminology calling "shot" something which is not a really "shot" but part of algorithm circle. Can You please look at picture Grover algorithm. This picture I found in one article explaining Grover algorithm. This picture shows "repeate 3 times" oracle+amplifier. How to do that in quantum computer? Should I draw schema 3 times? Or what? I need a cicle here. What if algorithm is even more complex and I need repeate 1000 times? | |
| Oct 18, 2021 at 9:48 | history | answered | Tristan Nemoz♦ | CC BY-SA 4.0 |
