Manuscript En02-B@1 · En02-B-v1.tex · definition · ca28dee4

Definition: Decoder decomposition and frontier

A finite perfect-code tree and decoder schedules › A general finite scheduling recurrence · lines 1474–1490

En02-B@1#def:frontier

Back to manuscript

A declared decomposition is a finite acyclic collection of modules. Module consumes named input qubits, produces named output qubits, and has a certified local peak . Classical dependencies are specified separately. There is no quantum fanout.

For a legal completed-module set and delivered input prefix , let be the live quantum frontier. Executing an enabled module has laboratory peak at most

and replaces its input names by its output names. A delivery increases the frontier by one.

Displayed formulas in this passage

  • unlabeled · line 1485

Nearby in this section