Quantum Computing Stack Exchange is a question and answer site for engineers, scientists, programmers, and computing professionals interested in quantum computing. It only takes a minute to sign up.
Sign up to join this community
In Qiskit, there are explicit transpile (where a circuit is transpiled to primitive gates) and backend.run (where the circuit is executed in either statevector simulation or real hardware) steps. What would be the equivalent in Cirq? In Cirq, you only have 1 API of simulator.simulate().
Note: I am executing my circuit multiple times under various parameters in a hybrid quantum-classical feedback loop algorithm. And so, using sweep is not possible.
You could play around with Cirq's transformers. Each transformer is a potential compilation step, such as decomposition into target gatesets, mapping/routing, and hardware-specific optimizations. There are several built-in transformers (including cirq.optimize_for_target_gateset, which may help with the transpilation into primitive gates that you mentioned), and you can also define your own custom transformers if you want something more complex.
See also this previous question on stackexchange.
cirq.optimize_for_target_gateset(circuit, gateset=ionq_gateset.IonQTargetGateset()), and this step alone is >45x slower than doing simulator.simulate() on the original circuit.
$\endgroup$
transpileandbackend.rundo in order to make the question self-contained. At minimum it should provide links, though these are discouraged since they can become dead reducing the future value of the post. As it stands, the post shifts the burden of figuring out what it is you're trying to do in cirq on the readers which further reduces its future value and your current chances of getting an answer. $\endgroup$