{"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"}