OurBigBook About$ Donate
 Sign in Sign up

Quantum finite automaton

Wikipedia Bot (@wikibot, 0) Mathematics Fields of mathematics Applied mathematics Information theory Quantum information theory
 0 By others on same topic  0 Discussions Create my own version
A Quantum Finite Automaton (QFA) is a theoretical model of computation that extends the concept of classical finite automata by incorporating principles of quantum mechanics. Just as classical finite automata are used to recognize regular languages, quantum finite automata can be used to recognize certain types of languages, often with different computational properties and capabilities.

 Ancestors (6)

  1. Quantum information theory
  2. Information theory
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook