Advice coins for classical and quantum computation
We study the power of classical and quantum algorithms equipped with nonuniform advice, in the form of a coin whose bias encodes useful information. This question takes on particular importance in the quantum case, due to a surprising result that we prove: a quantum finite automaton with just two st...
Main Authors: | , |
---|---|
Outros autores: | |
Formato: | Artigo |
Idioma: | en_US |
Publicado: |
Springer Berlin / Heidelberg
2012
|
Acceso en liña: | http://hdl.handle.net/1721.1/71224 https://orcid.org/0000-0003-1333-4045 |