Quantum query complexity for qutrits

Boaz Tamir

doi:10.1103/PhysRevA.77.022326

Quantum query complexity for qutrits

Boaz Tamir

Science Technology and Society Program

Research output: Contribution to journal › Article › peer-review

6 Scopus citations

Abstract

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.

Original language	English
Article number	022326
Journal	Physical Review A - Atomic, Molecular, and Optical Physics
Volume	77
Issue number	2
DOIs	https://doi.org/10.1103/PhysRevA.77.022326
State	Published - 28 Feb 2008

Access to Document

10.1103/PhysRevA.77.022326

Cite this

@article{6e2aa86ee20544d99487ed1150b18c68,

title = "Quantum query complexity for qutrits",

abstract = "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.",

author = "Boaz Tamir",

year = "2008",

month = feb,

day = "28",

doi = "10.1103/PhysRevA.77.022326",

language = "אנגלית",

volume = "77",

journal = "Physical Review A",

issn = "2469-9926",

publisher = "American Physical Society",

number = "2",

}

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 - 2469-9926

VL - 77

JO - Physical Review A

JF - Physical Review A

IS - 2

M1 - 022326

ER -

Quantum query complexity for qutrits

Abstract

Access to Document

Other files and links

Fingerprint

Cite this