{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:7Q4IDMGK3ZGHTCVRPLJG4BFGBR","short_pith_number":"pith:7Q4IDMGK","schema_version":"1.0","canonical_sha256":"fc3881b0cade4c798ab17ad26e04a60c4e8a50dbddc555194d7dfe59e45ae2a8","source":{"kind":"arxiv","id":"1211.0721","version":6},"attestation_state":"computed","paper":{"title":"Superlinear advantage for exact quantum algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Andris Ambainis","submitted_at":"2012-11-04T21:20:38Z","abstract_excerpt":"A quantum algorithm is exact if, on any input data, it outputs the correct answer with certainty (probability 1). A key question is: how big is the advantage of exact quantum algorithms over their classical counterparts: deterministic algorithms. For total Boolean functions in the query model, the biggest known gap was just a factor of 2: PARITY of N inputs bits requires $N$ queries classically but can be computed with N/2 queries by an exact quantum algorithm.\n  We present the first example of a Boolean function f(x_1, ..., x_N) for which exact quantum algorithms have superlinear advantage ov"},"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":"1211.0721","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-11-04T21:20:38Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"22bb8540e9f53f3c9b7d029e98974c011c9813ed7262a77cc6b6dc39f4a1326f","abstract_canon_sha256":"572d9dd9134f8d05492ddc8302777e35bd55855dd8b511f9039df2bd9032316e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:01.169383Z","signature_b64":"6XLa3tP4Im1xlCXO+b7BBLJ5Rlkg/2B6yaf4ZS1li1AaDZE1UMYmyoMfLNxt/WrhOmaQPNdU4TKML3iRqWEbBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc3881b0cade4c798ab17ad26e04a60c4e8a50dbddc555194d7dfe59e45ae2a8","last_reissued_at":"2026-05-18T02:48:01.168873Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:01.168873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Superlinear advantage for exact quantum algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Andris Ambainis","submitted_at":"2012-11-04T21:20:38Z","abstract_excerpt":"A quantum algorithm is exact if, on any input data, it outputs the correct answer with certainty (probability 1). A key question is: how big is the advantage of exact quantum algorithms over their classical counterparts: deterministic algorithms. For total Boolean functions in the query model, the biggest known gap was just a factor of 2: PARITY of N inputs bits requires $N$ queries classically but can be computed with N/2 queries by an exact quantum algorithm.\n  We present the first example of a Boolean function f(x_1, ..., x_N) for which exact quantum algorithms have superlinear advantage ov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0721","kind":"arxiv","version":6},"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":"1211.0721","created_at":"2026-05-18T02:48:01.168963+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.0721v6","created_at":"2026-05-18T02:48:01.168963+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0721","created_at":"2026-05-18T02:48:01.168963+00:00"},{"alias_kind":"pith_short_12","alias_value":"7Q4IDMGK3ZGH","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"7Q4IDMGK3ZGHTCVR","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"7Q4IDMGK","created_at":"2026-05-18T12:26:58.693483+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/7Q4IDMGK3ZGHTCVRPLJG4BFGBR","json":"https://pith.science/pith/7Q4IDMGK3ZGHTCVRPLJG4BFGBR.json","graph_json":"https://pith.science/api/pith-number/7Q4IDMGK3ZGHTCVRPLJG4BFGBR/graph.json","events_json":"https://pith.science/api/pith-number/7Q4IDMGK3ZGHTCVRPLJG4BFGBR/events.json","paper":"https://pith.science/paper/7Q4IDMGK"},"agent_actions":{"view_html":"https://pith.science/pith/7Q4IDMGK3ZGHTCVRPLJG4BFGBR","download_json":"https://pith.science/pith/7Q4IDMGK3ZGHTCVRPLJG4BFGBR.json","view_paper":"https://pith.science/paper/7Q4IDMGK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.0721&json=true","fetch_graph":"https://pith.science/api/pith-number/7Q4IDMGK3ZGHTCVRPLJG4BFGBR/graph.json","fetch_events":"https://pith.science/api/pith-number/7Q4IDMGK3ZGHTCVRPLJG4BFGBR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7Q4IDMGK3ZGHTCVRPLJG4BFGBR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7Q4IDMGK3ZGHTCVRPLJG4BFGBR/action/storage_attestation","attest_author":"https://pith.science/pith/7Q4IDMGK3ZGHTCVRPLJG4BFGBR/action/author_attestation","sign_citation":"https://pith.science/pith/7Q4IDMGK3ZGHTCVRPLJG4BFGBR/action/citation_signature","submit_replication":"https://pith.science/pith/7Q4IDMGK3ZGHTCVRPLJG4BFGBR/action/replication_record"}},"created_at":"2026-05-18T02:48:01.168963+00:00","updated_at":"2026-05-18T02:48:01.168963+00:00"}