{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:M6TYLWLXDCQDYMFZW3KLDWY6Y4","short_pith_number":"pith:M6TYLWLX","schema_version":"1.0","canonical_sha256":"67a785d97718a03c30b9b6d4b1db1ec7091fb9ff537cd4e88bb538e592077320","source":{"kind":"arxiv","id":"2602.09428","version":2},"attestation_state":"computed","paper":{"title":"Near-optimal entanglement-communication tradeoffs for remote state preparation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Olivier Lalonde, Srijita Kundu","submitted_at":"2026-02-10T05:46:41Z","abstract_excerpt":"We study the following task: Alice is given a classical description of a rank-$k$ projector $P$ on $\\mathbb{C}^d$, and Alice and Bob want to prepare the quantum state $P/k$ on Bob's side using shared entanglement and classical communication. The general form of this task is known as remote state preparation (RSP). We give nearly-matching lower and upper bounds for the entanglement cost and communication cost for RSP of the states $P/k$. Ours are the first nearly matching upper and lower bounds for RSP of mixed states, and in the special case of pure states, our lower bound outperforms the best"},"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":"2602.09428","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-02-10T05:46:41Z","cross_cats_sorted":[],"title_canon_sha256":"e66dd76f9bff685f6509380fd11807f49e26cb01c80cf5ac187d4483a4a727c2","abstract_canon_sha256":"5637500cda0b97cffbeac4da8e73efa8c5def4faa096e99d41eb855f43e8bade"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:04:24.869989Z","signature_b64":"p8lKEWOuWKO9GRZ7qhZaQFs4w/sbCzg8QOcFDyQkW/szhSv+gigLmyqZdwYDZWVIGr2py5TFA+/Rft7zmwj/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67a785d97718a03c30b9b6d4b1db1ec7091fb9ff537cd4e88bb538e592077320","last_reissued_at":"2026-05-20T00:04:24.868854Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:04:24.868854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-optimal entanglement-communication tradeoffs for remote state preparation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Olivier Lalonde, Srijita Kundu","submitted_at":"2026-02-10T05:46:41Z","abstract_excerpt":"We study the following task: Alice is given a classical description of a rank-$k$ projector $P$ on $\\mathbb{C}^d$, and Alice and Bob want to prepare the quantum state $P/k$ on Bob's side using shared entanglement and classical communication. The general form of this task is known as remote state preparation (RSP). We give nearly-matching lower and upper bounds for the entanglement cost and communication cost for RSP of the states $P/k$. Ours are the first nearly matching upper and lower bounds for RSP of mixed states, and in the special case of pure states, our lower bound outperforms the best"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.09428","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/2602.09428/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":"2602.09428","created_at":"2026-05-20T00:04:24.869155+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.09428v2","created_at":"2026-05-20T00:04:24.869155+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.09428","created_at":"2026-05-20T00:04:24.869155+00:00"},{"alias_kind":"pith_short_12","alias_value":"M6TYLWLXDCQD","created_at":"2026-05-20T00:04:24.869155+00:00"},{"alias_kind":"pith_short_16","alias_value":"M6TYLWLXDCQDYMFZ","created_at":"2026-05-20T00:04:24.869155+00:00"},{"alias_kind":"pith_short_8","alias_value":"M6TYLWLX","created_at":"2026-05-20T00:04:24.869155+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/M6TYLWLXDCQDYMFZW3KLDWY6Y4","json":"https://pith.science/pith/M6TYLWLXDCQDYMFZW3KLDWY6Y4.json","graph_json":"https://pith.science/api/pith-number/M6TYLWLXDCQDYMFZW3KLDWY6Y4/graph.json","events_json":"https://pith.science/api/pith-number/M6TYLWLXDCQDYMFZW3KLDWY6Y4/events.json","paper":"https://pith.science/paper/M6TYLWLX"},"agent_actions":{"view_html":"https://pith.science/pith/M6TYLWLXDCQDYMFZW3KLDWY6Y4","download_json":"https://pith.science/pith/M6TYLWLXDCQDYMFZW3KLDWY6Y4.json","view_paper":"https://pith.science/paper/M6TYLWLX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.09428&json=true","fetch_graph":"https://pith.science/api/pith-number/M6TYLWLXDCQDYMFZW3KLDWY6Y4/graph.json","fetch_events":"https://pith.science/api/pith-number/M6TYLWLXDCQDYMFZW3KLDWY6Y4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M6TYLWLXDCQDYMFZW3KLDWY6Y4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M6TYLWLXDCQDYMFZW3KLDWY6Y4/action/storage_attestation","attest_author":"https://pith.science/pith/M6TYLWLXDCQDYMFZW3KLDWY6Y4/action/author_attestation","sign_citation":"https://pith.science/pith/M6TYLWLXDCQDYMFZW3KLDWY6Y4/action/citation_signature","submit_replication":"https://pith.science/pith/M6TYLWLXDCQDYMFZW3KLDWY6Y4/action/replication_record"}},"created_at":"2026-05-20T00:04:24.869155+00:00","updated_at":"2026-05-20T00:04:24.869155+00:00"}