Quantum computation with write-only memory
From MaRDI portal
Publication:1761714
DOI10.1007/s11047-011-9270-0zbMath1251.68117arXiv1011.1201OpenAlexW3098706366MaRDI QIDQ1761714
Rūsiņš Freivalds, A. C. Cem Say, Ruben Agadzanyan, Abuzer Yakaryılmaz
Publication date: 15 November 2012
Published in: Lecture Notes in Computer Science, Natural Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1011.1201
quantum computationquantum Fourier transformquantum finite automatacounter automatawrite-only memory
Formal languages and automata (68Q45) Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items
Classical and Quantum Counter Automata on Promise Problems, Exact Affine Counter Automata, Superiority of exact quantum automata for promise problems, Unnamed Item, One-way reversible and quantum finite automata with advice, Quantum Pushdown Automata with Garbage Tape, TIGHT BOUNDS FOR THE SPACE COMPLEXITY OF NONREGULAR LANGUAGE RECOGNITION BY REAL-TIME MACHINES, Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice, Uncountable classical and quantum complexity classes, FINITE AUTOMATA WITH ADVICE TAPES
Cites Work
- Unbounded-error quantum computation with small space bounds
- A new family of nonstochastic languages
- Efficient probability amplification in two-way quantum finite automata
- A lower bound for the nondeterministic space complexity of context-free recognition
- Turing machines with sublogarithmic space
- Extending stochastic and quantum functions
- Quantum automata and quantum grammars
- Quantum versus deterministic counter automata
- One-way probabilistic reversible and quantum one-counter automata.
- On the complexity of simulating space-bounded quantum computations
- Determining the equivalence for one-way quantum finite automata
- Topological automata
- Various Aspects of Finite Quantum Automata
- Decidable and Undecidable Problems about Quantum Automata
- Computational Complexity
- A context-free language which is not acceptable by a probabilistic automaton
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
