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 条
  • [31] Quantum query complexity of symmetric oracle problems
    Copeland, Daniel
    Pommersheim, Jamie
    QUANTUM, 2021, 5
  • [32] A Quantum Query Complexity Trichotomy for Regular Languages
    Aaronson, Scott
    Grier, Daniel
    Schaeffer, Luke
    2019 IEEE 60TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2019), 2019, : 942 - 965
  • [33] Quantum Query Complexity of Unitary Operator Discrimination
    Kawachi, Akinori
    Kawano, Kenichi
    Le Gall, Francois
    Tamaki, Suguru
    COMPUTING AND COMBINATORICS, COCOON 2017, 2017, 10392 : 309 - 320
  • [34] The quantum query complexity of learning multilinear polynomials
    Montanaro, Ashley
    INFORMATION PROCESSING LETTERS, 2012, 112 (11) : 438 - 442
  • [35] Quantum query complexity of some graph problems
    Dürr, C
    Heiligman, M
    Hoyer, P
    Mhalla, M
    AUTOMATA , LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2004, 3142 : 481 - 493
  • [36] Open Problems Related to Quantum Query Complexity
    Aaronson, Scott
    ACM TRANSACTIONS ON QUANTUM COMPUTING, 2021, 2 (04):
  • [37] Quantum query complexity in computational geometry revisited
    Bahadur, A.
    Durr, C.
    Lafaye, T.
    Kulkarni, R.
    QUANTUM INFORMATION AND COMPUTATION IV, 2006, 6244
  • [38] Improved Quantum Query Complexity on Easier Inputs
    Anderson, Noel T.
    Chung, Jay-U
    Kimmel, Shelby
    Koh, Da-Yeon
    Ye, Xiaohan
    QUANTUM, 2024, 8
  • [39] Average-case quantum query complexity
    Ambainis, A
    de Wolf, R
    JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 2001, 34 (35): : 6741 - 6754
  • [40] MULTICLONES QUANTUM CLONING OF QUTRITS
    Zhang, Wen-Hai
    Dai, Jie-Lin
    Cao, Zhuo-Liang
    Yang, Ming
    INTERNATIONAL JOURNAL OF QUANTUM INFORMATION, 2010, 8 (07) : 1207 - 1212
12345