Quantum query complexity for qutrits

被引：12
|
作者：
Tamir, Boaz [1 ]
机构：
[1] Bar Ilan Univ, Dept HPS, Ramat Gan, Israel
来源：
PHYSICAL REVIEW A | 2008年 / 77卷 / 02期
关键词：
Binary decision diagrams - Function evaluation - Query processing - Work function;
D O I：
10.1103/PhysRevA.77.022326
中图分类号：
O43 [光学];
学科分类号：
070207 ; 0803 ;
摘要：
We compute lower bounds for the exact quantum query complexity of a ternary function f. The lower bound is of order O(log(3)(n)). In case f is symmetric on a sphere then the lower bound is of order O(root n). This work is a natural continuation of the work of Beals, Buhrman, Cleve, Mosca, and de Wolf on lower limits for binary functions.
引用
收藏
页数：7
相关论文
共 50 条
  • [21] An Optimal Separation of Randomized and Quantum Query Complexity
    Sherstov, Alexander A.
    Storozhenko, Andrey A.
    Wu, Pei
    STOC '21: PROCEEDINGS OF THE 53RD ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2021, : 1289 - 1302
  • [22] Exact Quantum Query Complexity of EXACTk,ln
    Ambainis, Andris
    Iraids, Janis
    Nagaj, Daniel
    SOFSEM 2017: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2017, 10139 : 243 - 255
  • [23] Quantum query complexity of some graph problems
    Dürr, C
    Heiligman, M
    Hoyer, P
    Mhalla, M
    SIAM JOURNAL ON COMPUTING, 2006, 35 (06) : 1310 - 1328
  • [24] Quantum Query Complexity of Unitary Operator Discrimination
    Kawachi, Akinori
    Kawano, Kenichi
    Le Gall, Francois
    Tamaki, Suguru
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2019, E102D (03): : 483 - 491
  • [25] Average-case quantum query complexity
    Ambainis, A
    de Wolf, R
    STACS 2000: 17TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 2000, 1770 : 133 - 144
  • [26] THE QUANTUM QUERY COMPLEXITY OF AC0
    Beame, Paul
    Machmouchi, Widad
    QUANTUM INFORMATION & COMPUTATION, 2012, 12 (7-8) : 670 - 676
  • [27] Unbounded-Error Quantum Query Complexity
    Montanaro, Ashley
    Nishimura, Harumichi
    Raymond, Rudy
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2008, 5369 : 919 - +
  • [28] AN OPTIMAL SEPARATION OF RANDOMIZED AND QUANTUM QUERY COMPLEXITY
    Sherstov, Alexander A.
    Storozhenko, Andrey A.
    Wu, Pei
    SIAM JOURNAL ON COMPUTING, 2023, 52 (02)
  • [29] Variational learning algorithms for quantum query complexity
    Wu, Zipeng
    Hou, Shi-Yao
    Zhang, Chao
    Li, Lvzhou
    Zeng, Bei
    NEW JOURNAL OF PHYSICS, 2024, 26 (03):
  • [30] Unbounded-error quantum query complexity
    Montanaro, Ashley
    Nishimura, Harumichi
    Raymond, Rudy
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (35) : 4619 - 4628
12345