Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Stephen Z. D. Plachta"'
Publikováno v:
Quantum, Vol 6, p 752 (2022)
Quantum finite automata (QFA) are basic computational devices that make binary decisions using quantum operations. They are known to be exponentially memory efficient compared to their classical counterparts. Here, we demonstrate an experimental impl
Externí odkaz:
https://doaj.org/article/c6309721d6b44372af080199113142e3
