{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:EWNJTAY4K3W7S67SQRYEWEAPZ6","short_pith_number":"pith:EWNJTAY4","schema_version":"1.0","canonical_sha256":"259a99831c56edf97bf284704b100fcfbedb86548c3140c71ff2551cd03f81b1","source":{"kind":"arxiv","id":"2401.07934","version":3},"attestation_state":"computed","paper":{"title":"Demonstration of Algorithmic Quantum Speedup for an Abelian Hidden Subgroup Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"D.A. Lidar, G. Quiroz, P. Singkanipa, V. Kasatkin, Z. Zhou","submitted_at":"2024-01-15T19:52:31Z","abstract_excerpt":"Simon's problem is to find a hidden period (a bitstring) encoded into an unknown 2-to-1 function. It is one of the earliest problems for which an exponential quantum speedup was proven for ideal, noiseless quantum computers, albeit in the oracle model. Here, using two different 127-qubit IBM Quantum superconducting processors, we demonstrate an algorithmic quantum speedup for a variant of Simon's problem where the hidden period has a restricted Hamming weight $w$. For sufficiently small values of $w$ and for circuits involving up to 58 qubits, we demonstrate an exponential speedup, albeit of a"},"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":"2401.07934","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-01-15T19:52:31Z","cross_cats_sorted":[],"title_canon_sha256":"378f8e5590c9ea8daff663928c028412d13c7fe248788ddb3b79c0543404a18d","abstract_canon_sha256":"bcc275e7c9219cd7d250ec44614f93a6485ce76c262c1b16ecab8532a96c7a99"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:19:18.602727Z","signature_b64":"F7lmoxFWFSzcCDDYNL9jOYNPIloH+W5VJtZFd70hYDVTlt9PYVNyPkMV+FZ9Xzj7IEwDwV/GCPadfG8Xk1skBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"259a99831c56edf97bf284704b100fcfbedb86548c3140c71ff2551cd03f81b1","last_reissued_at":"2026-07-05T11:19:18.602179Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:19:18.602179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Demonstration of Algorithmic Quantum Speedup for an Abelian Hidden Subgroup Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"D.A. Lidar, G. Quiroz, P. Singkanipa, V. Kasatkin, Z. Zhou","submitted_at":"2024-01-15T19:52:31Z","abstract_excerpt":"Simon's problem is to find a hidden period (a bitstring) encoded into an unknown 2-to-1 function. It is one of the earliest problems for which an exponential quantum speedup was proven for ideal, noiseless quantum computers, albeit in the oracle model. Here, using two different 127-qubit IBM Quantum superconducting processors, we demonstrate an algorithmic quantum speedup for a variant of Simon's problem where the hidden period has a restricted Hamming weight $w$. For sufficiently small values of $w$ and for circuits involving up to 58 qubits, we demonstrate an exponential speedup, albeit of a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.07934","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/2401.07934/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2401.07934","created_at":"2026-07-05T11:19:18.602243+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.07934v3","created_at":"2026-07-05T11:19:18.602243+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.07934","created_at":"2026-07-05T11:19:18.602243+00:00"},{"alias_kind":"pith_short_12","alias_value":"EWNJTAY4K3W7","created_at":"2026-07-05T11:19:18.602243+00:00"},{"alias_kind":"pith_short_16","alias_value":"EWNJTAY4K3W7S67S","created_at":"2026-07-05T11:19:18.602243+00:00"},{"alias_kind":"pith_short_8","alias_value":"EWNJTAY4","created_at":"2026-07-05T11:19:18.602243+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2403.02294","citing_title":"Empirical learning of dynamical decoupling on quantum processors","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2404.10214","citing_title":"Simulating Chemistry on Bosonic Quantum Devices","ref_index":33,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EWNJTAY4K3W7S67SQRYEWEAPZ6","json":"https://pith.science/pith/EWNJTAY4K3W7S67SQRYEWEAPZ6.json","graph_json":"https://pith.science/api/pith-number/EWNJTAY4K3W7S67SQRYEWEAPZ6/graph.json","events_json":"https://pith.science/api/pith-number/EWNJTAY4K3W7S67SQRYEWEAPZ6/events.json","paper":"https://pith.science/paper/EWNJTAY4"},"agent_actions":{"view_html":"https://pith.science/pith/EWNJTAY4K3W7S67SQRYEWEAPZ6","download_json":"https://pith.science/pith/EWNJTAY4K3W7S67SQRYEWEAPZ6.json","view_paper":"https://pith.science/paper/EWNJTAY4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.07934&json=true","fetch_graph":"https://pith.science/api/pith-number/EWNJTAY4K3W7S67SQRYEWEAPZ6/graph.json","fetch_events":"https://pith.science/api/pith-number/EWNJTAY4K3W7S67SQRYEWEAPZ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EWNJTAY4K3W7S67SQRYEWEAPZ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EWNJTAY4K3W7S67SQRYEWEAPZ6/action/storage_attestation","attest_author":"https://pith.science/pith/EWNJTAY4K3W7S67SQRYEWEAPZ6/action/author_attestation","sign_citation":"https://pith.science/pith/EWNJTAY4K3W7S67SQRYEWEAPZ6/action/citation_signature","submit_replication":"https://pith.science/pith/EWNJTAY4K3W7S67SQRYEWEAPZ6/action/replication_record"}},"created_at":"2026-07-05T11:19:18.602243+00:00","updated_at":"2026-07-05T11:19:18.602243+00:00"}