Hybrid Quantum-Classical Workflow Calculator
Estimate how many circuit executions, how much quantum-processor time and how much wall-clock time a variational algorithm needs, including gradient evaluation, shots, job latency and classical optimiser time.
Results
- Circuits per iteration
- 810calculated
- Total circuit executions
- 1,62,000calculated
- Total shots
- 64,80,00,000calculated
- QPU time
- 2.3 daysestimated
- Wall-clock time
- 2.3 daysestimated
Parameter-shift gradients scale linearly with parameter count; SPSA trades gradient accuracy for far fewer circuits per iteration.
What it calculates
- Circuits per iteration
- Total circuit executions and shots
- QPU time
- Wall-clock time
- QPU cost
Worked example
Using the default inputs below; change any input above to recalculate.
| Variational parameters | 40 |
|---|---|
| Gradient method | Parameter shift (2 circuits per parameter) |
| Measurement groups (Hamiltonian terms grouped) | 10 |
| Optimiser iterations | 200 |
| Shots per circuit | 4000 |
| Time per shot (circuit + readout + reset) | 300 µs |
| Job latency per circuit batch | 200 ms |
| Classical optimiser time per iteration | 50 ms |
| QPU price per second (optional) | 0 ₹ |
| Circuits per iteration | 810 | calculated |
|---|---|---|
| Total circuit executions | 1,62,000 | calculated |
| Total shots | 64,80,00,000 | calculated |
| QPU time | 2.3 days | estimated |
| Wall-clock time | 2.3 days | estimated |
Methodology
Each iteration evaluates the cost function and its gradient. Parameter-shift needs two circuits per parameter; SPSA needs two per iteration. Every circuit is run for each measurement group, with the given shots. Wall-clock time adds per-iteration job latency and classical optimiser time.
Formulas
- Circuits
- C = iterations × groups × (gradient_circuits + 1)
- QPU time
- T_QPU = C × shots × t_shot
Assumptions
- One batched submission per iteration.
Limitations
- Queue waiting time on shared quantum services is not included.