{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:5XPWAFRGSCYIIN4ZAE2IN553OH","short_pith_number":"pith:5XPWAFRG","schema_version":"1.0","canonical_sha256":"eddf60162690b0843799013486f7bb71ea8c26f1535a981548f4a30c829de641","source":{"kind":"arxiv","id":"2111.02999","version":2},"attestation_state":"computed","paper":{"title":"Quantum search-to-decision reductions and the state synthesis problem","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Anand Natarajan, Chinmay Nirkhe, Henry Yuen, Sandy Irani, Sujit Rao","submitted_at":"2021-11-04T16:52:58Z","abstract_excerpt":"It is a useful fact in classical computer science that many search problems are reducible to decision problems; this has led to decision problems being regarded as the $\\textit{de facto}$ computational task to study in complexity theory. In this work, we explore search-to-decision reductions for quantum search problems, wherein a quantum algorithm makes queries to a classical decision oracle to output a desired quantum state. In particular, we focus on search-to-decision reductions for $\\mathsf{QMA}$, and show that there exists a quantum polynomial-time algorithm that can generate a witness fo"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2111.02999","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2021-11-04T16:52:58Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"bcce9bbe50e2c5e15a694d59df049ae308e20613cfb5e22def6cf498ed8b0291","abstract_canon_sha256":"145601580b8b2020f17975df3a0fa937d77e442e132f5e1b6b893067a546355b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:59:57.898124Z","signature_b64":"xQNAGZOboPskvaWhouGIoToYpaVGEPr/HpHlhg7VC+2wMrf98ntD/D/V1KO3zZfZtXszrIkDAYLJRDLNelmsAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eddf60162690b0843799013486f7bb71ea8c26f1535a981548f4a30c829de641","last_reissued_at":"2026-07-05T04:59:57.897734Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:59:57.897734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum search-to-decision reductions and the state synthesis problem","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Anand Natarajan, Chinmay Nirkhe, Henry Yuen, Sandy Irani, Sujit Rao","submitted_at":"2021-11-04T16:52:58Z","abstract_excerpt":"It is a useful fact in classical computer science that many search problems are reducible to decision problems; this has led to decision problems being regarded as the $\\textit{de facto}$ computational task to study in complexity theory. In this work, we explore search-to-decision reductions for quantum search problems, wherein a quantum algorithm makes queries to a classical decision oracle to output a desired quantum state. In particular, we focus on search-to-decision reductions for $\\mathsf{QMA}$, and show that there exists a quantum polynomial-time algorithm that can generate a witness fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.02999","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2111.02999/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2111.02999","created_at":"2026-07-05T04:59:57.897792+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.02999v2","created_at":"2026-07-05T04:59:57.897792+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.02999","created_at":"2026-07-05T04:59:57.897792+00:00"},{"alias_kind":"pith_short_12","alias_value":"5XPWAFRGSCYI","created_at":"2026-07-05T04:59:57.897792+00:00"},{"alias_kind":"pith_short_16","alias_value":"5XPWAFRGSCYIIN4Z","created_at":"2026-07-05T04:59:57.897792+00:00"},{"alias_kind":"pith_short_8","alias_value":"5XPWAFRG","created_at":"2026-07-05T04:59:57.897792+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.20265","citing_title":"A distillation-teleportation protocol for fault-tolerant QRAM","ref_index":70,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5XPWAFRGSCYIIN4ZAE2IN553OH","json":"https://pith.science/pith/5XPWAFRGSCYIIN4ZAE2IN553OH.json","graph_json":"https://pith.science/api/pith-number/5XPWAFRGSCYIIN4ZAE2IN553OH/graph.json","events_json":"https://pith.science/api/pith-number/5XPWAFRGSCYIIN4ZAE2IN553OH/events.json","paper":"https://pith.science/paper/5XPWAFRG"},"agent_actions":{"view_html":"https://pith.science/pith/5XPWAFRGSCYIIN4ZAE2IN553OH","download_json":"https://pith.science/pith/5XPWAFRGSCYIIN4ZAE2IN553OH.json","view_paper":"https://pith.science/paper/5XPWAFRG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.02999&json=true","fetch_graph":"https://pith.science/api/pith-number/5XPWAFRGSCYIIN4ZAE2IN553OH/graph.json","fetch_events":"https://pith.science/api/pith-number/5XPWAFRGSCYIIN4ZAE2IN553OH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5XPWAFRGSCYIIN4ZAE2IN553OH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5XPWAFRGSCYIIN4ZAE2IN553OH/action/storage_attestation","attest_author":"https://pith.science/pith/5XPWAFRGSCYIIN4ZAE2IN553OH/action/author_attestation","sign_citation":"https://pith.science/pith/5XPWAFRGSCYIIN4ZAE2IN553OH/action/citation_signature","submit_replication":"https://pith.science/pith/5XPWAFRGSCYIIN4ZAE2IN553OH/action/replication_record"}},"created_at":"2026-07-05T04:59:57.897792+00:00","updated_at":"2026-07-05T04:59:57.897792+00:00"}