{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:6B4PXMB6OB2DNR6TN5S2E3MNXD","short_pith_number":"pith:6B4PXMB6","schema_version":"1.0","canonical_sha256":"f078fbb03e707436c7d36f65a26d8db8c9f9bf16ddf228a7a8a861875ed7c2da","source":{"kind":"arxiv","id":"2503.13207","version":1},"attestation_state":"computed","paper":{"title":"Non-asymptotic quantum communication on lossy transmission lines with memory","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Francesco Anna Mele, Giovanni Barbarino, Marco Fanizza, Vittorio Giovannetti","submitted_at":"2025-03-17T14:19:41Z","abstract_excerpt":"Non-asymptotic quantum Shannon theory analyses how to transmit quantum information across a quantum channel as efficiently as possible within a specified error tolerance, given access to a finite, fixed, number of channel uses. In a recent work, we derived computable lower bounds on the non-asymptotic capacities of memoryless bosonic Gaussian channels. In this work, we extend these results to the non-Markovian bosonic Gaussian channel introduced in F. A. Mele, G. D. Palma, M. Fanizza, V. Giovannetti, and L. Lami IEEE Transactions on Information Theory 70(12), 8844-8869 (2024), which describes "},"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":"2503.13207","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-03-17T14:19:41Z","cross_cats_sorted":[],"title_canon_sha256":"44aa7f322f346f5325a75369c4111f86ef1a17f543defa00827e233dea2d6627","abstract_canon_sha256":"ab41a9a41c3e4c7e80cfc7b41d84971c753e06518506516615b7accc1dca9d70"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:32:55.939123Z","signature_b64":"ZFY5uR0e2RSgioYPuW08LxDBKSHANm8fd2mrRYuygJlvMFCMFIeUL8hh8aze1h0aQOZoaYDhi/1Y9/4ppsGyDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f078fbb03e707436c7d36f65a26d8db8c9f9bf16ddf228a7a8a861875ed7c2da","last_reissued_at":"2026-07-05T10:32:55.937976Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:32:55.937976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-asymptotic quantum communication on lossy transmission lines with memory","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Francesco Anna Mele, Giovanni Barbarino, Marco Fanizza, Vittorio Giovannetti","submitted_at":"2025-03-17T14:19:41Z","abstract_excerpt":"Non-asymptotic quantum Shannon theory analyses how to transmit quantum information across a quantum channel as efficiently as possible within a specified error tolerance, given access to a finite, fixed, number of channel uses. In a recent work, we derived computable lower bounds on the non-asymptotic capacities of memoryless bosonic Gaussian channels. In this work, we extend these results to the non-Markovian bosonic Gaussian channel introduced in F. A. Mele, G. D. Palma, M. Fanizza, V. Giovannetti, and L. Lami IEEE Transactions on Information Theory 70(12), 8844-8869 (2024), which describes "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.13207","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/2503.13207/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":"2503.13207","created_at":"2026-07-05T10:32:55.938110+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.13207v1","created_at":"2026-07-05T10:32:55.938110+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.13207","created_at":"2026-07-05T10:32:55.938110+00:00"},{"alias_kind":"pith_short_12","alias_value":"6B4PXMB6OB2D","created_at":"2026-07-05T10:32:55.938110+00:00"},{"alias_kind":"pith_short_16","alias_value":"6B4PXMB6OB2DNR6T","created_at":"2026-07-05T10:32:55.938110+00:00"},{"alias_kind":"pith_short_8","alias_value":"6B4PXMB6","created_at":"2026-07-05T10:32:55.938110+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/6B4PXMB6OB2DNR6TN5S2E3MNXD","json":"https://pith.science/pith/6B4PXMB6OB2DNR6TN5S2E3MNXD.json","graph_json":"https://pith.science/api/pith-number/6B4PXMB6OB2DNR6TN5S2E3MNXD/graph.json","events_json":"https://pith.science/api/pith-number/6B4PXMB6OB2DNR6TN5S2E3MNXD/events.json","paper":"https://pith.science/paper/6B4PXMB6"},"agent_actions":{"view_html":"https://pith.science/pith/6B4PXMB6OB2DNR6TN5S2E3MNXD","download_json":"https://pith.science/pith/6B4PXMB6OB2DNR6TN5S2E3MNXD.json","view_paper":"https://pith.science/paper/6B4PXMB6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.13207&json=true","fetch_graph":"https://pith.science/api/pith-number/6B4PXMB6OB2DNR6TN5S2E3MNXD/graph.json","fetch_events":"https://pith.science/api/pith-number/6B4PXMB6OB2DNR6TN5S2E3MNXD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6B4PXMB6OB2DNR6TN5S2E3MNXD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6B4PXMB6OB2DNR6TN5S2E3MNXD/action/storage_attestation","attest_author":"https://pith.science/pith/6B4PXMB6OB2DNR6TN5S2E3MNXD/action/author_attestation","sign_citation":"https://pith.science/pith/6B4PXMB6OB2DNR6TN5S2E3MNXD/action/citation_signature","submit_replication":"https://pith.science/pith/6B4PXMB6OB2DNR6TN5S2E3MNXD/action/replication_record"}},"created_at":"2026-07-05T10:32:55.938110+00:00","updated_at":"2026-07-05T10:32:55.938110+00:00"}