{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:AIM3XAC5UE3QWVS4DK4U3FAEQO","short_pith_number":"pith:AIM3XAC5","schema_version":"1.0","canonical_sha256":"0219bb805da1370b565c1ab94d9404839853a022ee91c3530139ca97eb98b7fe","source":{"kind":"arxiv","id":"0705.3806","version":2},"attestation_state":"computed","paper":{"title":"A Hypercontractive Inequality for Matrix-Valued Functions with Applications to Quantum Computing and LDCs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Avraham Ben-Aroya, Oded Regev, Ronald de Wolf","submitted_at":"2007-05-25T19:23:30Z","abstract_excerpt":"The Bonami-Beckner hypercontractive inequality is a powerful tool in Fourier analysis of real-valued functions on the Boolean cube. In this paper we present a version of this inequality for matrix-valued functions on the Boolean cube. Its proof is based on a powerful inequality by Ball, Carlen, and Lieb. We also present a number of applications. First, we analyze maps that encode $n$ classical bits into $m$ qubits, in such a way that each set of $k$ bits can be recovered with some probability by an appropriate measurement on the quantum encoding; we show that if $m<0.7 n$, then the success pro"},"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":"0705.3806","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2007-05-25T19:23:30Z","cross_cats_sorted":[],"title_canon_sha256":"adaa4165a10db673b14b41a440cbe570dd06edfa5e728ae2c2ef25db41aa1dcb","abstract_canon_sha256":"9251e55f7c7cd49a0b5d780292b256e645fed0eab33823d6edf146e11a441a74"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:12.138435Z","signature_b64":"0h6kIJO0GeQaQfq+XV1UMKLCi6Vb0bKURA3RfLn4aH0X3cFULwklt1GW3vR4C8mGe7TP/Bkl25r1ghw7mIR/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0219bb805da1370b565c1ab94d9404839853a022ee91c3530139ca97eb98b7fe","last_reissued_at":"2026-05-18T00:59:12.137705Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:12.137705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Hypercontractive Inequality for Matrix-Valued Functions with Applications to Quantum Computing and LDCs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Avraham Ben-Aroya, Oded Regev, Ronald de Wolf","submitted_at":"2007-05-25T19:23:30Z","abstract_excerpt":"The Bonami-Beckner hypercontractive inequality is a powerful tool in Fourier analysis of real-valued functions on the Boolean cube. In this paper we present a version of this inequality for matrix-valued functions on the Boolean cube. Its proof is based on a powerful inequality by Ball, Carlen, and Lieb. We also present a number of applications. First, we analyze maps that encode $n$ classical bits into $m$ qubits, in such a way that each set of $k$ bits can be recovered with some probability by an appropriate measurement on the quantum encoding; we show that if $m<0.7 n$, then the success pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0705.3806","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":"0705.3806","created_at":"2026-05-18T00:59:12.137831+00:00"},{"alias_kind":"arxiv_version","alias_value":"0705.3806v2","created_at":"2026-05-18T00:59:12.137831+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0705.3806","created_at":"2026-05-18T00:59:12.137831+00:00"},{"alias_kind":"pith_short_12","alias_value":"AIM3XAC5UE3Q","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"AIM3XAC5UE3QWVS4","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"AIM3XAC5","created_at":"2026-05-18T12:25:55.427421+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.01903","citing_title":"Getting almost all the bits from a quantum random access code","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AIM3XAC5UE3QWVS4DK4U3FAEQO","json":"https://pith.science/pith/AIM3XAC5UE3QWVS4DK4U3FAEQO.json","graph_json":"https://pith.science/api/pith-number/AIM3XAC5UE3QWVS4DK4U3FAEQO/graph.json","events_json":"https://pith.science/api/pith-number/AIM3XAC5UE3QWVS4DK4U3FAEQO/events.json","paper":"https://pith.science/paper/AIM3XAC5"},"agent_actions":{"view_html":"https://pith.science/pith/AIM3XAC5UE3QWVS4DK4U3FAEQO","download_json":"https://pith.science/pith/AIM3XAC5UE3QWVS4DK4U3FAEQO.json","view_paper":"https://pith.science/paper/AIM3XAC5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0705.3806&json=true","fetch_graph":"https://pith.science/api/pith-number/AIM3XAC5UE3QWVS4DK4U3FAEQO/graph.json","fetch_events":"https://pith.science/api/pith-number/AIM3XAC5UE3QWVS4DK4U3FAEQO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AIM3XAC5UE3QWVS4DK4U3FAEQO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AIM3XAC5UE3QWVS4DK4U3FAEQO/action/storage_attestation","attest_author":"https://pith.science/pith/AIM3XAC5UE3QWVS4DK4U3FAEQO/action/author_attestation","sign_citation":"https://pith.science/pith/AIM3XAC5UE3QWVS4DK4U3FAEQO/action/citation_signature","submit_replication":"https://pith.science/pith/AIM3XAC5UE3QWVS4DK4U3FAEQO/action/replication_record"}},"created_at":"2026-05-18T00:59:12.137831+00:00","updated_at":"2026-05-18T00:59:12.137831+00:00"}