scientific article; zbMATH DE number 1418357

zbMath0955.68048MaRDI QIDQ4941921

Tomoyuki Yamakami

Publication date: 19 March 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

quantum Turing machinesquantum complexity theory

Mathematics Subject Classification ID

Quantum computation (81P68)

Related Items (10)

Quantum logical depth and shallowness of streaming data by one-way quantum finite-state transducers (preliminary report) ⋮ Polynomial time quantum computation with advice ⋮ Expressing power of elementary quantum recursion schemes for quantum logarithmic-time computability ⋮ Quantum finite automata: advances on Bertoni's ideas ⋮ How does adiabatic quantum computation fit into quantum automata theory? ⋮ Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families ⋮ Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice ⋮ Partial Observation of Quantum Turing Machines and a Weaker Well-Formedness Condition ⋮ Theory of one-tape linear-time Turing machines ⋮ A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY

This page was built for publication: