mdh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Ambainis-Freivalds’ algorithm for measure-once automata
University of Latvia, Latvia.
Mälardalen University, Department of Mathematics and Physics.
2001 (English)In: Fundamentals of Computation Theory: 13th International Symposium, FCT 2001 Riga, Latvia, August 22–24, 2001 Proceedings, 2001, Vol. 2183, p. 83-93Conference paper, Published paper (Refereed)
Abstract [en]

An algorithm given by Ambainis and Freivalds [1] constructs a quantum finite automaton (QFA) withO(logp) states recognizing the language L p = a i |i is divisible by p with probability 1 − ε, for any ε > 0 and arbitrary prime p. In [4] we gave examples showing that the algorithm is applicable also to quantum automata of very limited size. However, the Ambainis-Freivalds algoritm is tailored to constructing a measure-many QFA (defined by Kondacs and Watrous [2]), which cannot be implemented on existing quantum computers. In this paper we modify the algorithm to construct ameasure-once QFA of Moore and Crutchfield [3] and give examples of parameters for this automaton. We show for the language L p that a measure-once QFA can be twice as space efficient as measure-many QFA’s.

Place, publisher, year, edition, pages
2001. Vol. 2183, p. 83-93
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 2183
National Category
Mathematics
Identifiers
URN: urn:nbn:se:mdh:diva-2978DOI: 10.1007/3-540-44669-9_10Scopus ID: 2-s2.0-84974678253ISBN: 978-3-540-42487-1 (print)OAI: oai:DiVA.org:mdh-2978DiVA, id: diva2:115642
Conference
13th International Symposium, FCT 2001 Riga, Latvia, August 22–24, 2001
Available from: 2008-03-08 Created: 2008-03-08 Last updated: 2016-06-30Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Bonner, R.
By organisation
Department of Mathematics and Physics
Mathematics

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 68 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf