Show simple item record

Any AND-OR formula of size N can be evaluated in time N1/2+o(1) on a quantum computer

dc.contributor.authorAmbainis, A.
dc.contributor.authorChilds, A.M.
dc.contributor.authorReichardt, B.W.
dc.contributor.authorSpalek, R.
dc.contributor.authorZhang, S.
dc.date.accessioned2015-11-19T19:53:29Z
dc.date.available2015-11-19T19:53:29Z
dc.date.issued2010
dc.identifier.urihttps://dspace.lu.lv/dspace/handle/7/31143
dc.language.isoengen_US
dc.relation.ispartofseriesSIAM Journal on Computing;Vol.39, N 6 (2010)
dc.rightsinfo:eu-repo/semantics/restrictedAccessen_US
dc.subjectResearch Subject Categories::TECHNOLOGY::Information technologyen_US
dc.subjectQuantum computationen_US
dc.subjectQuantum query complexityen_US
dc.subjectFormula evaluationen_US
dc.subjectQuantum walken_US
dc.titleAny AND-OR formula of size N can be evaluated in time N1/2+o(1) on a quantum computeren_US
dc.typeinfo:eu-repo/semantics/articleen_US
dc.identifier.doi10.1109/FOCS.2007.57


Files in this item

Thumbnail
Name:
ambainis_childs_etal_2010.pdf
Size:
322.6Kb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record