TY - JOUR
T1 - Quantum query complexity for qutrits
AU - Tamir, Boaz
PY - 2008/2/28
Y1 - 2008/2/28
N2 - We compute lower bounds for the exact quantum query complexity of a ternary function f. The lower bound is of order O (log3 (n)). In case f is symmetric on a sphere then the lower bound is of order O (n). This work is a natural continuation of the work of Beals, Buhrman, Cleve, Mosca, and de Wolf on lower limits for binary functions.
AB - We compute lower bounds for the exact quantum query complexity of a ternary function f. The lower bound is of order O (log3 (n)). In case f is symmetric on a sphere then the lower bound is of order O (n). This work is a natural continuation of the work of Beals, Buhrman, Cleve, Mosca, and de Wolf on lower limits for binary functions.
UR - http://www.scopus.com/inward/record.url?scp=40749125223&partnerID=8YFLogxK
U2 - 10.1103/PhysRevA.77.022326
DO - 10.1103/PhysRevA.77.022326
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:40749125223
SN - 1050-2947
VL - 77
JO - Physical Review A - Atomic, Molecular, and Optical Physics
JF - Physical Review A - Atomic, Molecular, and Optical Physics
IS - 2
M1 - 022326
ER -