Publication:4941921
From MaRDI portal
zbMath0955.68048MaRDI QIDQ4941921
Publication date: 19 March 2000
81P68: Quantum computation
Related Items
How does adiabatic quantum computation fit into quantum automata theory?, Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice, A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY, Expressing power of elementary quantum recursion schemes for quantum logarithmic-time computability, Quantum finite automata: advances on Bertoni's ideas, Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families, Theory of one-tape linear-time Turing 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