A foundation of programming a multi-tape quantum Turing machine

DOI10.1007/3-540-48340-3_39MaRDI QIDQ4941921zbMATH OpenFDO

Authors Tomoyuki Yamakami

Publication date 19 March 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48340-3_39

zbMATH Keywords

quantum complexity theoryquantum Turing machines

Mathematics Subject Classification ID

Quantum computation (81P68)

Recommendations

• Local transition functions of quantum Turing machines
• scientific article; zbMATH DE number 1379489
• Universality of quantum Turing machines with deterministic control
• scientific article; zbMATH DE number 2013798
• Quantum Complexity Theory

Cited in

(13)

• Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families
• Theory of one-tape linear-time Turing machines
• Quantum random access stored-program machines
• Quantum logical depth and shallowness of streaming data by one-way quantum finite-state transducers (preliminary report)
• Polynomial time quantum computation with advice
• Partial observation of quantum Turing machines and a weaker well-formedness condition
• scientific article; zbMATH DE number 1379489 (Why is no real title available?)
• Quantum finite automata: advances on Bertoni's ideas
• A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY
• How does adiabatic quantum computation fit into quantum automata theory?
• Expressing power of elementary quantum recursion schemes for quantum logarithmic-time computability
• Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions
• Quantum first-order logics that capture logarithmic-time/space quantum computability

This page was built for publication: A foundation of programming a multi-tape quantum Turing machine

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