Quantum query complexity for qutrits

Boaz Tamir

Research output: Contribution to journalArticlepeer-review

12 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 languageEnglish
Article number022326
JournalPhysical Review A - Atomic, Molecular, and Optical Physics
Volume77
Issue number2
DOIs
StatePublished - 28 Feb 2008

Fingerprint

Dive into the research topics of 'Quantum query complexity for qutrits'. Together they form a unique fingerprint.

Cite this