Quantum Recursion and Second Quantisation
classification
🪐 quant-ph
cs.LOcs.PL
keywords
quantumrecursionquantisationsecondwalksclassicalcomputationconsidered
pith:W336UQYJ Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{W336UQYJ}
Prints a linked pith:W336UQYJ badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original abstract
This paper introduces a new notion of quantum recursion of which the control flow of the computation is quantum rather than classical as in the notions of recursion considered in the previous studies of quantum programming. A typical example is recursive quantum walks, which are obtained by slightly modifying the construction of the ordinary quantum walks. The operational and denotational semantics of quantum recursions are defined by employing the second quantisation method, and they are proved to be equivalent.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.