{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:XMYM63WKW5YZTFJCTBXG7CQ2CU","short_pith_number":"pith:XMYM63WK","schema_version":"1.0","canonical_sha256":"bb30cf6ecab771999522986e6f8a1a151881728ec82119f2b6c230a57c858707","source":{"kind":"arxiv","id":"2012.05233","version":2},"attestation_state":"computed","paper":{"title":"The Role of Symmetry in Quantum Query-to-Communication Simulation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Arkadev Chattopadhyay, Manaswi Paraashar, Nikhil S. Mande, Peter H{\\o}yer, Ronald de Wolf, Sourav Chakraborty","submitted_at":"2020-12-09T18:58:55Z","abstract_excerpt":"Buhrman, Cleve and Wigderson (STOC'98) showed that for every Boolean function f : {-1,1}^n to {-1,1} and G in {AND_2, XOR_2}, the bounded-error quantum communication complexity of the composed function f o G equals O(Q(f) log n), where Q(f) denotes the bounded-error quantum query complexity of f. This is achieved by Alice running the optimal quantum query algorithm for f, using a round of O(log n) qubits of communication to implement each query.\n  This is in contrast with the classical setting, where it is easy to show that R^{cc}(f o G) is at most 2R(f), where R^{cc} and R denote bounded-erro"},"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":"2012.05233","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2020-12-09T18:58:55Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"9241c7c6e2d0629f4925a22ecb15b271abb0079c27dfcec20f3454b1f6a0fcdb","abstract_canon_sha256":"d3ca74e0843b6fc16c540a2ba4da89333b2cdabe337feb2a7d5a761982c5c58c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:04:31.815691Z","signature_b64":"N/KYQJsUTD5rXkq77fzwjim3ZC6kk7jFNonFwGBp6T11Md4Mfawan0AGYkw76DpkVhrsXfhVoTdu8vPF1wGpDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb30cf6ecab771999522986e6f8a1a151881728ec82119f2b6c230a57c858707","last_reissued_at":"2026-07-05T06:04:31.815157Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:04:31.815157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Role of Symmetry in Quantum Query-to-Communication Simulation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Arkadev Chattopadhyay, Manaswi Paraashar, Nikhil S. Mande, Peter H{\\o}yer, Ronald de Wolf, Sourav Chakraborty","submitted_at":"2020-12-09T18:58:55Z","abstract_excerpt":"Buhrman, Cleve and Wigderson (STOC'98) showed that for every Boolean function f : {-1,1}^n to {-1,1} and G in {AND_2, XOR_2}, the bounded-error quantum communication complexity of the composed function f o G equals O(Q(f) log n), where Q(f) denotes the bounded-error quantum query complexity of f. This is achieved by Alice running the optimal quantum query algorithm for f, using a round of O(log n) qubits of communication to implement each query.\n  This is in contrast with the classical setting, where it is easy to show that R^{cc}(f o G) is at most 2R(f), where R^{cc} and R denote bounded-erro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.05233","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2012.05233/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2012.05233","created_at":"2026-07-05T06:04:31.815213+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.05233v2","created_at":"2026-07-05T06:04:31.815213+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.05233","created_at":"2026-07-05T06:04:31.815213+00:00"},{"alias_kind":"pith_short_12","alias_value":"XMYM63WKW5YZ","created_at":"2026-07-05T06:04:31.815213+00:00"},{"alias_kind":"pith_short_16","alias_value":"XMYM63WKW5YZTFJC","created_at":"2026-07-05T06:04:31.815213+00:00"},{"alias_kind":"pith_short_8","alias_value":"XMYM63WK","created_at":"2026-07-05T06:04:31.815213+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/XMYM63WKW5YZTFJCTBXG7CQ2CU","json":"https://pith.science/pith/XMYM63WKW5YZTFJCTBXG7CQ2CU.json","graph_json":"https://pith.science/api/pith-number/XMYM63WKW5YZTFJCTBXG7CQ2CU/graph.json","events_json":"https://pith.science/api/pith-number/XMYM63WKW5YZTFJCTBXG7CQ2CU/events.json","paper":"https://pith.science/paper/XMYM63WK"},"agent_actions":{"view_html":"https://pith.science/pith/XMYM63WKW5YZTFJCTBXG7CQ2CU","download_json":"https://pith.science/pith/XMYM63WKW5YZTFJCTBXG7CQ2CU.json","view_paper":"https://pith.science/paper/XMYM63WK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.05233&json=true","fetch_graph":"https://pith.science/api/pith-number/XMYM63WKW5YZTFJCTBXG7CQ2CU/graph.json","fetch_events":"https://pith.science/api/pith-number/XMYM63WKW5YZTFJCTBXG7CQ2CU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XMYM63WKW5YZTFJCTBXG7CQ2CU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XMYM63WKW5YZTFJCTBXG7CQ2CU/action/storage_attestation","attest_author":"https://pith.science/pith/XMYM63WKW5YZTFJCTBXG7CQ2CU/action/author_attestation","sign_citation":"https://pith.science/pith/XMYM63WKW5YZTFJCTBXG7CQ2CU/action/citation_signature","submit_replication":"https://pith.science/pith/XMYM63WKW5YZTFJCTBXG7CQ2CU/action/replication_record"}},"created_at":"2026-07-05T06:04:31.815213+00:00","updated_at":"2026-07-05T06:04:31.815213+00:00"}