{
  "annotation_id": "c74fb9fb-6c09-4097-a834-82a42edd4f92",
  "date_created": "2026-03-02T18:01:53.192000Z",
  "date_modified": "2026-03-02T18:01:53.192000Z",
  "file_hash": "85bb7fb85396b0f5d8de11f06eed9dfa88f84f01ecc7d9a3c392a2683ecf2140",
  "private": false,
  "record": {
    "abstract": "This paper introduces quantum analogues of non-interactive perfect and\nstatistical zero-knowledge proof systems. Similar to the classical cases, it is\nshown that sharing randomness or entanglement is necessary for non-trivial\nprotocols of non-interactive quantum perfect and statistical zero-knowledge. It\nis also shown that, with sharing EPR pairs a priori, the class of languages\nhaving one-sided bounded error non-interactive quantum perfect zero-knowledge\nproof systems has a natural complete problem. Non-triviality of such a proof\nsystem is based on the fact proved in this paper that the Graph\nNon-Automorphism problem, which is not known in BQP, can be reduced to our\ncomplete problem. Our results may be the first non-trivial quantum\nzero-knowledge proofs secure even against dishonest quantum verifiers, since\nour protocols are non-interactive, and thus the zero-knowledge property does\nnot depend on whether the verifier in the protocol is honest or not. A\nrestricted version of our complete problem derives a natural complete problem\nfor BQP.",
    "arxiv_id": "quant-ph/0207158",
    "authors": [
      "Hirotada Kobayashi"
    ],
    "categories": [
      "quant-ph",
      "cs.CC"
    ],
    "title": "Non-Interactive Quantum Statistical and Perfect Zero-Knowledge",
    "url": "https://arxiv.org/abs/quant-ph/0207158"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "efd2da89-8836-4710-9b97-bf7fb32ddf4c",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}