Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions

DOI10.1017/s0960129524000264MaRDI QIDQ6646016

Tomoyuki Yamakami

Publication date: 29 November 2024

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

zbMATH Keywords

divide-and-conquer strategyquantum Turing machinefast quantum recursionquanum polylogarithmic-time computabilityrecursion schematic definition

Mathematics Subject Classification ID

Computer science (68-XX)

This page was built for publication: Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6646016)