Software science view on quantum circuit algorithms
Yuri Gurevich, Andreas Blass
TL;DR
This paper presents a new perspective on quantum circuit algorithms by classifying them as a type of interactive sequential algorithms, enabling a natural specification language at the diagram level.
Contribution
It introduces a novel abstraction linking quantum circuit algorithms to interactive sequential algorithms, facilitating formal specification.
Findings
Quantum circuit algorithms can be viewed as interactive sequential algorithms.
A natural specification language for quantum circuit algorithms is proposed.
The approach bridges quantum computing and formal algorithm specifications.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Quantum Computing Algorithms and Architecture · Cloud Computing and Resource Management