Quantum resource estimation asks whether a proposed algorithm fits within a hardware architecture. The output is not one qubit count. A credible estimate covers logical computation, error correction, control, measurement, data loading, and runtime.
Estimates matter because a circuit that fits on paper might need too many correction cycles, magic states, measurements, or classical decoder operations for a real machine.
Start with the algorithm
Record the algorithm's input size, output precision, success probability, oracle cost, arithmetic operations, and repeat count. A resource estimate for factoring, chemistry, or amplitude estimation changes sharply when precision changes.
Use a symbolic input size first. Replace n with a target problem size only after the circuit structure is clear. A small demonstration often hides costs which grow fastest.
Logical qubits and logical gates
Logical qubits store protected states. Physical qubits implement the code. The estimate needs both:
- Logical data qubits for the algorithm state.
- Logical ancilla qubits for temporary values and checks.
- Logical work qubits for arithmetic, lookup, and control.
- Physical qubits per logical qubit from the selected code.
- Extra physical qubits for syndrome measurement and factories.
A vendor's physical qubit count does not reveal how many logical qubits a workload receives. The logical qubits guide explains why.
Circuit depth and two-qubit gates
Circuit depth counts sequential layers. Two circuits with equal gate count might have different runtime because parallel operations share a layer or conflict on hardware connectivity.
Track at least:
- Total gate count.
- Single-qubit gate count.
- Two-qubit gate count.
- Depth before and after routing.
- Measurement layers.
- Non-Clifford gate count.
- Maximum live qubit count.
Routing often adds SWAP gates. Scheduling adds idle time. Both affect logical error probability and wall-clock runtime.
T-count and T-depth
Clifford gates alone do not support universal quantum computation. T gates or another non-Clifford resource supplies the missing power in many fault-tolerant designs.
T-count measures total non-Clifford work. T-depth measures sequential non-Clifford layers. T-count drives magic-state factory demand. T-depth affects how long factories and data qubits must stay active.
A circuit with low logical qubit count but huge T-count might need more factories than data qubits. Factories prepare high-fidelity magic states, consume physical resources, and often dominate the architecture.
Error-correction overhead
Choose a code, physical gate error model, measurement error model, leakage model, target logical error rate, and code distance. Then estimate physical qubits and correction cycles.
A useful estimate reports:
- Physical qubits per logical qubit.
- Logical error per cycle.
- Syndrome measurement duration.
- Decoder latency.
- Factory count and factory footprint.
- Memory and communication links.
- Margin below the code threshold.
A threshold is a boundary under a specific model. Operating below threshold does not mean a machine has reached a useful logical error rate. Code distance and cycle count still decide the final failure probability.
Shots and success probability
Near-term algorithms often repeat a circuit many times. Each repetition is a shot. Required shots rise when the observable has high variance, the success event is rare, or the desired confidence is strict.
A resource estimate should separate circuit execution from sampling overhead. Ten thousand shots on one circuit is different from ten thousand optimizer evaluations, each requiring thousands of shots.
Include confidence intervals, failed jobs, readout mitigation, and post-selection. Error mitigation often increases sampling cost even when physical circuit depth stays fixed.
Data loading and oracle cost
Input preparation often dominates algorithm descriptions. State preparation, amplitude loading, QRAM assumptions, lookup tables, and reversible arithmetic all need explicit circuits.
An oracle is not a free black box. Count its qubits, gates, depth, controls, uncomputation steps, and calls inside the main algorithm. A quadratic query advantage loses meaning when each query carries a large data-loading circuit.
From resources to runtime
Convert logical cycles into time:
runtime = correction cycles × cycle duration + measurement + reset + classical coordination
Add queue time and calibration time for cloud experiments. Add communication delay for modular machines. Add repeated runs for confidence and workload batches for production.
Near-term estimates also need classical optimization time. VQE and QAOA place a classical optimizer around the quantum circuit. A short quantum kernel does not imply a short complete workflow.
A practical estimation workflow
- Define input size, precision, success probability, and output format.
- Build a logical circuit with explicit oracles and arithmetic.
- Count qubits, depth, two-qubit gates, T-count, and measurements.
- Select a code and target logical error rate.
- Add syndrome qubits, decoders, and magic-state factories.
- Map logical operations to hardware connectivity.
- Convert cycles into runtime, power, and cost.
- Repeat under optimistic, central, and conservative assumptions.
Report ranges rather than one precise number. Precision without verified hardware assumptions creates false confidence.
For current hardware context, compare quantum processors by qubit count, the error-decoding bottleneck, and the quantum computing roadmap.