{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:5TYS26FJ5KAIAFWM7SRBTPFR37","short_pith_number":"pith:5TYS26FJ","schema_version":"1.0","canonical_sha256":"ecf12d78a9ea808016ccfca219bcb1dfcf5dab5d7af4a139820a139ceb45227d","source":{"kind":"arxiv","id":"1111.0475","version":2},"attestation_state":"computed","paper":{"title":"On exact quantum query complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ashley Montanaro, Graeme Mitchison, Richard Jozsa","submitted_at":"2011-11-02T12:20:16Z","abstract_excerpt":"We present several families of total boolean functions which have exact quantum query complexity which is a constant multiple (between 1/2 and 2/3) of their classical query complexity, and show that optimal quantum algorithms for these functions cannot be obtained by simply computing parities of pairs of bits. We also characterise the model of nonadaptive exact quantum query complexity in terms of coding theory and completely characterise the query complexity of symmetric boolean functions in this context. These results were originally inspired by numerically solving the semidefinite programs "},"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":"1111.0475","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-11-02T12:20:16Z","cross_cats_sorted":[],"title_canon_sha256":"4dac5cd53fae8d694f65f32802ef87d39b69512e7fc5bdff5562206ccfc84019","abstract_canon_sha256":"791c4b5bf8f1c9cf5f9f9870028331236388583aba616a27db7315fb5dddd0c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:12.690956Z","signature_b64":"5TFLJZTDrHfonk/AsQnTsNqeyMfACBJPn+/nPYjRiiG3i9qQTGfQovKZPm1EXRBELLfi82HpdnWFhDXnaIAFAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecf12d78a9ea808016ccfca219bcb1dfcf5dab5d7af4a139820a139ceb45227d","last_reissued_at":"2026-05-18T01:20:12.690310Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:12.690310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On exact quantum query complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ashley Montanaro, Graeme Mitchison, Richard Jozsa","submitted_at":"2011-11-02T12:20:16Z","abstract_excerpt":"We present several families of total boolean functions which have exact quantum query complexity which is a constant multiple (between 1/2 and 2/3) of their classical query complexity, and show that optimal quantum algorithms for these functions cannot be obtained by simply computing parities of pairs of bits. We also characterise the model of nonadaptive exact quantum query complexity in terms of coding theory and completely characterise the query complexity of symmetric boolean functions in this context. These results were originally inspired by numerically solving the semidefinite programs "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0475","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":""},"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":"1111.0475","created_at":"2026-05-18T01:20:12.690426+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.0475v2","created_at":"2026-05-18T01:20:12.690426+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0475","created_at":"2026-05-18T01:20:12.690426+00:00"},{"alias_kind":"pith_short_12","alias_value":"5TYS26FJ5KAI","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"5TYS26FJ5KAIAFWM","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"5TYS26FJ","created_at":"2026-05-18T12:26:20.644004+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.05187","citing_title":"Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order","ref_index":38,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5TYS26FJ5KAIAFWM7SRBTPFR37","json":"https://pith.science/pith/5TYS26FJ5KAIAFWM7SRBTPFR37.json","graph_json":"https://pith.science/api/pith-number/5TYS26FJ5KAIAFWM7SRBTPFR37/graph.json","events_json":"https://pith.science/api/pith-number/5TYS26FJ5KAIAFWM7SRBTPFR37/events.json","paper":"https://pith.science/paper/5TYS26FJ"},"agent_actions":{"view_html":"https://pith.science/pith/5TYS26FJ5KAIAFWM7SRBTPFR37","download_json":"https://pith.science/pith/5TYS26FJ5KAIAFWM7SRBTPFR37.json","view_paper":"https://pith.science/paper/5TYS26FJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.0475&json=true","fetch_graph":"https://pith.science/api/pith-number/5TYS26FJ5KAIAFWM7SRBTPFR37/graph.json","fetch_events":"https://pith.science/api/pith-number/5TYS26FJ5KAIAFWM7SRBTPFR37/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5TYS26FJ5KAIAFWM7SRBTPFR37/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5TYS26FJ5KAIAFWM7SRBTPFR37/action/storage_attestation","attest_author":"https://pith.science/pith/5TYS26FJ5KAIAFWM7SRBTPFR37/action/author_attestation","sign_citation":"https://pith.science/pith/5TYS26FJ5KAIAFWM7SRBTPFR37/action/citation_signature","submit_replication":"https://pith.science/pith/5TYS26FJ5KAIAFWM7SRBTPFR37/action/replication_record"}},"created_at":"2026-05-18T01:20:12.690426+00:00","updated_at":"2026-05-18T01:20:12.690426+00:00"}