{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:VQTIHWEFWH522CF7PZ656RUIL5","short_pith_number":"pith:VQTIHWEF","schema_version":"1.0","canonical_sha256":"ac2683d885b1fbad08bf7e7ddf46885f647d351b9002ba99b7d1e926c82bff97","source":{"kind":"arxiv","id":"1401.6249","version":1},"attestation_state":"computed","paper":{"title":"(Un)decidable Problems about Reachability of Quantum Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.LO","authors_text":"Mingsheng Ying, Yangjia Li","submitted_at":"2014-01-24T03:47:29Z","abstract_excerpt":"We study the reachability problem of a quantum system modelled by a quantum automaton. The reachable sets are chosen to be boolean combinations of (closed) subspaces of the state space of the quantum system. Four different reachability properties are considered: eventually reachable, globally reachable, ultimately forever reachable, and infinitely often reachable. The main result of this paper is that all of the four reachability properties are undecidable in general; however, the last three become decidable if the reachable sets are boolean combinations without negation."},"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":"1401.6249","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-24T03:47:29Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"5d86d7630975c6215150036f062fba7b34838c2694799f2e9c7ca0bfad0aa450","abstract_canon_sha256":"d8a0aa75aba96c07d04edde657cc7ce5b08d296a44508c84ef46f24ee2f98138"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:12.718053Z","signature_b64":"SjeqTAPmvFwhWwPoE6WeTHS56X1jgB+dPAzQtKHPt3YgEExGijDHNAAxb7+av8fd4k8fXsh9KXm6UYXSIDb3Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac2683d885b1fbad08bf7e7ddf46885f647d351b9002ba99b7d1e926c82bff97","last_reissued_at":"2026-05-18T03:01:12.717264Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:12.717264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"(Un)decidable Problems about Reachability of Quantum Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.LO","authors_text":"Mingsheng Ying, Yangjia Li","submitted_at":"2014-01-24T03:47:29Z","abstract_excerpt":"We study the reachability problem of a quantum system modelled by a quantum automaton. The reachable sets are chosen to be boolean combinations of (closed) subspaces of the state space of the quantum system. Four different reachability properties are considered: eventually reachable, globally reachable, ultimately forever reachable, and infinitely often reachable. The main result of this paper is that all of the four reachability properties are undecidable in general; however, the last three become decidable if the reachable sets are boolean combinations without negation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6249","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":""},"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":"1401.6249","created_at":"2026-05-18T03:01:12.717391+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.6249v1","created_at":"2026-05-18T03:01:12.717391+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6249","created_at":"2026-05-18T03:01:12.717391+00:00"},{"alias_kind":"pith_short_12","alias_value":"VQTIHWEFWH52","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"VQTIHWEFWH522CF7","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"VQTIHWEF","created_at":"2026-05-18T12:28:54.890064+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/VQTIHWEFWH522CF7PZ656RUIL5","json":"https://pith.science/pith/VQTIHWEFWH522CF7PZ656RUIL5.json","graph_json":"https://pith.science/api/pith-number/VQTIHWEFWH522CF7PZ656RUIL5/graph.json","events_json":"https://pith.science/api/pith-number/VQTIHWEFWH522CF7PZ656RUIL5/events.json","paper":"https://pith.science/paper/VQTIHWEF"},"agent_actions":{"view_html":"https://pith.science/pith/VQTIHWEFWH522CF7PZ656RUIL5","download_json":"https://pith.science/pith/VQTIHWEFWH522CF7PZ656RUIL5.json","view_paper":"https://pith.science/paper/VQTIHWEF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.6249&json=true","fetch_graph":"https://pith.science/api/pith-number/VQTIHWEFWH522CF7PZ656RUIL5/graph.json","fetch_events":"https://pith.science/api/pith-number/VQTIHWEFWH522CF7PZ656RUIL5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VQTIHWEFWH522CF7PZ656RUIL5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VQTIHWEFWH522CF7PZ656RUIL5/action/storage_attestation","attest_author":"https://pith.science/pith/VQTIHWEFWH522CF7PZ656RUIL5/action/author_attestation","sign_citation":"https://pith.science/pith/VQTIHWEFWH522CF7PZ656RUIL5/action/citation_signature","submit_replication":"https://pith.science/pith/VQTIHWEFWH522CF7PZ656RUIL5/action/replication_record"}},"created_at":"2026-05-18T03:01:12.717391+00:00","updated_at":"2026-05-18T03:01:12.717391+00:00"}