{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MWORSX27ARIPXBRGINMSX5DJKS","short_pith_number":"pith:MWORSX27","canonical_record":{"source":{"id":"1811.07722","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-11-16T06:22:45Z","cross_cats_sorted":[],"title_canon_sha256":"fdbad61460ba77af6e5654b23de6f82db5ae606684a59e9ee9b43ab21ec03167","abstract_canon_sha256":"f5597fe6385292f4081b648a6615896858dec5613b4a488d482ac99c365219be"},"schema_version":"1.0"},"canonical_sha256":"659d195f5f0450fb862643592bf46954a08d58549f120280546a13933072161e","source":{"kind":"arxiv","id":"1811.07722","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.07722","created_at":"2026-07-05T04:55:59Z"},{"alias_kind":"arxiv_version","alias_value":"1811.07722v3","created_at":"2026-07-05T04:55:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07722","created_at":"2026-07-05T04:55:59Z"},{"alias_kind":"pith_short_12","alias_value":"MWORSX27ARIP","created_at":"2026-07-05T04:55:59Z"},{"alias_kind":"pith_short_16","alias_value":"MWORSX27ARIPXBRG","created_at":"2026-07-05T04:55:59Z"},{"alias_kind":"pith_short_8","alias_value":"MWORSX27","created_at":"2026-07-05T04:55:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MWORSX27ARIPXBRGINMSX5DJKS","target":"record","payload":{"canonical_record":{"source":{"id":"1811.07722","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-11-16T06:22:45Z","cross_cats_sorted":[],"title_canon_sha256":"fdbad61460ba77af6e5654b23de6f82db5ae606684a59e9ee9b43ab21ec03167","abstract_canon_sha256":"f5597fe6385292f4081b648a6615896858dec5613b4a488d482ac99c365219be"},"schema_version":"1.0"},"canonical_sha256":"659d195f5f0450fb862643592bf46954a08d58549f120280546a13933072161e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:55:59.702895Z","signature_b64":"bkIo6m9mLu3yrNC4fA/hEriLy+gmPZyE7qLZfF1c4jE81NxXxmMdjVkqnTV5zb7vQPWgKZd1F7hOzDFewBpzDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"659d195f5f0450fb862643592bf46954a08d58549f120280546a13933072161e","last_reissued_at":"2026-07-05T04:55:59.702531Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:55:59.702531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.07722","source_version":3,"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-07-05T04:55:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mOVVrokfUO0QYbgKScCJSs7lotMLLSfu1fkvpd5OdouRVGEJEJ1qQSH09wrNcbUWsomLVkyzkaj+x4ccO/veBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T15:08:54.527627Z"},"content_sha256":"717ef27c317c198132f51b136acaf9518c47462202d0b89b7f90c757f5492218","schema_version":"1.0","event_id":"sha256:717ef27c317c198132f51b136acaf9518c47462202d0b89b7f90c757f5492218"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MWORSX27ARIPXBRGINMSX5DJKS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Equivalence Checking of Sequential Quantum Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Mingsheng Ying, Qisheng Wang, Riling Li","submitted_at":"2018-11-16T06:22:45Z","abstract_excerpt":"We define a formal framework for equivalence checking of sequential quantum circuits. The model we adopt is a quantum state machine, which is a natural quantum generalisation of Mealy machines. A major difficulty in checking quantum circuits (but not present in checking classical circuits) is that the state spaces of quantum circuits are continuums. This difficulty is resolved by our main theorem showing that equivalence checking of two quantum Mealy machines can be done with input sequences that are taken from some chosen basis (which are finite) and have a length quadratic in the dimensions "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07722","kind":"arxiv","version":3},"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/1811.07722/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:55:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ywhc+XosHIdzeeRU7ogGFfpQrYQoLrbhE9yWNAsvoEtIQGuIoLJ20E3r1pKDfJ7/U6is+OwgPhu+k2Nbuxb6DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T15:08:54.528143Z"},"content_sha256":"9f677ffd5f41c100085e3f95bbb968046698dca1f52b4a3359e28e5e43fd5496","schema_version":"1.0","event_id":"sha256:9f677ffd5f41c100085e3f95bbb968046698dca1f52b4a3359e28e5e43fd5496"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MWORSX27ARIPXBRGINMSX5DJKS/bundle.json","state_url":"https://pith.science/pith/MWORSX27ARIPXBRGINMSX5DJKS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MWORSX27ARIPXBRGINMSX5DJKS/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-08-04T15:08:54Z","links":{"resolver":"https://pith.science/pith/MWORSX27ARIPXBRGINMSX5DJKS","bundle":"https://pith.science/pith/MWORSX27ARIPXBRGINMSX5DJKS/bundle.json","state":"https://pith.science/pith/MWORSX27ARIPXBRGINMSX5DJKS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MWORSX27ARIPXBRGINMSX5DJKS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MWORSX27ARIPXBRGINMSX5DJKS","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":"f5597fe6385292f4081b648a6615896858dec5613b4a488d482ac99c365219be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-11-16T06:22:45Z","title_canon_sha256":"fdbad61460ba77af6e5654b23de6f82db5ae606684a59e9ee9b43ab21ec03167"},"schema_version":"1.0","source":{"id":"1811.07722","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.07722","created_at":"2026-07-05T04:55:59Z"},{"alias_kind":"arxiv_version","alias_value":"1811.07722v3","created_at":"2026-07-05T04:55:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07722","created_at":"2026-07-05T04:55:59Z"},{"alias_kind":"pith_short_12","alias_value":"MWORSX27ARIP","created_at":"2026-07-05T04:55:59Z"},{"alias_kind":"pith_short_16","alias_value":"MWORSX27ARIPXBRG","created_at":"2026-07-05T04:55:59Z"},{"alias_kind":"pith_short_8","alias_value":"MWORSX27","created_at":"2026-07-05T04:55:59Z"}],"graph_snapshots":[{"event_id":"sha256:9f677ffd5f41c100085e3f95bbb968046698dca1f52b4a3359e28e5e43fd5496","target":"graph","created_at":"2026-07-05T04:55:59Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1811.07722/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We define a formal framework for equivalence checking of sequential quantum circuits. The model we adopt is a quantum state machine, which is a natural quantum generalisation of Mealy machines. A major difficulty in checking quantum circuits (but not present in checking classical circuits) is that the state spaces of quantum circuits are continuums. This difficulty is resolved by our main theorem showing that equivalence checking of two quantum Mealy machines can be done with input sequences that are taken from some chosen basis (which are finite) and have a length quadratic in the dimensions ","authors_text":"Mingsheng Ying, Qisheng Wang, Riling Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-11-16T06:22:45Z","title":"Equivalence Checking of Sequential Quantum Circuits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07722","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:717ef27c317c198132f51b136acaf9518c47462202d0b89b7f90c757f5492218","target":"record","created_at":"2026-07-05T04:55:59Z","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":"f5597fe6385292f4081b648a6615896858dec5613b4a488d482ac99c365219be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-11-16T06:22:45Z","title_canon_sha256":"fdbad61460ba77af6e5654b23de6f82db5ae606684a59e9ee9b43ab21ec03167"},"schema_version":"1.0","source":{"id":"1811.07722","kind":"arxiv","version":3}},"canonical_sha256":"659d195f5f0450fb862643592bf46954a08d58549f120280546a13933072161e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"659d195f5f0450fb862643592bf46954a08d58549f120280546a13933072161e","first_computed_at":"2026-07-05T04:55:59.702531Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:55:59.702531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bkIo6m9mLu3yrNC4fA/hEriLy+gmPZyE7qLZfF1c4jE81NxXxmMdjVkqnTV5zb7vQPWgKZd1F7hOzDFewBpzDA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:55:59.702895Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.07722","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:717ef27c317c198132f51b136acaf9518c47462202d0b89b7f90c757f5492218","sha256:9f677ffd5f41c100085e3f95bbb968046698dca1f52b4a3359e28e5e43fd5496"],"state_sha256":"b6d09994598803485a0f5736e6e7231de9f5001bffc27fdaacd0851debdbafef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qMISnSTB1vMSGFFyOzZ5zWkRJ7uq19vVFrt+5Q5WLQRqU+UQOFcE9afv+JNI6mlv+viUaiuf86kvNce37teNBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T15:08:54.540164Z","bundle_sha256":"e1eab334fcfeaa1c8c8bdb59c25b5b342213a9acc007e93f6504e683267276a3"}}