{
  "abstract": "We study whether a quantum verifier can find a hidden quantum state by exchanging classical messages with an unbounded prover who knows the state. The verifier has access to a reflection oracle about the target. For a Haar-random $n$-qubit target, we prove that achieving constant average fidelity with the target requires $(q+1)^2(B+1)=Ω(2^n)$, where $q$ is the number of verifier queries and $B$ is the total prover-to-verifier communication. The bound allows arbitrary classical interaction and unrestricted computation between queries. Our proof extends the lower bound of Aaronson and Kuperberg (ToC'07) from a single classical proof to an arbitrary classical interaction. As a result, we obtain a quantum-oracle separation of QMA from QCIP. In particular, we give a unitary oracle $\\mathcal{U}$ such that there exists a language $L\\in\\mathrm{QMA}^{\\mathcal{U}}$ but $L\\notin\\mathrm{QCIP}^{\\mathcal{U}}$. Our separation holds even for UniqueQMA, the restriction of QMA to verification with a unique quantum witness, which is known to be strictly weaker than QMA in the quantum black-box setting. We further give an oracle construction for a notion known as QMA--QCIP[2] gap problem. This gives average case hardness for a QMA language under classical access to a QCIP[2] decision oracle and is used in establishing negative results on witness encryption and quantum indistinguishability obfuscation.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2610.25657",
  "author_total": 1,
  "authors": [
    {
      "name": "Mohammed Barhoush"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/ewx468ynvvksq.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2610.25657",
  "fulltext_url": null,
  "id": "ewx468ynvvksq",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2610.25657",
  "language": null,
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Computing Algorithms and Architecture"
    ]
  ],
  "openalex": "W7223070920",
  "pdf_url": "https://arxiv.org/pdf/2610.25657",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-21",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/ewx468ynvvksq.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:34:34Z",
      "native_id": "2610.25657",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2610.25657"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Quantum State Search with Classical Interactive Advice",
  "title_text": "Quantum State Search with Classical Interactive Advice",
  "type": "preprint",
  "updated_at": "2026-10-30T12:34:34Z",
  "url": "https://research.draconitic.com/paper/ewx468ynvvksq",
  "venue": "arXiv",
  "versions": []
}