THE QUANTUM QUERY COMPLEXITY OF CERTIFICATION

被引：0

作者：

Ambainis, Andris ^{[1
]}

Childs, Andrew M. ^{[2
,3
]}

Le Gall, Francois ^{[4
]}

Tani, Seiichiro ^{[4
,5
]}

机构：

[1] Univ Latvia, Fac Comp, Riga, Latvia

[2] Univ Waterloo, Dept Combinator & Optimizat, Waterloo, ON N2L 3G1, Canada

[3] Univ Waterloo, Inst Quantum Comp, Waterloo, ON N2L 3G1, Canada

[4] Japan Sci & Technol Agcy, Quantum Computat & Informat Project, Tokyo, Japan

[5] NTT Corp, NTT Commun Sci Labs, Atsugi, Kanagawa, Japan

来源：

QUANTUM INFORMATION & COMPUTATION | 2010年 / 10卷 / 3-4期

基金：

加拿大自然科学与工程研究理事会;

关键词：

Quantum query complexity; formula evaluation; certificates; LOWER BOUNDS;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We study the quantum query complexity of finding a certificate for a d-regular, k-level balanced NANDformula. We show that the query complexity is circle minus(d((k+1)/2)) for 0-certificates, and (circle minus) over tilde (d(k/2)) for 1-certificates. In particular, this shows that the zero-error quantum query complexity of evaluating such formulas is (O) over tilde (d((k+1)/2)). Our lower bound relies on the fact that the quantum adversary method obeys a direct sum theorem.

引用

页码：181 / 189

页数：9

共 50 条

[1] The quantum query complexity of certification
Ambainis, Andris
Childs, Andrew M.
le Gall, François
Tani, Seiichiro
[J]. Quantum Information and Computation, 2010, 10 (3-4): : 0181 - 0189
[2] The Query Complexity of Certification
Blanc, Guy
Koch, Caleb
Lange, Jane
Tan, Li-Yang
[J]. PROCEEDINGS OF THE 54TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '22), 2022, : 623 - 636
[3] On Exact Quantum Query Complexity
Ashley Montanaro
Richard Jozsa
Graeme Mitchison
[J]. Algorithmica, 2015, 71 : 775 - 796
[4] On Exact Quantum Query Complexity
Montanaro, Ashley
Jozsa, Richard
Mitchison, Graeme
[J]. ALGORITHMICA, 2015, 71 (04) : 775 - 796
[5] Nonadaptive quantum query complexity
Montanaro, Ashley
[J]. INFORMATION PROCESSING LETTERS, 2010, 110 (24) : 1110 - 1113
[6] Quantum query complexity for qutrits
Tamir, Boaz
[J]. PHYSICAL REVIEW A, 2008, 77 (02):
[7] The quantum query complexity of the determinant
Doern, Sebastian
Thierauf, Thomas
[J]. INFORMATION PROCESSING LETTERS, 2009, 109 (06) : 325 - 328
[8] QUANTUM CONDITIONAL QUERY COMPLEXITY
Sardharwalla, Imdad S. B.
Strelchuk, Sergii
Jozsa, Richard
[J]. QUANTUM INFORMATION & COMPUTATION, 2017, 17 (7-8) : 541 - 567
[9] Quantum bounded query complexity
Buhrman, H
van Dam, W
[J]. FOURTEENTH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 1999, : 149 - 156
[10] From quantum query complexity to state complexity
Zheng, Shenggen
Qiu, Daowen
[J]. Qiu, Daowen, 1600, Springer Verlag (8808): : 231 - 245

← 1 2 3 4 5 →