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 | |
| State | Published - 28 Feb 2008 |
Fingerprint
Dive into the research topics of 'Quantum query complexity for qutrits'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver