Показать сокращенную информацию
dc.contributor.author | Ablayev F. | |
dc.contributor.author | Moore C. | |
dc.contributor.author | Pollett C. | |
dc.date.accessioned | 2018-09-17T20:39:13Z | |
dc.date.available | 2018-09-17T20:39:13Z | |
dc.date.issued | 2002 | |
dc.identifier.issn | 0302-9743 | |
dc.identifier.uri | https://dspace.kpfu.ru/xmlui/handle/net/133830 | |
dc.description.abstract | We prove upper and lower bounds on the power of quantum and stochastic branching programs of bounded width. We show any NC1 language can be accepted exactly by a width-2 quantum branching program of polynomial length, in contrast to the classical case where width 5 is necessary unless NC1 = ACC. This separates width-2 quantum programs from width-2 doubly stochastic programs as we show the latter cannot compute the middle bit of multiplication. Finally, we show that bounded-width quantum and stochastic programs can be simulated by classical programs of larger but bounded width, and thus are in NC 1.© 2002 Springer-Verlag Berlin Heidelberg. | |
dc.relation.ispartofseries | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | |
dc.title | Quantum and stochastic branching programs of bounded width | |
dc.type | Conference Paper | |
dc.relation.ispartofseries-volume | 2380 LNCS | |
dc.collection | Публикации сотрудников КФУ | |
dc.relation.startpage | 343 | |
dc.source.id | SCOPUS03029743-2002-2380-SID84869186284 |