dc.contributorUniversidad Nacional de Asunción - Facultad Politécnica
dc.creatorDiaz, Alejandro
dc.creatorVillagra, Marcos
dc.date2022-04-27T18:41:37Z
dc.date2022-04-27T18:41:37Z
dc.date2018
dc.date.accessioned2023-09-25T13:30:03Z
dc.date.available2023-09-25T13:30:03Z
dc.identifierhttp://hdl.handle.net/20.500.14066/3727
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/8806497
dc.descriptionIn 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.
dc.descriptionCONACYT – Consejo Nacional de Ciencia y Tecnología
dc.descriptionPROCIENCIA
dc.languageeng
dc.relationPINV15-208
dc.rightsopen access
dc.subject4 Transporte, telecomunicaciones y otras infraestructuras
dc.subjectQUANTUM COMPUTING
dc.subjectQUANTUM FINITE AUTOMATA
dc.subjectTIME-DEPENDENT UNITARY EVOLUTION
dc.subjectBOUNDED ERROR
dc.subjectCUTPOINT LANGUAGE
dc.subjectCOMPUTACION
dc.titleClassically time-controlled quantum automata
dc.typeconference poster


Este ítem pertenece a la siguiente institución