Fast quantum verification for the formulas of predicate calculus

Simple item page
dc.creatorOzhigov, Yuri
dc.date1998-09-08
dc.date1998-09-23
dc.date.accessioned2026-07-07T06:15:38Z
dc.date.available2026-07-07T06:15:38Z
dc.descriptionQuantum 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.
dc.descriptionReference to the work quant-ph/9802040 with the similar result is added
dc.identifierhttps://arxiv.org/abs/quant-ph/9809015
dc.identifierhttp://arxiv.org/abs/quant-ph/9809015
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/93815
dc.subjectQuantum Physics
dc.titleFast quantum verification for the formulas of predicate calculus
dc.typetext

Files

Collections

arXiv