Relativizations of nonuniform quantum finite automata families
From MaRDI portal
Publication:2326825
DOI10.1007/978-3-030-19311-9_20OpenAlexW2944963992MaRDI QIDQ2326825
Publication date: 10 October 2019
Full work available at URL: https://doi.org/10.1007/978-3-030-19311-9_20
Turing reducibilityquantum finite automatapromise problemsnonuniform state complexityoracle finite automata
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Quantum logical depth and shallowness of streaming data by one-way quantum finite-state transducers (preliminary report) ⋮ Unambiguity and fewness for nonuniform families of polynomial-size nondeterministic finite automata ⋮ 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
This page was built for publication: Relativizations of nonuniform quantum finite automata families
