Quick Navigation

Topics

Quantum Entropy Information Measures Quantum Circuit Design Gate Engineering Quantum Optimization Entanglement Theory Quantum Correlations

New results on classical and quantum counter automata

arXiv
Authors: Masaki Nakanishi, Abuzer Yakaryılmaz, Aida Gainutdinova

Year

2014

Paper ID

45776

Status

Preprint

Abstract Read

~2 min

Abstract Words

100

Citations

N/A

Abstract

We show that one-way quantum one-counter automaton with zero-error is more powerful than its probabilistic counterpart on promise problems. Then, we obtain a similar separation result between Las Vegas one-way probabilistic one-counter automaton and one-way deterministic one-counter automaton. We also obtain new results on classical counter automata regarding language recognition. It was conjectured that one-way probabilistic one blind-counter automata cannot recognize Kleene closure of equality language [A. Yakaryilmaz: Superiority of one-way and realtime quantum machines. RAIRO - Theor. Inf. and Applic. 46(4): 615-641 (2012)]. We show that this conjecture is false, and also show several separation results for blind/non-blind counter automata.

Why This Paper Matters

  • This paper contributes to the Entanglement Theory & Quantum Correlations research area in the Quantum Articles archive.
  • It adds a 2014 reference point for readers tracking recent quantum research.
  • We show that one-way quantum one-counter automaton with zero-error is more powerful than its probabilistic counterpart on promise problems.

Paper Tools

Become a member to use research tools

Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.

Show Paper arXiv Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

Local Citation Graph (Related-Paper Links)

Current Paper #45776

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0
Likes: 0 Dislikes: 0

Sign in to react to this paper.

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.