Skip to main navigation Skip to search Skip to main content

Quantum identification of boolean oracles

  • Andris Ambainis*
  • , Kazuo Iwama
  • , Akinori Kawachi
  • , Rudy Raymond
  • , Shigeru Yamashita
  • *Corresponding author for this work
  • University of Waterloo
  • Kyoto University
  • Institute of Science Tokyo
  • Nara Institute of Science and Technology

Research output: Chapter in Book/Report/Conference proceedingChapterResearchpeer-review

Abstract

We introduce the Oracle Identification Problem (OIP), which includes many problems in oracle computation such as those of Grover search and Bernstein-Vazirani as its special cases. We give general upper and lower bounds on the number of oracle queries of OIP. Thus, our results provide general frameworks for analyzing the quantum query complexity of oracle computation. Our results are also related to exact learning in the computational learning theory.

Original languageEnglish
Title of host publicationQuantum Computation and Information
Subtitle of host publicationFrom Theory to Experiment
EditorsHiroshi Imai, Masahito Hayashi
Pages3
Number of pages1
DOIs
Publication statusPublished - 10 Jun 2006
Externally publishedYes

Publication series

NameTopics in Applied Physics
Volume102
ISSN (Print)0303-4216
ISSN (Electronic)1437-0859

Fingerprint

Dive into the research topics of 'Quantum identification of boolean oracles'. Together they form a unique fingerprint.

Cite this