Classically time-controlled quantum automata

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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Díaz-Caro, A., Villagra, M., Martin-Vide C., Vega-Rodriguez M.A., Fagan D., O'Neill M.
Formato: SER
Materias:
Bounded error
Cutpoint language
Quantum computing
Quantum finite automata
Time-dependent unitary evolution
Finite automata
Bounded errors
Cut-point
Quantum Computing
Time dependent
Quantum computers
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_03029743_v11324LNCS_n_p266_DiazCaro
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires
Descripción
Sumario: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. © 2018, Springer Nature Switzerland AG.

Ejemplares similares