{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:MAAG4RHTQ3PLEL7ZTF7QHMWNZQ","short_pith_number":"pith:MAAG4RHT","schema_version":"1.0","canonical_sha256":"60006e44f386deb22ff9997f03b2cdcc17e8d26e8836f00ca0ccefdea7c95198","source":{"kind":"arxiv","id":"2606.12700","version":1},"attestation_state":"computed","paper":{"title":"Measurement Geometry for Quantum Random Access Codes: Beyond Nayak Bound and Toward Optimality","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Kosei Teramoto, Rudy Raymond, Seiseki Akibue, Suguru Tamaki","submitted_at":"2026-06-10T21:41:58Z","abstract_excerpt":"Quantum random access codes (QRACs) ask how well N classical bits can be encoded into M qubits while allowing any single bit to be recovered. Although the Nayak bound remains the standard general upper bound on the decoding probability, numerical evidence suggests a stronger upper bound in the small-qubit regime.\n  In this work, we formulate the optimal decoding probability in terms of decoding measurements, reformulating QRAC design as a spectral problem for noncommuting measurements. Using this formulation, we give an elementary proof of the Nayak bound by simplifying the Chernoff-bound argu"},"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":"2606.12700","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-10T21:41:58Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"767b0b5e69d3972bd50602dd9e28c3b7d265db898c77dc74a35a0f40641dc614","abstract_canon_sha256":"ad0b3818b1a7a5c63fe576049b41fda22a7b69f9ca02a1a2c7c0cd0b03f88dff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:08:46.163496Z","signature_b64":"d8JguFTkjQo8xK5jcz3aD1mxG8cIr6ZzNo78njY5FdGiB3fixTSmai4yIvmVKtGnG+FCexpmeMBiIdo8aCarDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60006e44f386deb22ff9997f03b2cdcc17e8d26e8836f00ca0ccefdea7c95198","last_reissued_at":"2026-06-12T01:08:46.162586Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:08:46.162586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Measurement Geometry for Quantum Random Access Codes: Beyond Nayak Bound and Toward Optimality","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Kosei Teramoto, Rudy Raymond, Seiseki Akibue, Suguru Tamaki","submitted_at":"2026-06-10T21:41:58Z","abstract_excerpt":"Quantum random access codes (QRACs) ask how well N classical bits can be encoded into M qubits while allowing any single bit to be recovered. Although the Nayak bound remains the standard general upper bound on the decoding probability, numerical evidence suggests a stronger upper bound in the small-qubit regime.\n  In this work, we formulate the optimal decoding probability in terms of decoding measurements, reformulating QRAC design as a spectral problem for noncommuting measurements. Using this formulation, we give an elementary proof of the Nayak bound by simplifying the Chernoff-bound argu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.12700","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.12700/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":"2606.12700","created_at":"2026-06-12T01:08:46.162735+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.12700v1","created_at":"2026-06-12T01:08:46.162735+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.12700","created_at":"2026-06-12T01:08:46.162735+00:00"},{"alias_kind":"pith_short_12","alias_value":"MAAG4RHTQ3PL","created_at":"2026-06-12T01:08:46.162735+00:00"},{"alias_kind":"pith_short_16","alias_value":"MAAG4RHTQ3PLEL7Z","created_at":"2026-06-12T01:08:46.162735+00:00"},{"alias_kind":"pith_short_8","alias_value":"MAAG4RHT","created_at":"2026-06-12T01:08:46.162735+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/MAAG4RHTQ3PLEL7ZTF7QHMWNZQ","json":"https://pith.science/pith/MAAG4RHTQ3PLEL7ZTF7QHMWNZQ.json","graph_json":"https://pith.science/api/pith-number/MAAG4RHTQ3PLEL7ZTF7QHMWNZQ/graph.json","events_json":"https://pith.science/api/pith-number/MAAG4RHTQ3PLEL7ZTF7QHMWNZQ/events.json","paper":"https://pith.science/paper/MAAG4RHT"},"agent_actions":{"view_html":"https://pith.science/pith/MAAG4RHTQ3PLEL7ZTF7QHMWNZQ","download_json":"https://pith.science/pith/MAAG4RHTQ3PLEL7ZTF7QHMWNZQ.json","view_paper":"https://pith.science/paper/MAAG4RHT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.12700&json=true","fetch_graph":"https://pith.science/api/pith-number/MAAG4RHTQ3PLEL7ZTF7QHMWNZQ/graph.json","fetch_events":"https://pith.science/api/pith-number/MAAG4RHTQ3PLEL7ZTF7QHMWNZQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MAAG4RHTQ3PLEL7ZTF7QHMWNZQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MAAG4RHTQ3PLEL7ZTF7QHMWNZQ/action/storage_attestation","attest_author":"https://pith.science/pith/MAAG4RHTQ3PLEL7ZTF7QHMWNZQ/action/author_attestation","sign_citation":"https://pith.science/pith/MAAG4RHTQ3PLEL7ZTF7QHMWNZQ/action/citation_signature","submit_replication":"https://pith.science/pith/MAAG4RHTQ3PLEL7ZTF7QHMWNZQ/action/replication_record"}},"created_at":"2026-06-12T01:08:46.162735+00:00","updated_at":"2026-06-12T01:08:46.162735+00:00"}