Classically time-controlled quantum automata

0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we introduce classically time-controlled quantum automata or CTQA, which is a slight but reasonable modification of Moore-Crutchfield quantum finite automata that uses time-dependent evolution operators and a scheduler defining how long each operator will run. Surprisingly enough, time-dependent evolutions provide a significant change in the computational power of quantum automata with respect to a discrete quantum model. Furthermore, CTQA presents itself as a new model of computation that provides a different approach to a formal study of “classical control, quantum data” schemes in quantum computing.

Cite

CITATION STYLE

APA

Díaz-Caro, A., & Villagra, M. (2018). Classically time-controlled quantum automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11324 LNCS, pp. 266–278). Springer Verlag. https://doi.org/10.1007/978-3-030-04070-3_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free