generate_frontier
Generate the Pareto frontier of qubit count vs. runtime for quantum algorithms. Explore trade-offs to find configurations balanced for resource constraints and time budgets.
Instructions
Generate the Pareto frontier: qubit-count vs. runtime tradeoff for an algorithm.
Provide the algorithm as exactly one of algorithm_template, logical_counts, or qsharp_code.
Returns a list of Pareto-optimal points. Each point represents a configuration where you cannot reduce qubit count without increasing runtime, or vice versa.
First point: minimum qubit count (longest runtime)
Last point: minimum runtime (most qubits)
Optional qubit/QEC overrides (same as estimate_resources):
qubit_model_overrides: JSON string to override specific qubit parameters.
qec_crossing_prefactor, qec_error_correction_threshold: float overrides.
qec_logical_cycle_time, qec_physical_qubits_per_logical: formula string overrides.
Useful for understanding hardware requirements at different time budgets.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| algorithm_template | No | ||
| logical_counts | No | ||
| qsharp_code | No | ||
| qubit_model | No | qubit_gate_ns_e3 | |
| qec_scheme | No | surface_code | |
| error_budget | No | ||
| qubit_model_overrides | No | ||
| qec_crossing_prefactor | No | ||
| qec_error_correction_threshold | No | ||
| qec_logical_cycle_time | No | ||
| qec_physical_qubits_per_logical | No |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
No arguments | |||