BibTeX
CSL-JSON
MLA
Harvard
Quantum Recursion and Second Quantisation
release_at52ae6ssjhmpjjpdpsmefpeuy
by
Mingsheng Ying
Released
as a article
.
2014
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.
In text/plain
format
Archived Files and Locations
application/pdf 334.0 kB
file_dvmfqroz7jgnjh6tx6x3zq2m2i
|
arxiv.org (repository) web.archive.org (webarchive) |
Read Archived PDF
Preserved and Accessible
arXiv
1405.4443v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links