{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:TBJT3DMNQHKPQXHOP4JHN4RKVT","short_pith_number":"pith:TBJT3DMN","schema_version":"1.0","canonical_sha256":"98533d8d8d81d4f85cee7f1276f22aacca42a1a7d14fee429942bb25a2ce6c02","source":{"kind":"arxiv","id":"0712.1446","version":1},"attestation_state":"computed","paper":{"title":"Unbounded Error Quantum Query Complexity","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ashley Montanaro, Harumichi Nishimura, Rudy Raymond","submitted_at":"2007-12-10T11:42:07Z","abstract_excerpt":"This work studies the quantum query complexity of Boolean functions in a scenario where it is only required that the query algorithm succeeds with a probability strictly greater than 1/2. We show that, just as in the communication complexity model, the unbounded error quantum query complexity is exactly half of its classical counterpart for any (partial or total) Boolean function. Moreover, we show that the \"black-box\" approach to convert quantum query algorithms into communication protocols by Buhrman-Cleve-Wigderson [STOC'98] is optimal even in the unbounded error setting.\n  We also study 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":"0712.1446","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2007-12-10T11:42:07Z","cross_cats_sorted":[],"title_canon_sha256":"0db7a167747e68dc31a5f98ab3366f676d84e5ba2a3c468fff6dd06cd92a4cb2","abstract_canon_sha256":"25cf8a0eb37d29a7c23132f04a2f569c289bf9ca396a11724849156209c4d065"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:09.782843Z","signature_b64":"vHxOyBS7EPILrFd4aPU4uTnBqk+N/ZmNYj9ImSwyfScUBVSgVSkFZHH9J84jT5jAUSbEFDeQUooZ/L+0PO8HCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98533d8d8d81d4f85cee7f1276f22aacca42a1a7d14fee429942bb25a2ce6c02","last_reissued_at":"2026-05-18T01:14:09.782130Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:09.782130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unbounded Error Quantum Query Complexity","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ashley Montanaro, Harumichi Nishimura, Rudy Raymond","submitted_at":"2007-12-10T11:42:07Z","abstract_excerpt":"This work studies the quantum query complexity of Boolean functions in a scenario where it is only required that the query algorithm succeeds with a probability strictly greater than 1/2. We show that, just as in the communication complexity model, the unbounded error quantum query complexity is exactly half of its classical counterpart for any (partial or total) Boolean function. Moreover, we show that the \"black-box\" approach to convert quantum query algorithms into communication protocols by Buhrman-Cleve-Wigderson [STOC'98] is optimal even in the unbounded error setting.\n  We also study a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0712.1446","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":"0712.1446","created_at":"2026-05-18T01:14:09.782236+00:00"},{"alias_kind":"arxiv_version","alias_value":"0712.1446v1","created_at":"2026-05-18T01:14:09.782236+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0712.1446","created_at":"2026-05-18T01:14:09.782236+00:00"},{"alias_kind":"pith_short_12","alias_value":"TBJT3DMNQHKP","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"TBJT3DMNQHKPQXHO","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"TBJT3DMN","created_at":"2026-05-18T12:25:56.245647+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/TBJT3DMNQHKPQXHOP4JHN4RKVT","json":"https://pith.science/pith/TBJT3DMNQHKPQXHOP4JHN4RKVT.json","graph_json":"https://pith.science/api/pith-number/TBJT3DMNQHKPQXHOP4JHN4RKVT/graph.json","events_json":"https://pith.science/api/pith-number/TBJT3DMNQHKPQXHOP4JHN4RKVT/events.json","paper":"https://pith.science/paper/TBJT3DMN"},"agent_actions":{"view_html":"https://pith.science/pith/TBJT3DMNQHKPQXHOP4JHN4RKVT","download_json":"https://pith.science/pith/TBJT3DMNQHKPQXHOP4JHN4RKVT.json","view_paper":"https://pith.science/paper/TBJT3DMN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0712.1446&json=true","fetch_graph":"https://pith.science/api/pith-number/TBJT3DMNQHKPQXHOP4JHN4RKVT/graph.json","fetch_events":"https://pith.science/api/pith-number/TBJT3DMNQHKPQXHOP4JHN4RKVT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TBJT3DMNQHKPQXHOP4JHN4RKVT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TBJT3DMNQHKPQXHOP4JHN4RKVT/action/storage_attestation","attest_author":"https://pith.science/pith/TBJT3DMNQHKPQXHOP4JHN4RKVT/action/author_attestation","sign_citation":"https://pith.science/pith/TBJT3DMNQHKPQXHOP4JHN4RKVT/action/citation_signature","submit_replication":"https://pith.science/pith/TBJT3DMNQHKPQXHOP4JHN4RKVT/action/replication_record"}},"created_at":"2026-05-18T01:14:09.782236+00:00","updated_at":"2026-05-18T01:14:09.782236+00:00"}