{"title":"Quantum certificate complexity","authors":"S. Aaronson","doi":"10.1109/CCC.2003.1214418","DOIUrl":null,"url":null,"abstract":"Given a Boolean function f, we study two natural generalizations of the certificate complexity C(f): the randomized certificate complexity RC(f) and the quantum certificate complexity QC(f). Using Ambainis' adversary method, we exactly characterize QC(f) as the square root of RC(f). We then use this result to prove the new relation R/sub 0/(f)=O(Q/sub 2/(f)/sup 2/Q/sub 0/(f)log n) for total f, where R/sub 0/, Q/sub 2/, and Q/sub 0/ are zero-error randomized, bounded-error quantum, and zero-error quantum query complexities respectively. Finally we give asymptotic gaps between the measures, including a total f for which C(f) is superquadratic in QC(f), and a symmetric partial f for which QC(f)=O(1) yet Q/sub 2/(f)=/spl Omega/(n/log n).","PeriodicalId":286846,"journal":{"name":"18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"48","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCC.2003.1214418","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 48
Abstract
Given a Boolean function f, we study two natural generalizations of the certificate complexity C(f): the randomized certificate complexity RC(f) and the quantum certificate complexity QC(f). Using Ambainis' adversary method, we exactly characterize QC(f) as the square root of RC(f). We then use this result to prove the new relation R/sub 0/(f)=O(Q/sub 2/(f)/sup 2/Q/sub 0/(f)log n) for total f, where R/sub 0/, Q/sub 2/, and Q/sub 0/ are zero-error randomized, bounded-error quantum, and zero-error quantum query complexities respectively. Finally we give asymptotic gaps between the measures, including a total f for which C(f) is superquadratic in QC(f), and a symmetric partial f for which QC(f)=O(1) yet Q/sub 2/(f)=/spl Omega/(n/log n).
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
