{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SYW77YDNCTQS2DHAXOUPF7SR6J","short_pith_number":"pith:SYW77YDN","schema_version":"1.0","canonical_sha256":"962dffe06d14e12d0ce0bba8f2fe51f2761ffab80a5a7b2832da04610cfcbf5c","source":{"kind":"arxiv","id":"2411.11805","version":1},"attestation_state":"computed","paper":{"title":"On the hardness of cloning and connections to representation theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Chinmay Nirkhe, Vojt\\v{e}ch Havl\\'i\\v{c}ek","submitted_at":"2024-11-18T18:19:08Z","abstract_excerpt":"The states accepted by a quantum circuit are known as the witnesses for the quantum circuit's satisfiability. The assumption BQP does not equal QMA implies that no efficient algorithm exists for constructing a witness for a quantum circuit from the circuit's classical description. However, a similar complexity-theoretic lower bound on the computational hardness of cloning a witness is not known. In this note, we derive a conjecture about cloning algorithms for maximally entangled states over hidden subspaces which would imply that no efficient algorithm exists for cloning witnesses (assuming B"},"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":"2411.11805","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-11-18T18:19:08Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"088bcb001f244e63d2e78d02fbe6c73c904e1b5c18c9f755374dab57cc50fd89","abstract_canon_sha256":"08a317b1c7130838efdaf9bad2aa25b2342fcfd2e0b5b485907472cca1544720"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:37:02.073236Z","signature_b64":"9ibkb9Mu87y3X01lr8j7bEyfRXaF6hVm2TavsoVJe8V6Fqu0xuM4H+Egk3D+QsBS+dydOE4urYKGISwfN0NpDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"962dffe06d14e12d0ce0bba8f2fe51f2761ffab80a5a7b2832da04610cfcbf5c","last_reissued_at":"2026-07-05T09:37:02.072711Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:37:02.072711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the hardness of cloning and connections to representation theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Chinmay Nirkhe, Vojt\\v{e}ch Havl\\'i\\v{c}ek","submitted_at":"2024-11-18T18:19:08Z","abstract_excerpt":"The states accepted by a quantum circuit are known as the witnesses for the quantum circuit's satisfiability. The assumption BQP does not equal QMA implies that no efficient algorithm exists for constructing a witness for a quantum circuit from the circuit's classical description. However, a similar complexity-theoretic lower bound on the computational hardness of cloning a witness is not known. In this note, we derive a conjecture about cloning algorithms for maximally entangled states over hidden subspaces which would imply that no efficient algorithm exists for cloning witnesses (assuming B"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.11805","kind":"arxiv","version":1},"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/2411.11805/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":"2411.11805","created_at":"2026-07-05T09:37:02.072767+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.11805v1","created_at":"2026-07-05T09:37:02.072767+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.11805","created_at":"2026-07-05T09:37:02.072767+00:00"},{"alias_kind":"pith_short_12","alias_value":"SYW77YDNCTQS","created_at":"2026-07-05T09:37:02.072767+00:00"},{"alias_kind":"pith_short_16","alias_value":"SYW77YDNCTQS2DHA","created_at":"2026-07-05T09:37:02.072767+00:00"},{"alias_kind":"pith_short_8","alias_value":"SYW77YDN","created_at":"2026-07-05T09:37:02.072767+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SYW77YDNCTQS2DHAXOUPF7SR6J","json":"https://pith.science/pith/SYW77YDNCTQS2DHAXOUPF7SR6J.json","graph_json":"https://pith.science/api/pith-number/SYW77YDNCTQS2DHAXOUPF7SR6J/graph.json","events_json":"https://pith.science/api/pith-number/SYW77YDNCTQS2DHAXOUPF7SR6J/events.json","paper":"https://pith.science/paper/SYW77YDN"},"agent_actions":{"view_html":"https://pith.science/pith/SYW77YDNCTQS2DHAXOUPF7SR6J","download_json":"https://pith.science/pith/SYW77YDNCTQS2DHAXOUPF7SR6J.json","view_paper":"https://pith.science/paper/SYW77YDN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.11805&json=true","fetch_graph":"https://pith.science/api/pith-number/SYW77YDNCTQS2DHAXOUPF7SR6J/graph.json","fetch_events":"https://pith.science/api/pith-number/SYW77YDNCTQS2DHAXOUPF7SR6J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SYW77YDNCTQS2DHAXOUPF7SR6J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SYW77YDNCTQS2DHAXOUPF7SR6J/action/storage_attestation","attest_author":"https://pith.science/pith/SYW77YDNCTQS2DHAXOUPF7SR6J/action/author_attestation","sign_citation":"https://pith.science/pith/SYW77YDNCTQS2DHAXOUPF7SR6J/action/citation_signature","submit_replication":"https://pith.science/pith/SYW77YDNCTQS2DHAXOUPF7SR6J/action/replication_record"}},"created_at":"2026-07-05T09:37:02.072767+00:00","updated_at":"2026-07-05T09:37:02.072767+00:00"}