# 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

## Eliminating Intermediate Measurements in Space-Bounded Quantum Computation

• Computer Science, Physics, Mathematics
• Electronic Colloquium on Computational Complexity
• 2020
VIEW 1 EXCERPT
CITES BACKGROUND

#### References

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

## Lower Bounds on the Running Time of Two-Way Quantum Finite Automata and Sublogarithmic-Space Quantum Turing Machines

VIEW 5 EXCERPTS

## Two-Tape Finite Automata with Quantum and Classical States

• Physics
• 2011
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

## On the power of quantum finite state automata

• Mathematics, Computer Science
• Proceedings 38th Annual Symposium on Foundations of Computer Science
• 1997
VIEW 1 EXCERPT

## Dense quantum coding and quantum finite automata

• Computer Science
• JACM
• 2002
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

## Succinctness of two-way probabilistic and quantum finite automata

• Mathematics, Computer Science
• Discret. Math. Theor. Comput. Sci.
• 2010
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

## Characterizations of 1-Way Quantum Finite Automata

• Mathematics, Computer Science, Physics
• SIAM J. Comput.
• 2002
VIEW 12 EXCERPTS
HIGHLY INFLUENTIAL

## A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata

• Mathematics, Computer Science
• SIAM J. Comput.
• 1990
VIEW 1 EXCERPT

## Languages recognized by nondeterministic quantum finite automata

• Mathematics, Computer Science
• Quantum Inf. Comput.
• 2010
VIEW 1 EXCERPT

## Magic coins are useful for small-space quantum machines

• Mathematics, Computer Science, Physics
• Quantum Inf. Comput.
• 2017
VIEW 1 EXCERPT

## Quantum automata and quantum grammars

• Mathematics, Physics, Computer Science
• Theor. Comput. Sci.
• 2000
VIEW 3 EXCERPTS