{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OUUOR5L4TNKBHC5KVRMNCGESBK","short_pith_number":"pith:OUUOR5L4","schema_version":"1.0","canonical_sha256":"7528e8f57c9b54138baaac58d118920a92f0b90dd6831e48cb02e69598119755","source":{"kind":"arxiv","id":"1801.07271","version":2},"attestation_state":"computed","paper":{"title":"Improved quantum capacity bounds of Gaussian loss channels and achievable rates with Gottesman-Kitaev-Preskill codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Kyungjoo Noh, Liang Jiang, Victor V. Albert","submitted_at":"2018-01-22T19:00:48Z","abstract_excerpt":"Gaussian loss channels are of particular importance since they model realistic optical communication channels. Except for special cases, quantum capacity of Gaussian loss channels is not yet known completely. In this paper, we provide improved upper bounds of Gaussian loss channel capacity, both in the energy-constrained and unconstrained scenarios. We briefly review the Gottesman-Kitaev-Preskill (GKP) codes and discuss their experimental implementation. We then prove, in the energy-unconstrained case, that the GKP codes achieve the quantum capacity of Gaussian loss channels up to at most a co"},"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":"1801.07271","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-01-22T19:00:48Z","cross_cats_sorted":[],"title_canon_sha256":"839c18cebe3b1f33a23d3f3750fd52d387550a862409668c36d44cc7bfe74a0a","abstract_canon_sha256":"a9fad156c69533b7c5ab028d8404e0b04596962cd1462fa8a66471f55fccd42c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:06.080447Z","signature_b64":"i22gQ73htlTPoRaTTUfu22jHU6gzyQVJXzaSam98laiVMBX36NM2m1lhXbJYPVaN05gn0QD8BwaW2W5MqsnhCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7528e8f57c9b54138baaac58d118920a92f0b90dd6831e48cb02e69598119755","last_reissued_at":"2026-05-17T23:51:06.080020Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:06.080020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved quantum capacity bounds of Gaussian loss channels and achievable rates with Gottesman-Kitaev-Preskill codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Kyungjoo Noh, Liang Jiang, Victor V. Albert","submitted_at":"2018-01-22T19:00:48Z","abstract_excerpt":"Gaussian loss channels are of particular importance since they model realistic optical communication channels. Except for special cases, quantum capacity of Gaussian loss channels is not yet known completely. In this paper, we provide improved upper bounds of Gaussian loss channel capacity, both in the energy-constrained and unconstrained scenarios. We briefly review the Gottesman-Kitaev-Preskill (GKP) codes and discuss their experimental implementation. We then prove, in the energy-unconstrained case, that the GKP codes achieve the quantum capacity of Gaussian loss channels up to at most a co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07271","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":"1801.07271","created_at":"2026-05-17T23:51:06.080080+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.07271v2","created_at":"2026-05-17T23:51:06.080080+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07271","created_at":"2026-05-17T23:51:06.080080+00:00"},{"alias_kind":"pith_short_12","alias_value":"OUUOR5L4TNKB","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OUUOR5L4TNKBHC5K","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OUUOR5L4","created_at":"2026-05-18T12:32:43.782077+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.12952","citing_title":"Optimized four-qubit quantum error correcting code for amplitude damping channel","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OUUOR5L4TNKBHC5KVRMNCGESBK","json":"https://pith.science/pith/OUUOR5L4TNKBHC5KVRMNCGESBK.json","graph_json":"https://pith.science/api/pith-number/OUUOR5L4TNKBHC5KVRMNCGESBK/graph.json","events_json":"https://pith.science/api/pith-number/OUUOR5L4TNKBHC5KVRMNCGESBK/events.json","paper":"https://pith.science/paper/OUUOR5L4"},"agent_actions":{"view_html":"https://pith.science/pith/OUUOR5L4TNKBHC5KVRMNCGESBK","download_json":"https://pith.science/pith/OUUOR5L4TNKBHC5KVRMNCGESBK.json","view_paper":"https://pith.science/paper/OUUOR5L4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.07271&json=true","fetch_graph":"https://pith.science/api/pith-number/OUUOR5L4TNKBHC5KVRMNCGESBK/graph.json","fetch_events":"https://pith.science/api/pith-number/OUUOR5L4TNKBHC5KVRMNCGESBK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OUUOR5L4TNKBHC5KVRMNCGESBK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OUUOR5L4TNKBHC5KVRMNCGESBK/action/storage_attestation","attest_author":"https://pith.science/pith/OUUOR5L4TNKBHC5KVRMNCGESBK/action/author_attestation","sign_citation":"https://pith.science/pith/OUUOR5L4TNKBHC5KVRMNCGESBK/action/citation_signature","submit_replication":"https://pith.science/pith/OUUOR5L4TNKBHC5KVRMNCGESBK/action/replication_record"}},"created_at":"2026-05-17T23:51:06.080080+00:00","updated_at":"2026-05-17T23:51:06.080080+00:00"}