{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BV34LAL3GWPIZ3CONOPGHOGLAE","short_pith_number":"pith:BV34LAL3","schema_version":"1.0","canonical_sha256":"0d77c5817b359e8cec4e6b9e63b8cb013a2bb3b42f1b6af324fd4bb7d4930af6","source":{"kind":"arxiv","id":"1703.07768","version":4},"attestation_state":"computed","paper":{"title":"Quantum Communication-Query Tradeoffs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"William M. Hoza","submitted_at":"2017-03-22T17:50:25Z","abstract_excerpt":"For any function $f: X \\times Y \\to Z$, we prove that $Q^{*\\text{cc}}(f) \\cdot Q^{\\text{OIP}}(f) \\cdot (\\log Q^{\\text{OIP}}(f) + \\log |Z|) \\geq \\Omega(\\log |X|)$. Here, $Q^{*\\text{cc}}(f)$ denotes the bounded-error communication complexity of $f$ using an entanglement-assisted two-way qubit channel, and $Q^{\\text{OIP}}(f)$ denotes the number of quantum queries needed to learn $x$ with high probability given oracle access to the function $f_x(y) \\stackrel{\\text{def}}{=} f(x, y)$. We show that this tradeoff is close to the best possible. We also give a generalization of this tradeoff for distrib"},"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":"1703.07768","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-03-22T17:50:25Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"b9a7376c316d2eabc1fa0dcc9cafdd2996fd98b356e7016f039332504ee89803","abstract_canon_sha256":"f0b5cad64d16a9c8ac60775ab72051ef1d9d6b421de005ca1f9376138a7b2c24"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:55.314004Z","signature_b64":"DV2osOjusauar3YbyAVLNjLztXXLko9oluhBM1xGf5Ir2MuhuxSxD1DGze4GDo1xMgKLECa9UmrydiVyA+mPCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d77c5817b359e8cec4e6b9e63b8cb013a2bb3b42f1b6af324fd4bb7d4930af6","last_reissued_at":"2026-05-18T00:35:55.313628Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:55.313628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Communication-Query Tradeoffs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"William M. Hoza","submitted_at":"2017-03-22T17:50:25Z","abstract_excerpt":"For any function $f: X \\times Y \\to Z$, we prove that $Q^{*\\text{cc}}(f) \\cdot Q^{\\text{OIP}}(f) \\cdot (\\log Q^{\\text{OIP}}(f) + \\log |Z|) \\geq \\Omega(\\log |X|)$. Here, $Q^{*\\text{cc}}(f)$ denotes the bounded-error communication complexity of $f$ using an entanglement-assisted two-way qubit channel, and $Q^{\\text{OIP}}(f)$ denotes the number of quantum queries needed to learn $x$ with high probability given oracle access to the function $f_x(y) \\stackrel{\\text{def}}{=} f(x, y)$. We show that this tradeoff is close to the best possible. We also give a generalization of this tradeoff for distrib"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07768","kind":"arxiv","version":4},"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":"1703.07768","created_at":"2026-05-18T00:35:55.313679+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.07768v4","created_at":"2026-05-18T00:35:55.313679+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07768","created_at":"2026-05-18T00:35:55.313679+00:00"},{"alias_kind":"pith_short_12","alias_value":"BV34LAL3GWPI","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BV34LAL3GWPIZ3CO","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BV34LAL3","created_at":"2026-05-18T12:31:08.081275+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/BV34LAL3GWPIZ3CONOPGHOGLAE","json":"https://pith.science/pith/BV34LAL3GWPIZ3CONOPGHOGLAE.json","graph_json":"https://pith.science/api/pith-number/BV34LAL3GWPIZ3CONOPGHOGLAE/graph.json","events_json":"https://pith.science/api/pith-number/BV34LAL3GWPIZ3CONOPGHOGLAE/events.json","paper":"https://pith.science/paper/BV34LAL3"},"agent_actions":{"view_html":"https://pith.science/pith/BV34LAL3GWPIZ3CONOPGHOGLAE","download_json":"https://pith.science/pith/BV34LAL3GWPIZ3CONOPGHOGLAE.json","view_paper":"https://pith.science/paper/BV34LAL3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.07768&json=true","fetch_graph":"https://pith.science/api/pith-number/BV34LAL3GWPIZ3CONOPGHOGLAE/graph.json","fetch_events":"https://pith.science/api/pith-number/BV34LAL3GWPIZ3CONOPGHOGLAE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BV34LAL3GWPIZ3CONOPGHOGLAE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BV34LAL3GWPIZ3CONOPGHOGLAE/action/storage_attestation","attest_author":"https://pith.science/pith/BV34LAL3GWPIZ3CONOPGHOGLAE/action/author_attestation","sign_citation":"https://pith.science/pith/BV34LAL3GWPIZ3CONOPGHOGLAE/action/citation_signature","submit_replication":"https://pith.science/pith/BV34LAL3GWPIZ3CONOPGHOGLAE/action/replication_record"}},"created_at":"2026-05-18T00:35:55.313679+00:00","updated_at":"2026-05-18T00:35:55.313679+00:00"}