Quantum Recursive Programming with Quantum Case Statements
Programming Languages
2023-11-06 v1 Logic in Computer Science
Quantum Physics
Abstract
We introduce a novel scheme of quantum recursive programming, in which large unitary transformations, i.e. quantum gates, can be recursively defined using quantum case statements, which are quantum counterparts of conditionals and case statements extensively used in classical programming. A simple programming language for supporting this kind of quantum recursion is defined, and its semantics is formally described. A series of examples are presented to show that some quantum algorithms can be elegantly written as quantum recursive programs.
Cite
@article{arxiv.2311.01725,
title = {Quantum Recursive Programming with Quantum Case Statements},
author = {Mingsheng Ying and Zhicheng Zhang},
journal= {arXiv preprint arXiv:2311.01725},
year = {2023}
}