1 / 24

Size of Quantum Finite State Transducers

Size of Quantum Finite State Transducers . Ruben Agadzanyan, Rusins Freivalds. Outline. Introduction Previous results When deterministic transducers are possible Quantum vs. probabilistic transducers. Introduction. Probabilistic transducer definition Computing relations

hyman
Télécharger la présentation

Size of Quantum Finite State Transducers

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Size of Quantum Finite State Transducers Ruben Agadzanyan, Rusins Freivalds

  2. Outline • Introduction • Previous results • When deterministic transducers are possible • Quantum vs. probabilistic transducers

  3. Introduction • Probabilistic transducer definition • Computing relations • Quantum transducer definition

  4. IntroductionTransducer definition • Finite state transducer (fst) is a tuple T = (Q, Σ1, Σ2, V, f, q0, Qacc, Qrej), V : Σ1 x Q → Q a  Σ1 :

  5. IntroductionTransducer definition R Σ1* x Σ2* R = {(0m1m,2m) : m ≥ 0} • Σ1 = {0,1} • Σ2 = {2} • Input: #0m1m$ • Output: 2m • Transducer may accept or reject input

  6. IntroductionTransducer types • Deterministic (dfst) • Probabilistic (pfst) • Quantum (qfst)

  7. IntroductionComputing relations R Σ1* x Σ2* R = {(0m1m,2m) : m ≥ 0} • For α > 1/2 we say that T computes the relation R with probability α if for all v, whenever (v, w)  R, then T (w|v) ≥α, and whenever (v, w)  R, then T (w|v)  1 - α 0 1 α

  8. IntroductionComputing relations R Σ1* x Σ2* R = {(0m1m,2m) : m ≥ 0} • For 0 < α < 1 we say that T computes the relation R with isolated cutpointαif there exists ε > 0 such that for all v, whenever (v, w)  R, then T (w|v) ≥α + ε, but whenever (v, w)  R, then T (w|v) α- ε. ε 0 1 α

  9. IntroductionComputing relations R Σ1* x Σ2* R = {(0m1m,2m) : m ≥ 0} • We say that T computes the relation R with probability bounded away from ½ if there exists ε > 0 such that for all v, whenever (v, w)  R, then T (w|v) ≥½ + ε, but whenever (v, w)  R, then T (w|v) ½ - ε. ε 0 1 ½

  10. Outline • Introduction • Previous results • When deterministic transducers are possible • Quantum vs. probabilistic transducers

  11. Previous results • Probabilistic transducers are more powerful than the deterministic ones (can compute more relations) • Computing relations with quantum and deterministic transducers • Computing a relation with probability 2/3

  12. Previous resultspfst and qfst more powerful than dfst? For arbitrary ε > 0 the relation R1 = {(0m1m,2m) : m ≥ 0} • can be computed by a pfst with probability 1 – ε. • can be computed by a qfst with probability 1 – ε. • cannot be computed by a dfst.

  13. Previous resultsother useful relation The relation R2 = {(w2w, w) : w  {0, 1}*} • can be computed by a pfst and qfst with probability 2/3.

  14. Outline • Introduction • Previous results • When deterministic transducers are possible • Quantum vs. probabilistic transducers

  15. When deterministic transducers are possible Comparing sizes of probabilistic and deterministic transducers • Not a big difference for relation R(0m1m,2m) • Exponential size difference for relation R(w2w,w), probability of correct answer: 2/3 • Relation with exponential size difference and probability: 1-ε

  16. When deterministic fst are possiblefst for Rk = {(0m1m,2m) : 0  m  k} For arbitrary ε > 0 and for arbitrary k the relation Rk = {(0m1m,2m) : 0  m  k} • Can be computed by pfst of size 2k + constwith probability 1 – ε • For arbitrary dfst computing Rk the number of the states is not less than k

  17. When deterministic fst are possiblefst for Rk’ = {(w2w,w) : m  k, w  {0, 1}m} The relation Rk’ = {(w2w,w) : m  k, w  {0, 1}m} • Can be computed by pfst of size 2k + constwith probability 2/3 (can’t be improved) • For arbitrary dfst computing Rk’ the number of the states is not less than akwhere a is a cardinality of the alphabet for w.

  18. When deterministic fst are possibleimproving probability For arbitrary ε > 0 and k the relation Rk’’ = {(code(w)2code(w),w) :m  k, w  {0, 1}m} • Can be computed by pfst of size 2k + constwith probability 1 - ε • For arbitrary dfst computing Rk’’ the number of the states is not less than akwhere a is a cardinality of the alphabet for w

  19. Outline • Introduction • Previous results • When deterministic transducers are possible • Quantum vs. probabilistic transducers

  20. Quantum vs. probabilistic transducers • Exponential size difference for relation R(0m1n2k,3m) • Relation which can be computed with an isolated cutpoint, but not with a probability bouded away from 1/2

  21. Quantum vs. probabilistic fstexponential difference in size The relation Rs’’ = {(0m1n2k,3m) : n  k & (m = k V m = n) & m  s & n  s & k  s} • Can be computed by qfst of size constwith probability 4/7 – ε, ε > 0 • For arbitrary pfst computing Rs’’ with probability bounded away from ½ the number of the states is not less than akwhere a is a cardinality of the alphabet for w

  22. Quantum vs. probabilistic fstqfst with probability bounded away from 1/2? The relation Rs’’’ = {(0m1na,4k) : m  s & n  s & (a = 2 → k = m) & (a = 3 → k = n)} • Can be computed by pfst and by qfst of size s + const with an isolated cutpoint, but not with a probability bounded away from ½

  23. Conclusion Comparing transducers by size: • probabilistic smaller than deterministic • quantum smaller than probabilistic and deterministic

  24. Thank you!

More Related