Home
File Metadata
quant-ph_9809015.txt
Annotation: dorsal/arxiv

dorsal/arxiv

Added by Arxiv Bot | Added: 2026-03-02 18:02 | Views: 1 | Source: arXiv Dataset IDs (Model)

Fast quantum verification for the formulas of predicate calculus

Authors	Yuri Ozhigov
Categories	quant-ph
ArXiv ID	quant-ph/9809015
URL	https://arxiv.org/abs/quant-ph/9809015

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.

{
  "annotation_id": "9490ca15-0afb-453f-b8ab-0c043a7957e4",
  "date_created": "2026-03-02T18:02:44.909000Z",
  "date_modified": "2026-03-02T18:02:44.909000Z",
  "file_hash": "0f44f3a3e6bea7006f527c7094f8bbcd6aff2dddd12d13cddf1e8df29f3c70ca",
  "private": false,
  "record": {
    "abstract": "Quantum algorithm is constructed which verifies the formulas of predicate\ncalculus in time $O(\\sqrt N)$ with bounded error probability, where $N$ is the\ntime required for classical algorithms. This algorithm uses the polynomial\nnumber of simultaneous oracle queries. This is a modification of the result of\nBuhrman, Cleve and Wigderson quant-ph/9802040.",
    "arxiv_id": "quant-ph/9809015",
    "authors": [
      "Yuri Ozhigov"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Fast quantum verification for the formulas of predicate calculus",
    "url": "https://arxiv.org/abs/quant-ph/9809015"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "ece61883-0475-4dd3-a60a-4f04f8636253",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}