{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:W4DBQZ4FLJVXKO7CFGUL4AWV54","short_pith_number":"pith:W4DBQZ4F","schema_version":"1.0","canonical_sha256":"b7061867855a6b753be229a8be02d5ef344799304710f46008308b51f747f479","source":{"kind":"arxiv","id":"1112.0548","version":1},"attestation_state":"computed","paper":{"title":"The quantum query complexity of read-many formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Andrew M. Childs, Robin Kothari, Shelby Kimmel","submitted_at":"2011-12-02T19:56:16Z","abstract_excerpt":"The quantum query complexity of evaluating any read-once formula with n black-box input bits is Theta(sqrt(n)). However, the corresponding problem for read-many formulas (i.e., formulas in which the inputs have fanout) is not well understood. Although the optimal read-once formula evaluation algorithm can be applied to any formula, it can be suboptimal if the inputs have large fanout. We give an algorithm for evaluating any formula with n inputs, size S, and G gates using O(min{n, sqrt{S}, n^{1/2} G^{1/4}}) quantum queries. Furthermore, we show that this algorithm is optimal, since for any n,S"},"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":"1112.0548","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-12-02T19:56:16Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"16d71ec1d8083ae192a25dae8bfdbd64c19fd6142dcd25f08aba1a41b32d640e","abstract_canon_sha256":"4849cffaedfd6f12878930a236fa39cd3a1ed217550d9ab5ee9292d2e570a963"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:16.815806Z","signature_b64":"AC6KdhsaWcLQp7fhNQvMBrK3Dy2qcGQBObolR8TuNRD5zgJhye77bIEbHxQ6jMrlUlkxiuGJWGysIBZFDuqYAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7061867855a6b753be229a8be02d5ef344799304710f46008308b51f747f479","last_reissued_at":"2026-05-18T03:46:16.814911Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:16.814911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The quantum query complexity of read-many formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Andrew M. Childs, Robin Kothari, Shelby Kimmel","submitted_at":"2011-12-02T19:56:16Z","abstract_excerpt":"The quantum query complexity of evaluating any read-once formula with n black-box input bits is Theta(sqrt(n)). However, the corresponding problem for read-many formulas (i.e., formulas in which the inputs have fanout) is not well understood. Although the optimal read-once formula evaluation algorithm can be applied to any formula, it can be suboptimal if the inputs have large fanout. We give an algorithm for evaluating any formula with n inputs, size S, and G gates using O(min{n, sqrt{S}, n^{1/2} G^{1/4}}) quantum queries. Furthermore, we show that this algorithm is optimal, since for any n,S"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0548","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":"1112.0548","created_at":"2026-05-18T03:46:16.815055+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.0548v1","created_at":"2026-05-18T03:46:16.815055+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0548","created_at":"2026-05-18T03:46:16.815055+00:00"},{"alias_kind":"pith_short_12","alias_value":"W4DBQZ4FLJVX","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"W4DBQZ4FLJVXKO7C","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"W4DBQZ4F","created_at":"2026-05-18T12:26:44.992195+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/W4DBQZ4FLJVXKO7CFGUL4AWV54","json":"https://pith.science/pith/W4DBQZ4FLJVXKO7CFGUL4AWV54.json","graph_json":"https://pith.science/api/pith-number/W4DBQZ4FLJVXKO7CFGUL4AWV54/graph.json","events_json":"https://pith.science/api/pith-number/W4DBQZ4FLJVXKO7CFGUL4AWV54/events.json","paper":"https://pith.science/paper/W4DBQZ4F"},"agent_actions":{"view_html":"https://pith.science/pith/W4DBQZ4FLJVXKO7CFGUL4AWV54","download_json":"https://pith.science/pith/W4DBQZ4FLJVXKO7CFGUL4AWV54.json","view_paper":"https://pith.science/paper/W4DBQZ4F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.0548&json=true","fetch_graph":"https://pith.science/api/pith-number/W4DBQZ4FLJVXKO7CFGUL4AWV54/graph.json","fetch_events":"https://pith.science/api/pith-number/W4DBQZ4FLJVXKO7CFGUL4AWV54/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W4DBQZ4FLJVXKO7CFGUL4AWV54/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W4DBQZ4FLJVXKO7CFGUL4AWV54/action/storage_attestation","attest_author":"https://pith.science/pith/W4DBQZ4FLJVXKO7CFGUL4AWV54/action/author_attestation","sign_citation":"https://pith.science/pith/W4DBQZ4FLJVXKO7CFGUL4AWV54/action/citation_signature","submit_replication":"https://pith.science/pith/W4DBQZ4FLJVXKO7CFGUL4AWV54/action/replication_record"}},"created_at":"2026-05-18T03:46:16.815055+00:00","updated_at":"2026-05-18T03:46:16.815055+00:00"}