{
  "annotation_id": "7d4bfce3-18a3-4bb6-8cbf-9835e593685f",
  "date_created": "2026-03-02T18:02:06.330000Z",
  "date_modified": "2026-03-02T18:02:06.330000Z",
  "file_hash": "d315ddbdc28c11557d94c9eccc0c9be7f5420fbb229caa5b6452a5b2049511b5",
  "private": false,
  "record": {
    "abstract": "The standard inputs given to a quantum machine are classical binary strings.\nIn this view, any quantum complexity class is a collection of subsets of\n$\\{0,1\\}^{*}$. However, a quantum machine can also accept quantum states as its\ninput. T. Yamakami has introduced a general framework for quantum operators and\ninputs \\cite{Yam02}. In this paper we present several quantum languages within\nthis model and by generalizing the complexity classes QMA and QCMA we analyze\nthe complexity of the introduced languages. We also discuss how to derive a\nclassical language from a given quantum language and as a result we introduce\nnew QCMA and QMA languages.",
    "arxiv_id": "quant-ph/0404062",
    "authors": [
      "Elham Kashefi",
      "Carolina Moura Alves"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "On the Complexity of Quantum Languages",
    "url": "https://arxiv.org/abs/quant-ph/0404062"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "5a073e7d-177e-4f7b-b910-3735fa8057cb",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}