Conventions for Quantum Pseudocode
Conventions for Quantum Pseudocode
Knill proposes reusable conventions for describing quantum algorithms in a QRAM model.
Paper information (1996 technical report; deposited on arXiv in 2022) — Emanuel Knill. Original paper
Work
This report asks how quantum pseudocode should be written and read so that one notation can describe an algorithm down to low-level quantum operations. It uses a quantum random access machine (QRAM) model, separates quantum data from classical control and measurement, and places those conventions between an algorithm sketch and a formal language. The arXiv record identifies the text as a 1996 report that was made available again in a modern format in 2022.
Contributions
- An early, relatively uniform set of conventions for quantum pseudocode.
- A way to make quantum operations and classical control explicit in one program description, including measurement and conditional operations.
- A notation intended to be formalizable and potentially usable as a basis for extending a conventional language.
Limits
This is a report about notation and program description, rather than a complete compiler, type system, or hardware implementation. QRAM is an idealized model; the report does not establish noise assumptions, gate costs, device connectivity, or a practical compilation pipeline. The 2022 arXiv record is a reissue of the older report, so citations should preserve both dates and the archive link.
Connections
The report supplies early vocabulary for later quantum-program descriptions. It can be compared with Quantum Programming, which develops guarded-command and probabilistic-programming ideas. Selinger's QPL language organizes syntax, types, and superoperator semantics as a language design, while van Tonder's quantum lambda calculus approaches related goals through functional calculus and equational reasoning.
Original paper
Emanuel Knill, Conventions for Quantum Pseudocode, LANL technical report LAUR-96-2724 (1996), reissued as arXiv:2211.02559.
No publication DOI has been confirmed for the original 1996 report. The 2022 arXiv deposit has the archive DOI 10.48550/arXiv.2211.02559. The year of the original work remains 1996.