Skip to content
GIRIVON
Infrastructure+
Systems+
Components+
Computing Devices+
Solutions+
Compute Tools+
Knowledge+

Quantum Circuit Resource & Depth Estimator

Estimate a circuit's depth lower bound, run time, success probability from gate and readout errors, and the number of shots needed to estimate an expectation value to a given precision.

1.0 for all-to-all connectivity; higher for limited connectivity where SWAPs are inserted.

Results

Effective two-qubit gates
150
Depth lower bound15 two-qubit layers + 20 single-qubit layers
35
Circuit run time (lower bound)
2 µs
Estimated success probability
31.57%
Shots for ±0.01Before error mitigation overheads
10,000

What it calculates

  • Effective two-qubit gate count
  • Depth lower bound
  • Circuit run time
  • Estimated success probability
  • Shots for target precision

Worked example

Using the default inputs below; change any input above to recalculate.

Inputs
Qubits20
Single-qubit gates400
Two-qubit gates150
Routing overhead (two-qubit gates)1
Single-qubit gate error0.0005
Two-qubit gate error0.005
Readout error per qubit0.01
Single-qubit gate time25 ns
Two-qubit gate time60 ns
Measurement time600 ns
Target precision of an expectation value0.01
Results
Effective two-qubit gates150calculated
Depth lower bound35calculated
Circuit run time (lower bound)2 µsestimated
Estimated success probability31.57%estimated
Shots for ±0.0110,000calculated

Methodology

Depth is bounded below by packing gates in parallel: at most ⌊n/2⌋ two-qubit gates and n single-qubit gates per layer. Success probability is the product of per-operation fidelities, a standard first-order model. For an observable with values in [−1, 1], estimating its mean to precision ε needs about 1/ε² shots.

Formulas

Depth bound
D ≥ ⌈g₂·r ÷ ⌊n/2⌋⌉ + ⌈g₁ ÷ n⌉
Success
F ≈ (1−e₁)^g₁ (1−e₂)^(g₂·r) (1−e_m)^n
Shots
N ≈ 1 ÷ ε²

Assumptions

  • Independent, uncorrelated errors.
  • Perfect gate parallelism for the depth bound.

Limitations

  • Decoherence during idle time and crosstalk are not modelled.
  • Routing overhead is your input.