{ "_meta": { "locale": "en", "area": "workbench", "translation": "source" }, "workbench.measure_depth": "depth", "workbench.measure_two_qubit": "two-qubit gates", "workbench.measure_t_count": "T gates", "workbench.measure_gates": "gates", "workbench.measure_two_qubit_depth": "two-qubit depth", "workbench.measure_one_qubit": "one-qubit gates", "workbench.measure_three_qubit": "three-qubit gates", "workbench.measure_non_clifford": "non-Clifford gates", "workbench.measure_qubits": "qubits", "workbench.sizes_name_each": "name each input: {list}", "workbench.sizes_no_input": "the program takes no input {name}; it takes {names}", "workbench.sizes_whole": "{name}: whole numbers, 0 or more, as {name} = 3, 5, 8", "workbench.sizes_missing": "give values for {names}", "workbench.cost_needs_weight": "give a weight above 0 to at least one measure of the cost", "workbench.map_label": "The archive: {n} cells by {x} and {y}", "workbench.point_label": "{id}, by {proposer}: cost {cost}, {x} and {y}", "workbench.point_title": "{id} ({proposer}): cost {cost}", "workbench.outcome_duplicate": "{who}: seen before, not evaluated again", "workbench.outcome_not_verified": "{who}: not verified: {failure}", "workbench.outcome_did_not_read": "it did not read", "workbench.outcome_improvement": "{who}: kept as {id}, cheaper than every generator before it (cost {cost})", "workbench.outcome_kept": "{who}: kept as {id}, the best of its cell (cost {cost})", "workbench.outcome_verified": "{who}: verified (cost {cost}), but its cell already holds one as cheap", "workbench.start": "Start", "workbench.start_title": "A new archive, seeded with the program in the editor as the reference", "workbench.task_label": "What each member must do", "workbench.task_prepares": "prepare the same state from |0…0⟩", "workbench.task_equivalent": "be the same circuit (unitary)", "workbench.sizes_label": "The sizes to check at", "workbench.gates_any": "any", "workbench.gates_label": "The gates a proposal may use", "workbench.conn_label": "Which qubits a gate may join", "workbench.conn_all": "any pair", "workbench.conn_line": "neighbours on a line", "workbench.weight_label": "the cost's weight on {measure}", "workbench.axis_first": "The map’s first axis", "workbench.axis_second": "The map’s second axis", "workbench.spec": "The specification", "workbench.each_member_must": "Each member must", "workbench.checked_at": "checked at", "workbench.using": "using", "workbench.on": "on", "workbench.cost_summed": "Cost, summed over the sizes:", "workbench.map": "Map", "workbench.against": "against", "workbench.search": "Search ×100", "workbench.search_title": "The built-in, blind search: a hundred seeded edits of the archive’s best, each checked by the engine", "workbench.ask": "Ask the model ×3", "workbench.ask_title": "Three generators from the model, from the archive’s best; the engine judges each", "workbench.submit": "Submit the editor’s program", "workbench.submit_title": "The program in the editor, judged and kept if it is the best of its cell", "workbench.download": "Download", "workbench.download_title": "The specification and its archive, every kept generator with its sealed verdict, for wai-quantum discover verify", "workbench.intro": "Write a generator in the editor (a program with input uint n;), say what each member of its family must do and what it costs, and start. A program with no inputs works too: one circuit, one size.", "workbench.title": "Workbench", "workbench.stats_energy": ", {joules} J", "workbench.improvement_one": "{n} improvement", "workbench.improvement_many": "{n} improvements", "workbench.stats": "{evaluations} evaluated, {verified} verified, {kept} kept, {improvements}{energy}. ", "workbench.stats_best": "Best {id}: cost {cost} against the reference’s {reference}, by {proposer}, checked by {strength}.", "workbench.open": "Open in editor", "workbench.entry_title": "{id} · cost {cost} · {x_measure} {x_value}, {y_measure} {y_value}", "workbench.checked_by": "checked by {strength}{sealed}", "workbench.sealed": ", sealed", "workbench.lineage": "Where it came from", "workbench.its_generator": "Its generator", "workbench.checking_reference": "The engine is checking the reference at every size…", "workbench.started": "Started: the reference is {id}, cost {cost}.", "workbench.loosened": "The specification now {change}. This archive was built under the old rule; start a new one to search under the new.", "workbench.loosened_allows": "allows {gate}", "workbench.loosened_any_pair": "lets a gate join any pair", "workbench.novelty_said": "{id}: {text}.", "workbench.aberration_uses": "it uses {gate}", "workbench.aberration_joins": "it joins qubits that are not neighbours", "workbench.aberration_breaks": "it breaks a rule", "workbench.aberration_why": "It breaks only one rule ({rule}); without it, it would be verified ({strength}) at cost {cost}, {x_measure} {x_value}, {y_measure} {y_value}.", "workbench.try_without": "Try without that rule", "workbench.aberration_said": "{who}: an aberration. {why} The rule may be worth revising. ", "workbench.search_progress": "The blind search: {done} of {total} edits judged…", "workbench.search_done": "The blind search: {total} edits judged, {kept} kept.", "workbench.search_find_said": "{id} (the blind search): {text}.", "workbench.search_find_title": "{id} (the blind search): {text}", "workbench.search_stopped": "The search stopped: {error}", "workbench.paused": "You are exploring on your own: the model waits until you end that under Versions.", "workbench.needs_model": "Ask the model needs one: connect it under “Model…” in the Assistant.", "workbench.model_proposing": "The model is proposing; the engine will judge each…", "workbench.model_wrote_none": "The model wrote no generator in a ```qasm block.", "workbench.an_idea": "an idea", "workbench.model_failed": "The model did not answer: {error}", "workbench.your_program": "Your program", "workbench.not_judged": "It could not be judged: {error}", "workbench.saved": "Saved {path} and its archive; wai-quantum discover verify {stem}.json checks every seal.", "workbench.not_saved": "It could not be saved: {error}", "workbench.resumed": "Taken up again: {n} evaluated so far." }