{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:ZAIXIK4E33MVGI5HUCZ3HV6Q24","short_pith_number":"pith:ZAIXIK4E","schema_version":"1.0","canonical_sha256":"c811742b84ded95323a7a0b3b3d7d0d72536477cc8a40e15d1efcc8dac4de899","source":{"kind":"arxiv","id":"quant-ph/0401083","version":1},"attestation_state":"computed","paper":{"title":"The quantum query complexity of the hidden subgroup problem is polynomial","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Emanuel Knill, Mark Ettinger, Peter Hoyer","submitted_at":"2004-01-14T21:26:38Z","abstract_excerpt":"We present a quantum algorithm which identifies with certainty a hidden subgroup of an arbitrary finite group G in only a polynomial (in log |G|) number of calls to the oracle. This is exponentially better than the best classical algorithm. However our quantum algorithm requires exponential time, as in the classical case. Our algorithm utilizes a new technique for constructing error-free algorithms for non-decision problems on quantum computers."},"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":"quant-ph/0401083","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2004-01-14T21:26:38Z","cross_cats_sorted":[],"title_canon_sha256":"e9223e2e1ea891e3c04780258b9aba75df46f45635cf98aa5d1cd2fab02085da","abstract_canon_sha256":"e93eb6a8f7525343f1999326bed5ace8cf95b24ea3929d00104b7f855cae334f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:45.901504Z","signature_b64":"rnqf/MIkGagtURq5dO8tY2TMS8FD/fJLh8S+nUA2o08bTHNSKzAZQWQa09ekKBvHujv+awDQ76UFvM6mTVTdDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c811742b84ded95323a7a0b3b3d7d0d72536477cc8a40e15d1efcc8dac4de899","last_reissued_at":"2026-05-18T00:53:45.900885Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:45.900885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The quantum query complexity of the hidden subgroup problem is polynomial","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Emanuel Knill, Mark Ettinger, Peter Hoyer","submitted_at":"2004-01-14T21:26:38Z","abstract_excerpt":"We present a quantum algorithm which identifies with certainty a hidden subgroup of an arbitrary finite group G in only a polynomial (in log |G|) number of calls to the oracle. This is exponentially better than the best classical algorithm. However our quantum algorithm requires exponential time, as in the classical case. Our algorithm utilizes a new technique for constructing error-free algorithms for non-decision problems on quantum computers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0401083","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":"quant-ph/0401083","created_at":"2026-05-18T00:53:45.900989+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0401083v1","created_at":"2026-05-18T00:53:45.900989+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0401083","created_at":"2026-05-18T00:53:45.900989+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZAIXIK4E33MV","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZAIXIK4E33MVGI5H","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZAIXIK4E","created_at":"2026-05-18T12:25:52.687210+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.12385","citing_title":"Lower overhead fault-tolerant building blocks for noisy quantum computers","ref_index":295,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZAIXIK4E33MVGI5HUCZ3HV6Q24","json":"https://pith.science/pith/ZAIXIK4E33MVGI5HUCZ3HV6Q24.json","graph_json":"https://pith.science/api/pith-number/ZAIXIK4E33MVGI5HUCZ3HV6Q24/graph.json","events_json":"https://pith.science/api/pith-number/ZAIXIK4E33MVGI5HUCZ3HV6Q24/events.json","paper":"https://pith.science/paper/ZAIXIK4E"},"agent_actions":{"view_html":"https://pith.science/pith/ZAIXIK4E33MVGI5HUCZ3HV6Q24","download_json":"https://pith.science/pith/ZAIXIK4E33MVGI5HUCZ3HV6Q24.json","view_paper":"https://pith.science/paper/ZAIXIK4E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0401083&json=true","fetch_graph":"https://pith.science/api/pith-number/ZAIXIK4E33MVGI5HUCZ3HV6Q24/graph.json","fetch_events":"https://pith.science/api/pith-number/ZAIXIK4E33MVGI5HUCZ3HV6Q24/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZAIXIK4E33MVGI5HUCZ3HV6Q24/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZAIXIK4E33MVGI5HUCZ3HV6Q24/action/storage_attestation","attest_author":"https://pith.science/pith/ZAIXIK4E33MVGI5HUCZ3HV6Q24/action/author_attestation","sign_citation":"https://pith.science/pith/ZAIXIK4E33MVGI5HUCZ3HV6Q24/action/citation_signature","submit_replication":"https://pith.science/pith/ZAIXIK4E33MVGI5HUCZ3HV6Q24/action/replication_record"}},"created_at":"2026-05-18T00:53:45.900989+00:00","updated_at":"2026-05-18T00:53:45.900989+00:00"}