Expressing power of elementary quantum recursion schemes for quantum logarithmic-time computability

DOI10.1007/978-3-031-15298-6_6OpenAlexW4297809257MaRDI QIDQ6102995

Tomoyuki Yamakami

Publication date: 2 June 2023

Published in: Logic, Language, Information, and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-15298-6_6

zbMATH Keywords

quantum Turing machineschematic definitionfast quantum recursionquantum logarithmic-time computability

Mathematics Subject Classification ID

Logic in computer science (03B70)

Cites Work

• Unnamed Item
• Unnamed Item
• Theory of one-tape linear-time Turing machines
• The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
• On uniformity within \(NC^ 1\)
• General recursive functions of natural numbers
• Quantum computational networks
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Quantum lower bounds by polynomials
• Computability and Recursion
• ANALYSIS OF QUANTUM FUNCTIONS
• Recursive Predicates and Quantifiers
• A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY

This page was built for publication: Expressing power of elementary quantum recursion schemes for quantum logarithmic-time computability