Pith. sign in

REVIEW 2 cited by

Defining Quantum Control Flow

Not yet reviewed by Pith; the record is open.

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 1209.4379 v1 pith:OZOZEA27 submitted 2012-09-19 quant-ph cs.LOcs.PL

classification quant-phcs.LOcs.PL
keywords quantumcontrolflowclassicaldefiningchoicesdifferenceflows
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

A remarkable difference between quantum and classical programs is that the control flow of the former can be either classical or quantum. One of the key issues in the theory of quantum programming languages is defining and understanding quantum control flow. A functional language with quantum control flow was defined by Altenkirch and Grattage [\textit{Proc. LICS'05}, pp. 249-258]. This paper extends their work, and we introduce a general quantum control structure by defining three new quantum program constructs, namely quantum guarded command, quantum choice and quantum recursion. We clarify the relation between quantum choices and probabilistic choices. An interesting difference between quantum recursions with classical control flows and with quantum control flows is revealed.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Laws of Quantum Programming

    cs.PL 2024-12 conditional novelty 7.0 of 10

    A formally verified collection of algebraic laws, normal forms, and a tail-recursion theorem for quantum programs, generalizing Hoare's classical laws.

  2. A Denotational Semantics for Quantum Loops

    cs.PL 2025-06 conditional novelty 4.0 of 10

    Quantum while loops get a denotational semantics as the strong limit of linear operators that discard the non-terminating part of the computation.

Pith tools