Pith. sign in

REVIEW 1 cited by

Software science view on quantum circuit algorithms

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 2209.13731 v2 pith:SSKYMSU7 submitted 2022-09-27 quant-ph cs.LOcs.SEmath-phmath.MP

Yuri Gurevich , Andreas Blass This is my paper · ORCID
classification quant-phcs.LOcs.SEmath-phmath.MP
keywords algorithmscircuitquantumabstractionbelongdiagramsearlierinteractive
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We show that, on the abstraction level of quantum circuit diagrams, quantum circuit algorithms belong to the species of interactive sequential algorithms that we studied in earlier work. This observation leads to a natural specification language for quantum circuit algorithms.

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

  1. Basic interactive algorithms: Preview

    cs.LO 2025-08 unverdicted novelty 3.0 of 10

    The paper previews an upcoming axiomatization in which probabilistic and quantum algorithms are modeled as basic sequential algorithms with oracles, extending the classical abstract state machine thesis.

Pith tools