Any AND-OR formula of size N can be evaluated in time N1/2+o(1) on a quantum computer
| dc.contributor.author | Ambainis, A. | |
| dc.contributor.author | Childs, A.M. | |
| dc.contributor.author | Reichardt, B.W. | |
| dc.contributor.author | Spalek, R. | |
| dc.contributor.author | Zhang, S. | |
| dc.date.accessioned | 2015-11-19T19:53:29Z | |
| dc.date.available | 2015-11-19T19:53:29Z | |
| dc.date.issued | 2010 | |
| dc.identifier.doi | 10.1109/FOCS.2007.57 | |
| dc.identifier.uri | https://dspace.lu.lv/dspace/handle/7/31143 | |
| dc.language.iso | eng | en_US |
| dc.relation.ispartofseries | SIAM Journal on Computing;Vol.39, N 6 (2010) | |
| dc.rights | info:eu-repo/semantics/restrictedAccess | en_US |
| dc.subject | Research Subject Categories::TECHNOLOGY::Information technology | en_US |
| dc.subject | Quantum computation | en_US |
| dc.subject | Quantum query complexity | en_US |
| dc.subject | Formula evaluation | en_US |
| dc.subject | Quantum walk | en_US |
| dc.title | Any AND-OR formula of size N can be evaluated in time N1/2+o(1) on a quantum computer | en_US |
| dc.type | info:eu-repo/semantics/article | en_US |