Quantum finite automaton

In quantum computing, quantum finite automata (QFA) or quantum state machines are a quantum analog of probabilistic automata or a Markov decision process. They provide a mathematical abstraction of real-world quantum computers.

Source: Wikipedia — Quantum finite automaton (CC BY-SA 4.0)

Quantum finite automaton

In quantum computing, quantum finite automata (QFA) or quantum state machines are a quantum analog of probabilistic automata or a Markov decision process. They provide a mathematical abstraction of real-world quantum computers.

Source: Wikipedia "Quantum finite automaton" · CC BY-SA 4.0

Share this article: X · Bluesky
Privacy Policy