Size of quantum versus deterministic finite automata

Andris Ambainis; Uldis Barbans; Agnese Belousova; Aleksandrs Belovs; Ilze Dzelme; Ǧirts Folkmanis; Rusiņš Freivalds; Peteris Lediņš; Rihards Opmanis; Agnis Škuškovniks

Size of quantum versus deterministic finite automata

Andris Ambainis^*
, Uldis Barbans
, Agnese Belousova
, Aleksandrs Belovs
, Ilze Dzelme
, Ǧirts Folkmanis
, Rusiņš Freivalds
, Peteris Lediņš
, Rihards Opmanis
, Agnis Škuškovniks

^*Šī darba korespondējošais autors

University of Latvia

Zinātniskās darbības rezultāts: Nodaļa grāmatā/enciklopēdijā/konferences krājumā › Konferences zinātniskais raksts › Pētniecība › koleģiāli recenzēts

1 Atsauce (Scopus)

Kopsavilkums

A.Ambainis and R.Freivalds found that for some languages QFA can have exponential size advantages. They used a language in a single-letter alphabet to prove these advantages. We improve the base of the exponent in these advantages by using more complicated languages in more rich alphabets.

Oriģinālvaloda	Angļu
Publikācijas avota nosaukums	Proceedings of the International Conference on VLSI, VLSI 03
Redaktori	H.R. Arbania, L.T. Yang
Lapas	303-308
Lapu skaits	6
Publikācijas statuss	Publicēts - 2003
Ārēji publicēts	Jā
Pasākums	Proceedings of the International Conference on VLSI, VLSI'03 - Las Vegas, NV, Amerikas Savienotās Valstis Ilgums: 23 jūn. 2003 → 26 jūn. 2003

Publikāciju sērijas

Nosaukums	Proceedings of the International Conference on VLSI

Konference

Konference	Proceedings of the International Conference on VLSI, VLSI'03
Valsts/Teritorija	Amerikas Savienotās Valstis
Pilsēta	Las Vegas, NV
Periods	23/06/03 → 26/06/03

Citi faili un saites

Saite uz publikāciju Scopus

Citēt šo

Ambainis, A., Barbans, U., Belousova, A., Belovs, A., Dzelme, I., Folkmanis, Ǧ., Freivalds, R., Lediņš, P., Opmanis, R., & Škuškovniks, A. (2003). Size of quantum versus deterministic finite automata. (gadā) H. R. Arbania, & L. T. Yang (Red.), Proceedings of the International Conference on VLSI, VLSI 03 (lpp. 303-308). (Proceedings of the International Conference on VLSI).

@inproceedings{94954e43ae4f46eeb5a6f40285068a12,

title = "Size of quantum versus deterministic finite automata",

abstract = "A.Ambainis and R.Freivalds found that for some languages QFA can have exponential size advantages. They used a language in a single-letter alphabet to prove these advantages. We improve the base of the exponent in these advantages by using more complicated languages in more rich alphabets.",

keywords = "Codes, Finite automata, Quantum computation",

author = "Andris Ambainis and Uldis Barbans and Agnese Belousova and Aleksandrs Belovs and Ilze Dzelme and Ǧirts Folkmanis and Rusiņ{\v s} Freivalds and Peteris Lediņ{\v s} and Rihards Opmanis and Agnis {\v S}ku{\v s}kovniks",

year = "2003",

language = "English",

isbn = "1932415106",

series = "Proceedings of the International Conference on VLSI",

pages = "303--308",

editor = "H.R. Arbania and L.T. Yang",

booktitle = "Proceedings of the International Conference on VLSI, VLSI 03",

note = "Proceedings of the International Conference on VLSI, VLSI'03 ; Conference date: 23-06-2003 Through 26-06-2003",

}

Ambainis, A, Barbans, U, Belousova, A, Belovs, A, Dzelme, I, Folkmanis, Ǧ, Freivalds, R, Lediņš, P, Opmanis, R & Škuškovniks, A 2003, Size of quantum versus deterministic finite automata. (kur) HR Arbania & LT Yang (red.), Proceedings of the International Conference on VLSI, VLSI 03. Proceedings of the International Conference on VLSI, lpp. 303-308, Proceedings of the International Conference on VLSI, VLSI'03, Las Vegas, NV, Amerikas Savienotās Valstis, 23/06/03.

Size of quantum versus deterministic finite automata. / Ambainis, Andris; Barbans, Uldis; Belousova, Agnese u.c.
Proceedings of the International Conference on VLSI, VLSI 03. red. / H.R. Arbania; L.T. Yang. 2003. lpp. 303-308 (Proceedings of the International Conference on VLSI).

Zinātniskās darbības rezultāts: Nodaļa grāmatā/enciklopēdijā/konferences krājumā › Konferences zinātniskais raksts › Pētniecība › koleģiāli recenzēts

TY - GEN

T1 - Size of quantum versus deterministic finite automata

AU - Ambainis, Andris

AU - Barbans, Uldis

AU - Belousova, Agnese

AU - Belovs, Aleksandrs

AU - Dzelme, Ilze

AU - Folkmanis, Ǧirts

AU - Freivalds, Rusiņš

AU - Lediņš, Peteris

AU - Opmanis, Rihards

AU - Škuškovniks, Agnis

PY - 2003

Y1 - 2003

N2 - A.Ambainis and R.Freivalds found that for some languages QFA can have exponential size advantages. They used a language in a single-letter alphabet to prove these advantages. We improve the base of the exponent in these advantages by using more complicated languages in more rich alphabets.

AB - A.Ambainis and R.Freivalds found that for some languages QFA can have exponential size advantages. They used a language in a single-letter alphabet to prove these advantages. We improve the base of the exponent in these advantages by using more complicated languages in more rich alphabets.

KW - Codes

KW - Finite automata

KW - Quantum computation

UR - https://www.scopus.com/pages/publications/12144287588

M3 - Conference paper

AN - SCOPUS:12144287588

SN - 1932415106

T3 - Proceedings of the International Conference on VLSI

SP - 303

EP - 308

BT - Proceedings of the International Conference on VLSI, VLSI 03

A2 - Arbania, H.R.

A2 - Yang, L.T.

T2 - Proceedings of the International Conference on VLSI, VLSI'03

Y2 - 23 June 2003 through 26 June 2003

ER -

Size of quantum versus deterministic finite automata

Kopsavilkums

Publikāciju sērijas

Konference

Citi faili un saites

Nospiedums

Citēt šo