{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:VKL5O5CJAVHXKFZ2HDS37RBPKO","short_pith_number":"pith:VKL5O5CJ","schema_version":"1.0","canonical_sha256":"aa97d77449054f75173a38e5bfc42f53a4fb4a76829f6c25d9c43cb701121ffd","source":{"kind":"arxiv","id":"quant-ph/0605086","version":2},"attestation_state":"computed","paper":{"title":"Communicating over adversarial quantum channels using quantum list codes","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Debbie Leung, Graeme Smith","submitted_at":"2006-05-09T21:05:55Z","abstract_excerpt":"We study quantum communication in the presence of adversarial noise. In this setting, communicating with perfect fidelity requires using a quantum code of bounded minimum distance, for which the best known rates are given by the quantum Gilbert-Varshamov (QGV) bound. By asking only for arbitrarily high fidelity and allowing the sender and reciever to use a secret key with length logarithmic in the number of qubits sent, we achieve a dramatic improvement over the QGV rates. In fact, we find protocols that achieve arbitrarily high fidelity at noise levels for which perfect fidelity is impossible"},"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":"quant-ph/0605086","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2006-05-09T21:05:55Z","cross_cats_sorted":[],"title_canon_sha256":"0e0b2d6a187b536a54be65c685d2fad0d6890cab21fd261bbd3f376f870f428f","abstract_canon_sha256":"d3548962702a0cf43010719a1776491eea64142fda362655d9e08b97cdb7a56c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:07:04.993220Z","signature_b64":"SkADf3Q0dkGLJg8PxYuPn7XWno532EgjDJULfErztl93ReERMaVFtGGG7wVTzXFrBj5/NGD4UTdSOMTofWpoBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa97d77449054f75173a38e5bfc42f53a4fb4a76829f6c25d9c43cb701121ffd","last_reissued_at":"2026-07-04T15:07:04.992808Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:07:04.992808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communicating over adversarial quantum channels using quantum list codes","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Debbie Leung, Graeme Smith","submitted_at":"2006-05-09T21:05:55Z","abstract_excerpt":"We study quantum communication in the presence of adversarial noise. In this setting, communicating with perfect fidelity requires using a quantum code of bounded minimum distance, for which the best known rates are given by the quantum Gilbert-Varshamov (QGV) bound. By asking only for arbitrarily high fidelity and allowing the sender and reciever to use a secret key with length logarithmic in the number of qubits sent, we achieve a dramatic improvement over the QGV rates. In fact, we find protocols that achieve arbitrarily high fidelity at noise levels for which perfect fidelity is impossible"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0605086","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/quant-ph/0605086/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":"quant-ph/0605086","created_at":"2026-07-04T15:07:04.992872+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0605086v2","created_at":"2026-07-04T15:07:04.992872+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0605086","created_at":"2026-07-04T15:07:04.992872+00:00"},{"alias_kind":"pith_short_12","alias_value":"VKL5O5CJAVHX","created_at":"2026-07-04T15:07:04.992872+00:00"},{"alias_kind":"pith_short_16","alias_value":"VKL5O5CJAVHXKFZ2","created_at":"2026-07-04T15:07:04.992872+00:00"},{"alias_kind":"pith_short_8","alias_value":"VKL5O5CJ","created_at":"2026-07-04T15:07:04.992872+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/VKL5O5CJAVHXKFZ2HDS37RBPKO","json":"https://pith.science/pith/VKL5O5CJAVHXKFZ2HDS37RBPKO.json","graph_json":"https://pith.science/api/pith-number/VKL5O5CJAVHXKFZ2HDS37RBPKO/graph.json","events_json":"https://pith.science/api/pith-number/VKL5O5CJAVHXKFZ2HDS37RBPKO/events.json","paper":"https://pith.science/paper/VKL5O5CJ"},"agent_actions":{"view_html":"https://pith.science/pith/VKL5O5CJAVHXKFZ2HDS37RBPKO","download_json":"https://pith.science/pith/VKL5O5CJAVHXKFZ2HDS37RBPKO.json","view_paper":"https://pith.science/paper/VKL5O5CJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0605086&json=true","fetch_graph":"https://pith.science/api/pith-number/VKL5O5CJAVHXKFZ2HDS37RBPKO/graph.json","fetch_events":"https://pith.science/api/pith-number/VKL5O5CJAVHXKFZ2HDS37RBPKO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VKL5O5CJAVHXKFZ2HDS37RBPKO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VKL5O5CJAVHXKFZ2HDS37RBPKO/action/storage_attestation","attest_author":"https://pith.science/pith/VKL5O5CJAVHXKFZ2HDS37RBPKO/action/author_attestation","sign_citation":"https://pith.science/pith/VKL5O5CJAVHXKFZ2HDS37RBPKO/action/citation_signature","submit_replication":"https://pith.science/pith/VKL5O5CJAVHXKFZ2HDS37RBPKO/action/replication_record"}},"created_at":"2026-07-04T15:07:04.992872+00:00","updated_at":"2026-07-04T15:07:04.992872+00:00"}