Conventions for Quantum Pseudocode

E. Knill

Conventions for Quantum Pseudocode

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2211.02559 v1 pith:O74IIMNQ submitted 2022-11-04 quant-ph

E. Knill This is my paper · ORCID

classification quant-ph

keywords quantumconventionspseudocodeusedaccessalgorithmcomputingconsistent

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original abstract

A few conventions for thinking about and writing quantum pseudocode are proposed. The conventions can be used for presenting any quantum algorithm down to the lowest level and are consistent with a quantum random access machine (QRAM) model for quantum computing. In principle a formal version of quantum pseudocode could be used in a future extension of a conventional language.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Automated Expected Cost Analysis for Quantum Programs
cs.PL 2026-04 accept novelty 6.0 of 10

Qet fully automatically infers precise upper bounds on expected costs of mixed classical-quantum programs with mid-circuit measurements and loops via a term-based quantum expectation transformer.

Pith tools