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 条
  • [1] Measurement-device-independent quantum private query with qutrits
    Roy, Sarbani
    Maitra, Arpita
    Mukhopadhyay, Sourav
    INTERNATIONAL JOURNAL OF QUANTUM INFORMATION, 2018, 16 (05)
  • [2] Quantum communication complexity protocol with two entangled qutrits
    Brukner, C
    Zukowski, M
    Zeilinger, A
    PHYSICAL REVIEW LETTERS, 2002, 89 (19)
  • [3] On Exact Quantum Query Complexity
    Ashley Montanaro
    Richard Jozsa
    Graeme Mitchison
    Algorithmica, 2015, 71 : 775 - 796
  • [4] THE QUANTUM QUERY COMPLEXITY OF CERTIFICATION
    Ambainis, Andris
    Childs, Andrew M.
    Le Gall, Francois
    Tani, Seiichiro
    QUANTUM INFORMATION & COMPUTATION, 2010, 10 (3-4) : 181 - 189
  • [5] On Exact Quantum Query Complexity
    Montanaro, Ashley
    Jozsa, Richard
    Mitchison, Graeme
    ALGORITHMICA, 2015, 71 (04) : 775 - 796
  • [6] Nonadaptive quantum query complexity
    Montanaro, Ashley
    INFORMATION PROCESSING LETTERS, 2010, 110 (24) : 1110 - 1113
  • [7] The quantum query complexity of the determinant
    Doern, Sebastian
    Thierauf, Thomas
    INFORMATION PROCESSING LETTERS, 2009, 109 (06) : 325 - 328
  • [8] Quantum bounded query complexity
    Buhrman, H
    van Dam, W
    FOURTEENTH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 1999, : 149 - 156
  • [9] The quantum query complexity of certification
    Ambainis, Andris
    Childs, Andrew M.
    le Gall, François
    Tani, Seiichiro
    Quantum Information and Computation, 2010, 10 (3-4): : 0181 - 0189
  • [10] QUANTUM CONDITIONAL QUERY COMPLEXITY
    Sardharwalla, Imdad S. B.
    Strelchuk, Sergii
    Jozsa, Richard
    QUANTUM INFORMATION & COMPUTATION, 2017, 17 (7-8) : 541 - 567
12345