get_ccz2t_costs_from_grid_search#
View source on GitHub
|
Grid search over parameters to minimize the space-time volume.
qualtran.surface_code.get_ccz2t_costs_from_grid_search(
*,
n_logical_gates: 'GateCounts',
n_algo_qubits: int,
phys_err: float = 0.001,
error_budget: float = 0.01,
cycle_time_us: float = 1.0,
factory_iter: Iterable[qualtran.surface_code.MagicStateFactory] = tuple(iter_ccz2t_factories()),
data_block_iter: Iterable[qualtran.surface_code.DataBlock] = tuple(iter_simple_data_blocks()),
cost_function: Callable[[qualtran.surface_code.PhysicalCostsSummary], float] = (lambda pc: pc.qubit_hours)
) -> Tuple[qualtran.surface_code.PhysicalCostsSummary, qualtran.surface_code.MagicStateFactory, qualtran.surface_code.SimpleDataBlock]
Args
n_logical_gatesNumber of algorithm logical gates.
n_algo_qubitsNumber of algorithm logical qubits.
phys_errThe physical error rate of the device. This sets the suppression factor for increasing code distance.
error_budgetThe acceptable chance of an error occurring at any point. This includes data storage failures as well as top-level distillation failure.
cycle_time_usThe number of microseconds it takes to execute a surface code cycle.
factory_iteriterable containing the instances of MagicStateFactory to search over.
data_block_iteriterable containing the instances of SimpleDataBlock to search over.
cost_functionfunction of PhysicalCostsSummary to be minimized. Defaults to spacetime volume. Set
cost_function = (lambda pc: pc.duration_hr)to mimimize wall time.
View source on GitHub