{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:T7YCJUXQF6ESZV47JL2BM32SIC","short_pith_number":"pith:T7YCJUXQ","schema_version":"1.0","canonical_sha256":"9ff024d2f02f892cd79f4af4166f5240b86778c12a20ec3778860f0a953f740d","source":{"kind":"arxiv","id":"0904.2759","version":1},"attestation_state":"computed","paper":{"title":"Span programs and quantum query complexity: The general adversary bound is nearly tight for every boolean function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Ben W. Reichardt","submitted_at":"2009-04-17T18:41:43Z","abstract_excerpt":"The general adversary bound is a semi-definite program (SDP) that lower-bounds the quantum query complexity of a function. We turn this lower bound into an upper bound, by giving a quantum walk algorithm based on the dual SDP that has query complexity at most the general adversary bound, up to a logarithmic factor.\n  In more detail, the proof has two steps, each based on \"span programs,\" a certain linear-algebraic model of computation. First, we give an SDP that outputs for any boolean function a span program computing it that has optimal \"witness size.\" The optimal witness size is shown to co"},"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":"0904.2759","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-04-17T18:41:43Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"69b73661bb4c4b51e89de9f557310df2906a67043ed37453883b5431f4153159","abstract_canon_sha256":"2f66b559745645873437fdfb1343de884da4d7056a9f978dd192bc7478120bc8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:20.233600Z","signature_b64":"JebrLN0UC0tttk3AKCJa1p+ODuBU86icBRAvoBq/Ev2SsXo9ZsDkWlc1UIfVepR0iZW15+jsVm7rHwA9arzNDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ff024d2f02f892cd79f4af4166f5240b86778c12a20ec3778860f0a953f740d","last_reissued_at":"2026-05-18T00:58:20.232889Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:20.232889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Span programs and quantum query complexity: The general adversary bound is nearly tight for every boolean function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Ben W. Reichardt","submitted_at":"2009-04-17T18:41:43Z","abstract_excerpt":"The general adversary bound is a semi-definite program (SDP) that lower-bounds the quantum query complexity of a function. We turn this lower bound into an upper bound, by giving a quantum walk algorithm based on the dual SDP that has query complexity at most the general adversary bound, up to a logarithmic factor.\n  In more detail, the proof has two steps, each based on \"span programs,\" a certain linear-algebraic model of computation. First, we give an SDP that outputs for any boolean function a span program computing it that has optimal \"witness size.\" The optimal witness size is shown to co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.2759","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":"0904.2759","created_at":"2026-05-18T00:58:20.232996+00:00"},{"alias_kind":"arxiv_version","alias_value":"0904.2759v1","created_at":"2026-05-18T00:58:20.232996+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.2759","created_at":"2026-05-18T00:58:20.232996+00:00"},{"alias_kind":"pith_short_12","alias_value":"T7YCJUXQF6ES","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"T7YCJUXQF6ESZV47","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"T7YCJUXQ","created_at":"2026-05-18T12:26:01.383474+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.04232","citing_title":"Span Programs and Quantum Space Complexity","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T7YCJUXQF6ESZV47JL2BM32SIC","json":"https://pith.science/pith/T7YCJUXQF6ESZV47JL2BM32SIC.json","graph_json":"https://pith.science/api/pith-number/T7YCJUXQF6ESZV47JL2BM32SIC/graph.json","events_json":"https://pith.science/api/pith-number/T7YCJUXQF6ESZV47JL2BM32SIC/events.json","paper":"https://pith.science/paper/T7YCJUXQ"},"agent_actions":{"view_html":"https://pith.science/pith/T7YCJUXQF6ESZV47JL2BM32SIC","download_json":"https://pith.science/pith/T7YCJUXQF6ESZV47JL2BM32SIC.json","view_paper":"https://pith.science/paper/T7YCJUXQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0904.2759&json=true","fetch_graph":"https://pith.science/api/pith-number/T7YCJUXQF6ESZV47JL2BM32SIC/graph.json","fetch_events":"https://pith.science/api/pith-number/T7YCJUXQF6ESZV47JL2BM32SIC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T7YCJUXQF6ESZV47JL2BM32SIC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T7YCJUXQF6ESZV47JL2BM32SIC/action/storage_attestation","attest_author":"https://pith.science/pith/T7YCJUXQF6ESZV47JL2BM32SIC/action/author_attestation","sign_citation":"https://pith.science/pith/T7YCJUXQF6ESZV47JL2BM32SIC/action/citation_signature","submit_replication":"https://pith.science/pith/T7YCJUXQF6ESZV47JL2BM32SIC/action/replication_record"}},"created_at":"2026-05-18T00:58:20.232996+00:00","updated_at":"2026-05-18T00:58:20.232996+00:00"}