Lower bounds on quantum query complexity for read-once formulas with XOR and MUX operators

Hideaki Fukuhara, Eiji Takimoto

研究成果: Contribution to journalArticle査読

抄録

We introduce a complexity measure r for the class ℱ of read-once formulas over the basis {AND,OR,NOT,XOR, MUX} and show that for any Boolean formula F in the class ℱ r(F) is a lower bound on the quantum query complexity of the Boolean function that F represents. We also show that for any Boolean function f represented by a formula in ℱ the deterministic query complexity of f is only quadratically larger than the quantum query complexity of f . Thus, the paper gives further evidence for the conjecture that there is an only quadratic gap for all functions.

本文言語英語
ページ(範囲)280-289
ページ数10
ジャーナルIEICE Transactions on Information and Systems
E93-D
2
DOI
出版ステータス出版済み - 2010

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering
  • Artificial Intelligence

フィンガープリント 「Lower bounds on quantum query complexity for read-once formulas with XOR and MUX operators」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル