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

Detalles Bibliográficos
Publicado: 2018
Materias:
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v11324LNCS_n_p266_DiazCaro
http://hdl.handle.net/20.500.12110/paper_03029743_v11324LNCS_n_p266_DiazCaro
Aporte de:
id paper:paper_03029743_v11324LNCS_n_p266_DiazCaro
record_format dspace
spelling paper:paper_03029743_v11324LNCS_n_p266_DiazCaro2023-06-08T15:28:17Z Classically time-controlled quantum automata Bounded error Cutpoint language Quantum computing Quantum finite automata Time-dependent unitary evolution Finite automata Bounded errors Cut-point Quantum Computing Quantum finite automata Time dependent Quantum computers 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. 2018 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v11324LNCS_n_p266_DiazCaro http://hdl.handle.net/20.500.12110/paper_03029743_v11324LNCS_n_p266_DiazCaro
institution Universidad de Buenos Aires
institution_str I-28
repository_str R-134
collection Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
topic Bounded error
Cutpoint language
Quantum computing
Quantum finite automata
Time-dependent unitary evolution
Finite automata
Bounded errors
Cut-point
Quantum Computing
Quantum finite automata
Time dependent
Quantum computers
spellingShingle Bounded error
Cutpoint language
Quantum computing
Quantum finite automata
Time-dependent unitary evolution
Finite automata
Bounded errors
Cut-point
Quantum Computing
Quantum finite automata
Time dependent
Quantum computers
Classically time-controlled quantum automata
topic_facet Bounded error
Cutpoint language
Quantum computing
Quantum finite automata
Time-dependent unitary evolution
Finite automata
Bounded errors
Cut-point
Quantum Computing
Quantum finite automata
Time dependent
Quantum computers
description 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.
title Classically time-controlled quantum automata
title_short Classically time-controlled quantum automata
title_full Classically time-controlled quantum automata
title_fullStr Classically time-controlled quantum automata
title_full_unstemmed Classically time-controlled quantum automata
title_sort classically time-controlled quantum automata
publishDate 2018
url https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v11324LNCS_n_p266_DiazCaro
http://hdl.handle.net/20.500.12110/paper_03029743_v11324LNCS_n_p266_DiazCaro
_version_ 1768544594221334528