The Power of a Single Qubit: Two-way Quantum Finite Automata and the Word Problem

@inproceedings{Remscrim2020ThePO,
  title={The Power of a Single Qubit: Two-way Quantum Finite Automata and the Word Problem},
  author={Zachary Remscrim},
  booktitle={ICALP},
  year={2020}
}
  • Zachary Remscrim
  • Published in ICALP 2020
  • Computer Science, Mathematics, Physics
  • The two-way finite automaton with quantum and classical states (2QCFA), defined by Ambainis and Watrous, is a model of quantum computation whose quantum part is extremely limited; however, as they showed, 2QCFA are surprisingly powerful: a 2QCFA, with a single qubit, can recognize, with bounded error, the language $L_{eq}=\{a^m b^m :m \in \mathbb{N}\}$ in expected polynomial time and the language $L_{pal}=\{w \in \{a,b\}^*:w \text{ is a palindrome}\}$ in expected exponential time. We further… CONTINUE READING

    Citations

    Publications citing this paper.

    Eliminating Intermediate Measurements in Space-Bounded Quantum Computation

    VIEW 1 EXCERPT
    CITES BACKGROUND

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 52 REFERENCES

    On the power of quantum finite state automata

    VIEW 1 EXCERPT

    Succinctness of two-way probabilistic and quantum finite automata

    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    Characterizations of 1-Way Quantum Finite Automata

    VIEW 12 EXCERPTS
    HIGHLY INFLUENTIAL

    Languages recognized by nondeterministic quantum finite automata

    VIEW 1 EXCERPT

    Magic coins are useful for small-space quantum machines

    VIEW 1 EXCERPT

    Quantum automata and quantum grammars

    VIEW 3 EXCERPTS