{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2003:SPYMR262TVSQMMAKM3SGIBEPTA","short_pith_number":"pith:SPYMR262","schema_version":"1.0","canonical_sha256":"93f0c8ebda9d6506300a66e464048f980979ea128865a6bebf41d27f9593967c","source":{"kind":"arxiv","id":"quant-ph/0311060","version":2},"attestation_state":"computed","paper":{"title":"On the power of Ambainis's lower bounds","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Shengyu Zhang","submitted_at":"2003-11-10T22:46:20Z","abstract_excerpt":"The polynomial method and the Ambainis's lower bound (or \\emph{Alb}, for short) method are two main quantum lower bound techniques. While recently Ambainis showed that the polynomial method is not tight, the present paper aims at studying the power and limitation of \\emph{Alb}'s. We first use known \\emph{Alb}'s to derive $\\Omega(n^{1.5})$ lower bounds for \\textsc{Bipartiteness}, \\textsc{Bipartiteness Matching} and \\textsc{Graph Matching}, in which the lower bound for \\textsc{Bipartiteness} improves the previous $\\Omega(n)$ one. We then show that all the three known Ambainis's lower bounds have"},"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/0311060","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2003-11-10T22:46:20Z","cross_cats_sorted":[],"title_canon_sha256":"37461a4863cb9271805f5877fddaee8bfb989ea4ac36fd42461b67800be5a0af","abstract_canon_sha256":"344906ff8e9315c32de1575fa630ecd04f1afc91a8767b92aa2f880fab084d93"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:46:27.098956Z","signature_b64":"BAU6GcHytpkwLcQ3UCdk0s0phypTouVTHEnTRnuBsu9/7Kbc7TO7ZwWT4AHsXv7w95QQACTDld0oApNbvqXqDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93f0c8ebda9d6506300a66e464048f980979ea128865a6bebf41d27f9593967c","last_reissued_at":"2026-07-04T14:46:27.098507Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:46:27.098507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the power of Ambainis's lower bounds","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Shengyu Zhang","submitted_at":"2003-11-10T22:46:20Z","abstract_excerpt":"The polynomial method and the Ambainis's lower bound (or \\emph{Alb}, for short) method are two main quantum lower bound techniques. While recently Ambainis showed that the polynomial method is not tight, the present paper aims at studying the power and limitation of \\emph{Alb}'s. We first use known \\emph{Alb}'s to derive $\\Omega(n^{1.5})$ lower bounds for \\textsc{Bipartiteness}, \\textsc{Bipartiteness Matching} and \\textsc{Graph Matching}, in which the lower bound for \\textsc{Bipartiteness} improves the previous $\\Omega(n)$ one. We then show that all the three known Ambainis's lower bounds have"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0311060","kind":"arxiv","version":2},"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/quant-ph/0311060/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":"quant-ph/0311060","created_at":"2026-07-04T14:46:27.098578+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0311060v2","created_at":"2026-07-04T14:46:27.098578+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0311060","created_at":"2026-07-04T14:46:27.098578+00:00"},{"alias_kind":"pith_short_12","alias_value":"SPYMR262TVSQ","created_at":"2026-07-04T14:46:27.098578+00:00"},{"alias_kind":"pith_short_16","alias_value":"SPYMR262TVSQMMAK","created_at":"2026-07-04T14:46:27.098578+00:00"},{"alias_kind":"pith_short_8","alias_value":"SPYMR262","created_at":"2026-07-04T14:46:27.098578+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.07876","citing_title":"The Compressed Oracle is a Worthy (Multiplicative) Adversary","ref_index":32,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SPYMR262TVSQMMAKM3SGIBEPTA","json":"https://pith.science/pith/SPYMR262TVSQMMAKM3SGIBEPTA.json","graph_json":"https://pith.science/api/pith-number/SPYMR262TVSQMMAKM3SGIBEPTA/graph.json","events_json":"https://pith.science/api/pith-number/SPYMR262TVSQMMAKM3SGIBEPTA/events.json","paper":"https://pith.science/paper/SPYMR262"},"agent_actions":{"view_html":"https://pith.science/pith/SPYMR262TVSQMMAKM3SGIBEPTA","download_json":"https://pith.science/pith/SPYMR262TVSQMMAKM3SGIBEPTA.json","view_paper":"https://pith.science/paper/SPYMR262","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0311060&json=true","fetch_graph":"https://pith.science/api/pith-number/SPYMR262TVSQMMAKM3SGIBEPTA/graph.json","fetch_events":"https://pith.science/api/pith-number/SPYMR262TVSQMMAKM3SGIBEPTA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SPYMR262TVSQMMAKM3SGIBEPTA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SPYMR262TVSQMMAKM3SGIBEPTA/action/storage_attestation","attest_author":"https://pith.science/pith/SPYMR262TVSQMMAKM3SGIBEPTA/action/author_attestation","sign_citation":"https://pith.science/pith/SPYMR262TVSQMMAKM3SGIBEPTA/action/citation_signature","submit_replication":"https://pith.science/pith/SPYMR262TVSQMMAKM3SGIBEPTA/action/replication_record"}},"created_at":"2026-07-04T14:46:27.098578+00:00","updated_at":"2026-07-04T14:46:27.098578+00:00"}