{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:YQPHEHXOE7WFJGWPYRC3DYPQRE","short_pith_number":"pith:YQPHEHXO","canonical_record":{"source":{"id":"2604.27457","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-04-30T05:52:49Z","cross_cats_sorted":[],"title_canon_sha256":"f68325077631bd3291f6890559aad2983956073a17848f5844e0684ca4d6149e","abstract_canon_sha256":"5131be80cd1c54e2dc6fe3166e1157a0c15af07f97c3376f4213671d81bacef6"},"schema_version":"1.0"},"canonical_sha256":"c41e721eee27ec549acfc445b1e1f089061065997c433d3e2dcd0bbe121f8e92","source":{"kind":"arxiv","id":"2604.27457","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.27457","created_at":"2026-06-19T16:09:58Z"},{"alias_kind":"arxiv_version","alias_value":"2604.27457v2","created_at":"2026-06-19T16:09:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.27457","created_at":"2026-06-19T16:09:58Z"},{"alias_kind":"pith_short_12","alias_value":"YQPHEHXOE7WF","created_at":"2026-06-19T16:09:58Z"},{"alias_kind":"pith_short_16","alias_value":"YQPHEHXOE7WFJGWP","created_at":"2026-06-19T16:09:58Z"},{"alias_kind":"pith_short_8","alias_value":"YQPHEHXO","created_at":"2026-06-19T16:09:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:YQPHEHXOE7WFJGWPYRC3DYPQRE","target":"record","payload":{"canonical_record":{"source":{"id":"2604.27457","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-04-30T05:52:49Z","cross_cats_sorted":[],"title_canon_sha256":"f68325077631bd3291f6890559aad2983956073a17848f5844e0684ca4d6149e","abstract_canon_sha256":"5131be80cd1c54e2dc6fe3166e1157a0c15af07f97c3376f4213671d81bacef6"},"schema_version":"1.0"},"canonical_sha256":"c41e721eee27ec549acfc445b1e1f089061065997c433d3e2dcd0bbe121f8e92","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:09:58.656000Z","signature_b64":"OrNONkBffK3ab14BDHkz1ZGhAwyyunvZRqRozjAa1KQd1BhFmXV880+0XbSOwwA3J6ArDHni/S9gcD6Ui5z7AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c41e721eee27ec549acfc445b1e1f089061065997c433d3e2dcd0bbe121f8e92","last_reissued_at":"2026-06-19T16:09:58.655611Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:09:58.655611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.27457","source_version":2,"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-06-19T16:09:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dXLdbv7gc2RF/ZyairiYMifti1j5y8bUBzMlEz60BKL2o1N1bdnqvRgCYVmEP4EVjQiTX14Gf9FLeTThzmYZDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T14:20:46.233805Z"},"content_sha256":"6947746d85355f439740fde4669f1dc14254177169e779301c986769612e0ad3","schema_version":"1.0","event_id":"sha256:6947746d85355f439740fde4669f1dc14254177169e779301c986769612e0ad3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:YQPHEHXOE7WFJGWPYRC3DYPQRE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Demonstration of Exponential Quantum Speedup with Constant-Depth Compiled Circuits for Simon's Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Hardware-aware compilation to constant depth demonstrates exponential quantum speedup for restricted Simon's problem on current processors.","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel A. Lidar, Phattharaporn Singkanipa, Victor Kasatkin","submitted_at":"2026-04-30T05:52:49Z","abstract_excerpt":"We demonstrate exponential algorithmic quantum speedup for a restricted-Hamming-weight version of Simon's problem, in which the hidden string $b$ is promised to satisfy $\\text{HW}(b)\\le w$ for a Hamming-weight cutoff $w$, on present-day superconducting quantum processors. We introduce a hardware-aware compilation strategy that reduces the quantum part of each Simon query circuit to constant depth. The resulting compiled circuits have $O(1)$ depth, require only linear nearest-neighbor connectivity, map directly onto common device layouts, and avoid additional routing and SWAP overhead. Implemen"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We demonstrate exponential quantum speedup for a restricted-Hamming-weight version of Simon's problem on present-day superconducting quantum processors by introducing a hardware-aware compilation strategy that compiles the quantum part of each Simon query circuit to constant depth.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The observed number-of-queries-to-solution metric on the IBM processors reflects genuine algorithmic quantum speedup arising from interference rather than residual classical simulability of the restricted-Hamming-weight instances or unaccounted noise effects.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Hardware-aware constant-depth compilation enables experimental demonstration of exponential quantum speedup for restricted Simon's problem on NISQ superconducting processors.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Hardware-aware compilation to constant depth demonstrates exponential quantum speedup for restricted Simon's problem on current processors.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"25e62604afc43918f0958e6171824bc99395a4f88900d9cea555f0172ade1c0c"},"source":{"id":"2604.27457","kind":"arxiv","version":2},"verdict":{"id":"c93b923a-b9e6-4b19-843a-cce6224b89eb","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-07T07:51:29.902667Z","strongest_claim":"We demonstrate exponential quantum speedup for a restricted-Hamming-weight version of Simon's problem on present-day superconducting quantum processors by introducing a hardware-aware compilation strategy that compiles the quantum part of each Simon query circuit to constant depth.","one_line_summary":"Hardware-aware constant-depth compilation enables experimental demonstration of exponential quantum speedup for restricted Simon's problem on NISQ superconducting processors.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The observed number-of-queries-to-solution metric on the IBM processors reflects genuine algorithmic quantum speedup arising from interference rather than residual classical simulability of the restricted-Hamming-weight instances or unaccounted noise effects.","pith_extraction_headline":"Hardware-aware compilation to constant depth demonstrates exponential quantum speedup for restricted Simon's problem on current processors."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.27457/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T22:36:04.978414Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T19:15:19.812414Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"a12d90b8623c13f407f8985e55238fe03188fe06eb2fbb16ff882270c6323716"},"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":"c93b923a-b9e6-4b19-843a-cce6224b89eb"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-19T16:09:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FjfKI7IjNmhpHNRJUnOkC+PsHjvB794g00xiz41PLTZ2cPbvwUk+OYQK63bJ++YIXE4uyPo8uJ97wrilF1otAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T14:20:46.234306Z"},"content_sha256":"acabf2447b51069ec2471a638dd3e0ad5c799102b0a79b2e19c0543c854a7239","schema_version":"1.0","event_id":"sha256:acabf2447b51069ec2471a638dd3e0ad5c799102b0a79b2e19c0543c854a7239"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YQPHEHXOE7WFJGWPYRC3DYPQRE/bundle.json","state_url":"https://pith.science/pith/YQPHEHXOE7WFJGWPYRC3DYPQRE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YQPHEHXOE7WFJGWPYRC3DYPQRE/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-06-23T14:20:46Z","links":{"resolver":"https://pith.science/pith/YQPHEHXOE7WFJGWPYRC3DYPQRE","bundle":"https://pith.science/pith/YQPHEHXOE7WFJGWPYRC3DYPQRE/bundle.json","state":"https://pith.science/pith/YQPHEHXOE7WFJGWPYRC3DYPQRE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YQPHEHXOE7WFJGWPYRC3DYPQRE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:YQPHEHXOE7WFJGWPYRC3DYPQRE","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":"5131be80cd1c54e2dc6fe3166e1157a0c15af07f97c3376f4213671d81bacef6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-04-30T05:52:49Z","title_canon_sha256":"f68325077631bd3291f6890559aad2983956073a17848f5844e0684ca4d6149e"},"schema_version":"1.0","source":{"id":"2604.27457","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.27457","created_at":"2026-06-19T16:09:58Z"},{"alias_kind":"arxiv_version","alias_value":"2604.27457v2","created_at":"2026-06-19T16:09:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.27457","created_at":"2026-06-19T16:09:58Z"},{"alias_kind":"pith_short_12","alias_value":"YQPHEHXOE7WF","created_at":"2026-06-19T16:09:58Z"},{"alias_kind":"pith_short_16","alias_value":"YQPHEHXOE7WFJGWP","created_at":"2026-06-19T16:09:58Z"},{"alias_kind":"pith_short_8","alias_value":"YQPHEHXO","created_at":"2026-06-19T16:09:58Z"}],"graph_snapshots":[{"event_id":"sha256:acabf2447b51069ec2471a638dd3e0ad5c799102b0a79b2e19c0543c854a7239","target":"graph","created_at":"2026-06-19T16:09:58Z","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":"We demonstrate exponential quantum speedup for a restricted-Hamming-weight version of Simon's problem on present-day superconducting quantum processors by introducing a hardware-aware compilation strategy that compiles the quantum part of each Simon query circuit to constant depth."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The observed number-of-queries-to-solution metric on the IBM processors reflects genuine algorithmic quantum speedup arising from interference rather than residual classical simulability of the restricted-Hamming-weight instances or unaccounted noise effects."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Hardware-aware constant-depth compilation enables experimental demonstration of exponential quantum speedup for restricted Simon's problem on NISQ superconducting processors."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Hardware-aware compilation to constant depth demonstrates exponential quantum speedup for restricted Simon's problem on current processors."}],"snapshot_sha256":"25e62604afc43918f0958e6171824bc99395a4f88900d9cea555f0172ade1c0c"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-20T22:36:04.978414Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T19:15:19.812414Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2604.27457/integrity.json","findings":[],"snapshot_sha256":"a12d90b8623c13f407f8985e55238fe03188fe06eb2fbb16ff882270c6323716","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We demonstrate exponential algorithmic quantum speedup for a restricted-Hamming-weight version of Simon's problem, in which the hidden string $b$ is promised to satisfy $\\text{HW}(b)\\le w$ for a Hamming-weight cutoff $w$, on present-day superconducting quantum processors. We introduce a hardware-aware compilation strategy that reduces the quantum part of each Simon query circuit to constant depth. The resulting compiled circuits have $O(1)$ depth, require only linear nearest-neighbor connectivity, map directly onto common device layouts, and avoid additional routing and SWAP overhead. Implemen","authors_text":"Daniel A. Lidar, Phattharaporn Singkanipa, Victor Kasatkin","cross_cats":[],"headline":"Hardware-aware compilation to constant depth demonstrates exponential quantum speedup for restricted Simon's problem on current processors.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-04-30T05:52:49Z","title":"Demonstration of Exponential Quantum Speedup with Constant-Depth Compiled Circuits for Simon's Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.27457","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-07T07:51:29.902667Z","id":"c93b923a-b9e6-4b19-843a-cce6224b89eb","model_set":{"reader":"grok-4.3"},"one_line_summary":"Hardware-aware constant-depth compilation enables experimental demonstration of exponential quantum speedup for restricted Simon's problem on NISQ superconducting processors.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Hardware-aware compilation to constant depth demonstrates exponential quantum speedup for restricted Simon's problem on current processors.","strongest_claim":"We demonstrate exponential quantum speedup for a restricted-Hamming-weight version of Simon's problem on present-day superconducting quantum processors by introducing a hardware-aware compilation strategy that compiles the quantum part of each Simon query circuit to constant depth.","weakest_assumption":"The observed number-of-queries-to-solution metric on the IBM processors reflects genuine algorithmic quantum speedup arising from interference rather than residual classical simulability of the restricted-Hamming-weight instances or unaccounted noise effects."}},"verdict_id":"c93b923a-b9e6-4b19-843a-cce6224b89eb"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6947746d85355f439740fde4669f1dc14254177169e779301c986769612e0ad3","target":"record","created_at":"2026-06-19T16:09:58Z","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":"5131be80cd1c54e2dc6fe3166e1157a0c15af07f97c3376f4213671d81bacef6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-04-30T05:52:49Z","title_canon_sha256":"f68325077631bd3291f6890559aad2983956073a17848f5844e0684ca4d6149e"},"schema_version":"1.0","source":{"id":"2604.27457","kind":"arxiv","version":2}},"canonical_sha256":"c41e721eee27ec549acfc445b1e1f089061065997c433d3e2dcd0bbe121f8e92","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c41e721eee27ec549acfc445b1e1f089061065997c433d3e2dcd0bbe121f8e92","first_computed_at":"2026-06-19T16:09:58.655611Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:09:58.655611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OrNONkBffK3ab14BDHkz1ZGhAwyyunvZRqRozjAa1KQd1BhFmXV880+0XbSOwwA3J6ArDHni/S9gcD6Ui5z7AA==","signature_status":"signed_v1","signed_at":"2026-06-19T16:09:58.656000Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.27457","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6947746d85355f439740fde4669f1dc14254177169e779301c986769612e0ad3","sha256:acabf2447b51069ec2471a638dd3e0ad5c799102b0a79b2e19c0543c854a7239"],"state_sha256":"a2777ea5e6f62d32c31092f2b5500fd9ab891872ecb1d953710559c03592060f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z+SVancJMf8w64TWIXT1Mq68l996jCOxxcWnXgbRWQJtpvaH6axtlCJsmnXJeGEhhL9EtwIQ8BtkUn4tMGXcDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T14:20:46.236596Z","bundle_sha256":"6894edd272445dbe12e61007ff6b11dfb9abdc3106568d78cef4661c551f3065"}}