About: Quantum finite automaton

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Quantum finite automaton Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

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. Several types of automata may be defined, including measure-once and measure-many automata. Quantum finite automata can also be understood as the quantization of subshifts of finite type, or as a quantization of Markov chains. QFAs are, in turn, special cases of geometric finite automata or topological finite automata.

Attributes	Values
rdfs:label	Quantum finite automaton (en)
rdfs:comment	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. Several types of automata may be defined, including measure-once and measure-many automata. Quantum finite automata can also be understood as the quantization of subshifts of finite type, or as a quantization of Markov chains. QFAs are, in turn, special cases of geometric finite automata or topological finite automata. (en)
dbp:wikiPageUsesTemplate	dbt:Reflist dbt:Quantum_computing
Subject	Quantum information theory Finite automata
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Quantum_finite_automaton?oldid=973829519&ns=0
Wikipage page ID	7926008 (xsd:integer)
page length (characters) of wiki page	22370 (xsd:nonNegativeInteger)
Wikipage revision ID	973829519 (xsd:integer)
has abstract	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. Several types of automata may be defined, including measure-once and measure-many automata. Quantum finite automata can also be understood as the quantization of subshifts of finite type, or as a quantization of Markov chains. QFAs are, in turn, special cases of geometric finite automata or topological finite automata. The automata work by receiving a finite-length string of letters from a finite alphabet , and assigning to each such string a probability indicating the probability of the automaton being in an accept state; that is, indicating whether the automaton accepted or rejected the string. The languages accepted by QFAs are not the regular languages of deterministic finite automata, nor are they the stochastic languages of probabilistic finite automata. Study of these quantum languages remains an active area of research. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Quantum_finite_automaton
is Wikipage redirect of	Quantum finite automata Geometric automaton Quantum finite state machine Topological automata Topological automaton Topological finite automata Topological finite state machine Metric automata Metric automaton
is Link from a Wikipage to another Wikipage of	Automata theory Finite-state machine Geometric automaton Deterministic finite automaton John Watrous (computer scientist) Markov decision process Metric automata Metric automaton

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software