Fast quantum verification for the formulas of predicate calculus

Yuri Ozhigov

Fast quantum verification for the formulas of predicate calculus

Quantum Physics 2007-05-23 v3

Authors: Yuri Ozhigov

Abstract

Quantum algorithm is constructed which verifies the formulas of predicate calculus in time $O(\sqrt N)$ with bounded error probability, where $N$ is the time required for classical algorithms. This algorithm uses the polynomial number of simultaneous oracle queries. This is a modification of the result of Buhrman, Cleve and Wigderson quant-ph/9802040.

Keywords

quantum search algorithms quantum algorithms quantum computing

Cite

@article{arxiv.quant-ph/9809015,
  title  = {Fast quantum verification for the formulas of predicate calculus},
  author = {Yuri Ozhigov},
  journal= {arXiv preprint arXiv:quant-ph/9809015},
  year   = {2007}
}

Comments

Reference to the work quant-ph/9802040 with the similar result is added

Related papers

View all related →