6533b86ffe1ef96bd12cdfcc

RESEARCH PRODUCT

Automata and Quantum Computing

Andris AmbainisAbuzer Yakary��lmaz

subject

FOS: Computer and information sciencesQuantum PhysicsTheoryofComputation_COMPUTATIONBYABSTRACTDEVICESFormal Languages and Automata Theory (cs.FL)FOS: Physical sciencesTheoryofComputation_GENERALComputer Science - Formal Languages and Automata TheoryComputational Complexity (cs.CC)68Q10 68Q12 68Q15 68Q19 68Q45Computer Science - Computational ComplexityTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESComputerSystemsOrganization_MISCELLANEOUSQuantum Physics (quant-ph)Computer Science::Formal Languages and Automata Theory

description

Quantum computing is a new model of computation, based on quantum physics. Quantum computers can be exponentially faster than conventional computers for problems such as factoring. Besides full-scale quantum computers, more restricted models such as quantum versions of finite automata have been studied. In this paper, we survey various models of quantum finite automata and their properties. We also provide some open questions and new directions for researchers. Keywords: quantum finite automata, probabilistic finite automata, nondeterminism, bounded error, unbounded error, state complexity, decidability and undecidability, computational complexity

http://arxiv.org/abs/1507.01988