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.
Software science view on quantum circuit algorithms
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.
fields
cs.LO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Basic interactive algorithms: Preview
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.