{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:6O6425HPB2GEBA6JNLUEYZQYVY","short_pith_number":"pith:6O6425HP","schema_version":"1.0","canonical_sha256":"f3bdcd74ef0e8c4083c96ae84c6618ae062607f28c4c47d4b8576262a4d0b3cc","source":{"kind":"arxiv","id":"quant-ph/0509153","version":1},"attestation_state":"computed","paper":{"title":"Lower Bounds on Quantum Query Complexity","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Peter Hoyer (U Calgary), Robert Spalek (CWI)","submitted_at":"2005-09-21T16:46:09Z","abstract_excerpt":"Shor's and Grover's famous quantum algorithms for factoring and searching show that quantum computers can solve certain computational problems significantly faster than any classical computer. We discuss here what quantum computers_cannot_ do, and specifically how to prove limits on their computational power. We cover the main known techniques for proving lower bounds, and exemplify and compare the methods."},"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/0509153","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-09-21T16:46:09Z","cross_cats_sorted":[],"title_canon_sha256":"68210b57936f032453e01f0bc14ca4546a30c725e47cecf73cd7a2ba3eb9f094","abstract_canon_sha256":"98d8b64826dc22c24a60baef88e2daa0fbfbfdea6d34a682fcf2f6dd9cf4536c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:53.840711Z","signature_b64":"hV/I+YaddgTcWZCyoDcwylSfimjUifGNkFtbxqgGFU102W3qZLOHqiPJQYlGT8ck7/8s9ET4BrzWXiod3n8kDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3bdcd74ef0e8c4083c96ae84c6618ae062607f28c4c47d4b8576262a4d0b3cc","last_reissued_at":"2026-05-18T01:59:53.840258Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:53.840258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds on Quantum Query Complexity","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Peter Hoyer (U Calgary), Robert Spalek (CWI)","submitted_at":"2005-09-21T16:46:09Z","abstract_excerpt":"Shor's and Grover's famous quantum algorithms for factoring and searching show that quantum computers can solve certain computational problems significantly faster than any classical computer. We discuss here what quantum computers_cannot_ do, and specifically how to prove limits on their computational power. We cover the main known techniques for proving lower bounds, and exemplify and compare the methods."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0509153","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/0509153","created_at":"2026-05-18T01:59:53.840324+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0509153v1","created_at":"2026-05-18T01:59:53.840324+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0509153","created_at":"2026-05-18T01:59:53.840324+00:00"},{"alias_kind":"pith_short_12","alias_value":"6O6425HPB2GE","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_16","alias_value":"6O6425HPB2GEBA6J","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_8","alias_value":"6O6425HP","created_at":"2026-05-18T12:25:53.335082+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6O6425HPB2GEBA6JNLUEYZQYVY","json":"https://pith.science/pith/6O6425HPB2GEBA6JNLUEYZQYVY.json","graph_json":"https://pith.science/api/pith-number/6O6425HPB2GEBA6JNLUEYZQYVY/graph.json","events_json":"https://pith.science/api/pith-number/6O6425HPB2GEBA6JNLUEYZQYVY/events.json","paper":"https://pith.science/paper/6O6425HP"},"agent_actions":{"view_html":"https://pith.science/pith/6O6425HPB2GEBA6JNLUEYZQYVY","download_json":"https://pith.science/pith/6O6425HPB2GEBA6JNLUEYZQYVY.json","view_paper":"https://pith.science/paper/6O6425HP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0509153&json=true","fetch_graph":"https://pith.science/api/pith-number/6O6425HPB2GEBA6JNLUEYZQYVY/graph.json","fetch_events":"https://pith.science/api/pith-number/6O6425HPB2GEBA6JNLUEYZQYVY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6O6425HPB2GEBA6JNLUEYZQYVY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6O6425HPB2GEBA6JNLUEYZQYVY/action/storage_attestation","attest_author":"https://pith.science/pith/6O6425HPB2GEBA6JNLUEYZQYVY/action/author_attestation","sign_citation":"https://pith.science/pith/6O6425HPB2GEBA6JNLUEYZQYVY/action/citation_signature","submit_replication":"https://pith.science/pith/6O6425HPB2GEBA6JNLUEYZQYVY/action/replication_record"}},"created_at":"2026-05-18T01:59:53.840324+00:00","updated_at":"2026-05-18T01:59:53.840324+00:00"}