{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreie5vw5nbac2evmxsuhgw3svvfg3bkzpvnxb7jf4zgozf4sfdtnd7a",
    "uri": "at://did:plc:3fychdutjjusoqeq24ljch6q/app.bsky.feed.post/3mkosfp7b3gq2"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2604.26921v1",
  "publishedAt": "2026-04-30T00:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "David Miloschewsky",
    "Supartha Podder",
    "Dorian Rudolph"
  ],
  "textContent": "**Authors:** David Miloschewsky, Supartha Podder, Dorian Rudolph\n\nWe study the power of quantum witnesses under perfect completeness. We construct a classical oracle relative to which a language lies in $\\mathsf{QMA}_1$ but not in $\\mathsf{QCMA}$ when the $\\mathsf{QCMA}$ verifier is only allowed polynomially many adaptive rounds and exponentially many parallel queries per round. Additionally, we derandomize the permutation-oracle separation of Fefferman and Kimmel, obtaining an in-place oracle separation between $\\mathsf{QMA}_1$ and $\\mathsf{QCMA}$. Furthermore, we focus on $\\mathsf{QCMA}$ and $\\mathsf{QMA}$ with an exponentially small gap, where we show a separation assuming the gap is fixed, but not when it may be arbitrarily small. Finally, we derive consequences for approximate ground-state preparation from sparse Hamiltonian oracle access, including a bounded-adaptivity frustration-free variant.",
  "title": "En Route to a Standard QMA1 vs. QCMA Oracle Separation"
}