{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:PJ3GE75U2BR42BWCDMSKKB3I4W","short_pith_number":"pith:PJ3GE75U","canonical_record":{"source":{"id":"2605.12615","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-12T18:05:27Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"6c1c045ba8389d262518c310a1e687f7a711fe008856477b39a0d254f12995fa","abstract_canon_sha256":"3863f4a07e6d057d6cbc4851740c6b7892f0cee2a8e163873ed0509b8d240000"},"schema_version":"1.0"},"canonical_sha256":"7a76627fb4d063cd06c21b24a50768e5a10812083df674ab600ae3e8c780d1e6","source":{"kind":"arxiv","id":"2605.12615","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12615","created_at":"2026-05-18T03:10:00Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12615v1","created_at":"2026-05-18T03:10:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12615","created_at":"2026-05-18T03:10:00Z"},{"alias_kind":"pith_short_12","alias_value":"PJ3GE75U2BR4","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"PJ3GE75U2BR42BWC","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"PJ3GE75U","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:PJ3GE75U2BR42BWCDMSKKB3I4W","target":"record","payload":{"canonical_record":{"source":{"id":"2605.12615","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-12T18:05:27Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"6c1c045ba8389d262518c310a1e687f7a711fe008856477b39a0d254f12995fa","abstract_canon_sha256":"3863f4a07e6d057d6cbc4851740c6b7892f0cee2a8e163873ed0509b8d240000"},"schema_version":"1.0"},"canonical_sha256":"7a76627fb4d063cd06c21b24a50768e5a10812083df674ab600ae3e8c780d1e6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:00.528786Z","signature_b64":"lkWGuC7PXDE1Z36U9ZdlRLv2EBafQz9NQlLjHX1Vxpb+DnGpeOt87NDOUG7IOaesaLXFVR4m/wtMyntY8kzdCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a76627fb4d063cd06c21b24a50768e5a10812083df674ab600ae3e8c780d1e6","last_reissued_at":"2026-05-18T03:10:00.528172Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:00.528172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.12615","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:10:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MfaN5jtzFKPwczBVGFr9Qgxa32QHxnq/Jpih/44v8Ax5V2eX5PodHbFwbGnsfa9PWGr+ftQZj4FtxLW6Qn5gDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:33:54.751101Z"},"content_sha256":"8a2c99332b9621eb07195b9164260bb14ec969e3adf42aee602cd9bfe1977cd3","schema_version":"1.0","event_id":"sha256:8a2c99332b9621eb07195b9164260bb14ec969e3adf42aee602cd9bfe1977cd3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:PJ3GE75U2BR42BWCDMSKKB3I4W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum state isomorphism problems for groups","license":"http://creativecommons.org/licenses/by/4.0/","headline":"The quantum state isomorphism problem for mixed states under nontrivial finite group actions is QSZK-complete.","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Alexandru Gheorghiu, Arsalan Motamedi, Dale Jacobs, Saeed Mehraban","submitted_at":"2026-05-12T18:05:27Z","abstract_excerpt":"We study the computational complexity of quantum state isomorphism problems under group actions: given two quantum circuits that prepare pure or mixed states, decide whether the two states are related by a group action. This can be seen as a quantum state version of the Hidden Shift Problem, in much the same way that the State Hidden Subgroup Problem is a quantum version of the ordinary Hidden Subgroup Problem.\n  We prove several results for this computational problem:\n  - For the pure-state version, we show that the problem is BQP-hard for all nontrivial groups, and contained in QCMA $\\cap$ Q"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"For the mixed-state version, for nontrivial, finite and efficiently representable groups, the problem is QSZK-complete. We show that the abelian state hidden subgroup problem on mixed states is QSZK-hard in the worst case, thereby ruling out an efficient quantum algorithm unless QSZK = BQP.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The input states are given by quantum circuits; groups are nontrivial, finite, and efficiently representable (or use stellar representation for the bosonic case); standard quantum circuit model and group action definitions hold.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Quantum state isomorphism under group actions is BQP-hard for pure states across nontrivial groups and QSZK-complete for mixed states with finite groups; Pauli group version is BQP-complete and Clifford is GI-hard, ruling out efficient quantum algorithms for abelian mixed-state HS unless QSZK=BQP.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The quantum state isomorphism problem for mixed states under nontrivial finite group actions is QSZK-complete.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"d9f68d3e38ce8f94f89b89e4e5e642e533e89e0c9c57707c93594daeb1606b00"},"source":{"id":"2605.12615","kind":"arxiv","version":1},"verdict":{"id":"f2a1b6c5-14ac-4ae7-a769-7682346f47c0","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T20:27:43.329225Z","strongest_claim":"For the mixed-state version, for nontrivial, finite and efficiently representable groups, the problem is QSZK-complete. We show that the abelian state hidden subgroup problem on mixed states is QSZK-hard in the worst case, thereby ruling out an efficient quantum algorithm unless QSZK = BQP.","one_line_summary":"Quantum state isomorphism under group actions is BQP-hard for pure states across nontrivial groups and QSZK-complete for mixed states with finite groups; Pauli group version is BQP-complete and Clifford is GI-hard, ruling out efficient quantum algorithms for abelian mixed-state HS unless QSZK=BQP.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The input states are given by quantum circuits; groups are nontrivial, finite, and efficiently representable (or use stellar representation for the bosonic case); standard quantum circuit model and group action definitions hold.","pith_extraction_headline":"The quantum state isomorphism problem for mixed states under nontrivial finite group actions is QSZK-complete."},"references":{"count":51,"sample":[{"doi":"","year":2014,"title":"Physical Review A , volume=","work_id":"25957a12-7503-47ac-a3d9-1e6b53e6edcf","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Is Quantum Mechanics An Island In Theoryspace?","work_id":"d391bae6-f58e-43f1-ab15-c9a14cb4f415","ref_index":2,"cited_arxiv_id":"quant-ph/0401062","is_internal_anchor":true},{"doi":"","year":null,"title":"arXiv preprint arXiv:2102.05227 , year=","work_id":"ba313dd1-5c58-4dc7-974e-4821a0340a58","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Proceedings of the 57th Annual ACM Symposium on Theory of Computing , pages=","work_id":"0260aaac-2182-4432-ba99-f958a640eb4d","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"arXiv preprint arXiv:2505.15770 , year=","work_id":"1f543f3c-459c-44a0-9a51-343b52b14849","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":51,"snapshot_sha256":"6c103b61cbf9e4414170d04a1d3dc8a8b7cdddcfc199750b6fe73aea864caa12","internal_anchors":12},"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"},"verdict_id":"f2a1b6c5-14ac-4ae7-a769-7682346f47c0"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:10:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fWljyjZxwE9p/E95yhdNFCNknacoI2AhCp0KryNTFb7HW2WbO25My8snFx/lMob5G43vEj814ofOWzDaRDJQBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:33:54.751670Z"},"content_sha256":"54f03c991b6db309cc77dd2391dfa43a4a3762d441c8a7bb8692bbda7d2d42b0","schema_version":"1.0","event_id":"sha256:54f03c991b6db309cc77dd2391dfa43a4a3762d441c8a7bb8692bbda7d2d42b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PJ3GE75U2BR42BWCDMSKKB3I4W/bundle.json","state_url":"https://pith.science/pith/PJ3GE75U2BR42BWCDMSKKB3I4W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PJ3GE75U2BR42BWCDMSKKB3I4W/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T16:33:54Z","links":{"resolver":"https://pith.science/pith/PJ3GE75U2BR42BWCDMSKKB3I4W","bundle":"https://pith.science/pith/PJ3GE75U2BR42BWCDMSKKB3I4W/bundle.json","state":"https://pith.science/pith/PJ3GE75U2BR42BWCDMSKKB3I4W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PJ3GE75U2BR42BWCDMSKKB3I4W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:PJ3GE75U2BR42BWCDMSKKB3I4W","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3863f4a07e6d057d6cbc4851740c6b7892f0cee2a8e163873ed0509b8d240000","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-12T18:05:27Z","title_canon_sha256":"6c1c045ba8389d262518c310a1e687f7a711fe008856477b39a0d254f12995fa"},"schema_version":"1.0","source":{"id":"2605.12615","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12615","created_at":"2026-05-18T03:10:00Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12615v1","created_at":"2026-05-18T03:10:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12615","created_at":"2026-05-18T03:10:00Z"},{"alias_kind":"pith_short_12","alias_value":"PJ3GE75U2BR4","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"PJ3GE75U2BR42BWC","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"PJ3GE75U","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:54f03c991b6db309cc77dd2391dfa43a4a3762d441c8a7bb8692bbda7d2d42b0","target":"graph","created_at":"2026-05-18T03:10:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"For the mixed-state version, for nontrivial, finite and efficiently representable groups, the problem is QSZK-complete. We show that the abelian state hidden subgroup problem on mixed states is QSZK-hard in the worst case, thereby ruling out an efficient quantum algorithm unless QSZK = BQP."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The input states are given by quantum circuits; groups are nontrivial, finite, and efficiently representable (or use stellar representation for the bosonic case); standard quantum circuit model and group action definitions hold."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Quantum state isomorphism under group actions is BQP-hard for pure states across nontrivial groups and QSZK-complete for mixed states with finite groups; Pauli group version is BQP-complete and Clifford is GI-hard, ruling out efficient quantum algorithms for abelian mixed-state HS unless QSZK=BQP."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The quantum state isomorphism problem for mixed states under nontrivial finite group actions is QSZK-complete."}],"snapshot_sha256":"d9f68d3e38ce8f94f89b89e4e5e642e533e89e0c9c57707c93594daeb1606b00"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We study the computational complexity of quantum state isomorphism problems under group actions: given two quantum circuits that prepare pure or mixed states, decide whether the two states are related by a group action. This can be seen as a quantum state version of the Hidden Shift Problem, in much the same way that the State Hidden Subgroup Problem is a quantum version of the ordinary Hidden Subgroup Problem.\n  We prove several results for this computational problem:\n  - For the pure-state version, we show that the problem is BQP-hard for all nontrivial groups, and contained in QCMA $\\cap$ Q","authors_text":"Alexandru Gheorghiu, Arsalan Motamedi, Dale Jacobs, Saeed Mehraban","cross_cats":["cs.CC"],"headline":"The quantum state isomorphism problem for mixed states under nontrivial finite group actions is QSZK-complete.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-12T18:05:27Z","title":"Quantum state isomorphism problems for groups"},"references":{"count":51,"internal_anchors":12,"resolved_work":51,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Physical Review A , volume=","work_id":"25957a12-7503-47ac-a3d9-1e6b53e6edcf","year":2014},{"cited_arxiv_id":"quant-ph/0401062","doi":"","is_internal_anchor":true,"ref_index":2,"title":"Is Quantum Mechanics An Island In Theoryspace?","work_id":"d391bae6-f58e-43f1-ab15-c9a14cb4f415","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"arXiv preprint arXiv:2102.05227 , year=","work_id":"ba313dd1-5c58-4dc7-974e-4821a0340a58","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Proceedings of the 57th Annual ACM Symposium on Theory of Computing , pages=","work_id":"0260aaac-2182-4432-ba99-f958a640eb4d","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"arXiv preprint arXiv:2505.15770 , year=","work_id":"1f543f3c-459c-44a0-9a51-343b52b14849","year":null}],"snapshot_sha256":"6c103b61cbf9e4414170d04a1d3dc8a8b7cdddcfc199750b6fe73aea864caa12"},"source":{"id":"2605.12615","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T20:27:43.329225Z","id":"f2a1b6c5-14ac-4ae7-a769-7682346f47c0","model_set":{"reader":"grok-4.3"},"one_line_summary":"Quantum state isomorphism under group actions is BQP-hard for pure states across nontrivial groups and QSZK-complete for mixed states with finite groups; Pauli group version is BQP-complete and Clifford is GI-hard, ruling out efficient quantum algorithms for abelian mixed-state HS unless QSZK=BQP.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The quantum state isomorphism problem for mixed states under nontrivial finite group actions is QSZK-complete.","strongest_claim":"For the mixed-state version, for nontrivial, finite and efficiently representable groups, the problem is QSZK-complete. We show that the abelian state hidden subgroup problem on mixed states is QSZK-hard in the worst case, thereby ruling out an efficient quantum algorithm unless QSZK = BQP.","weakest_assumption":"The input states are given by quantum circuits; groups are nontrivial, finite, and efficiently representable (or use stellar representation for the bosonic case); standard quantum circuit model and group action definitions hold."}},"verdict_id":"f2a1b6c5-14ac-4ae7-a769-7682346f47c0"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8a2c99332b9621eb07195b9164260bb14ec969e3adf42aee602cd9bfe1977cd3","target":"record","created_at":"2026-05-18T03:10:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3863f4a07e6d057d6cbc4851740c6b7892f0cee2a8e163873ed0509b8d240000","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-12T18:05:27Z","title_canon_sha256":"6c1c045ba8389d262518c310a1e687f7a711fe008856477b39a0d254f12995fa"},"schema_version":"1.0","source":{"id":"2605.12615","kind":"arxiv","version":1}},"canonical_sha256":"7a76627fb4d063cd06c21b24a50768e5a10812083df674ab600ae3e8c780d1e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a76627fb4d063cd06c21b24a50768e5a10812083df674ab600ae3e8c780d1e6","first_computed_at":"2026-05-18T03:10:00.528172Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:00.528172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lkWGuC7PXDE1Z36U9ZdlRLv2EBafQz9NQlLjHX1Vxpb+DnGpeOt87NDOUG7IOaesaLXFVR4m/wtMyntY8kzdCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:00.528786Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.12615","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a2c99332b9621eb07195b9164260bb14ec969e3adf42aee602cd9bfe1977cd3","sha256:54f03c991b6db309cc77dd2391dfa43a4a3762d441c8a7bb8692bbda7d2d42b0"],"state_sha256":"1ac6387af8149d9d1c79e9d364220d36956c5a24d079d6ba3630f61cc2871448"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H+UWtom5mPgFf5LhicqjVOi8n4bhHnQZOXhl67WHPjdUM2dIY8KJNV+nRzCalAw/zXeQAbas5ge01riZpGiKDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:33:54.754436Z","bundle_sha256":"72556a953b9fcbabfbdf1dd2de321f082fc76920602728474ac1f251342d0f39"}}