{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:S6SP3LS65NRFZE5Y6KV2B24LLS","short_pith_number":"pith:S6SP3LS6","schema_version":"1.0","canonical_sha256":"97a4fdae5eeb625c93b8f2aba0eb8b5ca11b0a8af81cd6b0bb7c6ac8cb08bf66","source":{"kind":"arxiv","id":"1101.2409","version":1},"attestation_state":"computed","paper":{"title":"Quantifying the Performance of Quantum Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"C. Cafaro, C. Lupo, S. L'Innocente, S. Mancini","submitted_at":"2011-01-12T17:21:36Z","abstract_excerpt":"We study the properties of error correcting codes for noise models in the presence of asymmetries and/or correlations by means of the entanglement fidelity and the code entropy. First, we consider a dephasing Markovian memory channel and characterize the performance of both a repetition code and an error avoiding code in terms of the entanglement fidelity. We also consider the concatenation of such codes and show that it is especially advantageous in the regime of partial correlations. Finally, we characterize the effectiveness of the codes and their concatenation by means of the code entropy "},"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":"1101.2409","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-01-12T17:21:36Z","cross_cats_sorted":[],"title_canon_sha256":"c6b71b573ec59b922b6ab209c9f988fd2fd47901315b13d51ffab944ddf2b9ee","abstract_canon_sha256":"a973490bdfbb39373509443198eeb16bfb3bf734d333062c2e24ad4e8126e4a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:58.177723Z","signature_b64":"LQq3FEaKJpvulZ25FsVJpqAOkCFA9vwMBqbt9H9OS9BQmgipb0XMB0UTN6eE+U8soxEeqVXbSDOR6SNDjyjoAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97a4fdae5eeb625c93b8f2aba0eb8b5ca11b0a8af81cd6b0bb7c6ac8cb08bf66","last_reissued_at":"2026-05-18T02:22:58.176961Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:58.176961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantifying the Performance of Quantum Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"C. Cafaro, C. Lupo, S. L'Innocente, S. Mancini","submitted_at":"2011-01-12T17:21:36Z","abstract_excerpt":"We study the properties of error correcting codes for noise models in the presence of asymmetries and/or correlations by means of the entanglement fidelity and the code entropy. First, we consider a dephasing Markovian memory channel and characterize the performance of both a repetition code and an error avoiding code in terms of the entanglement fidelity. We also consider the concatenation of such codes and show that it is especially advantageous in the regime of partial correlations. Finally, we characterize the effectiveness of the codes and their concatenation by means of the code entropy "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.2409","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":""},"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":"1101.2409","created_at":"2026-05-18T02:22:58.177083+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.2409v1","created_at":"2026-05-18T02:22:58.177083+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2409","created_at":"2026-05-18T02:22:58.177083+00:00"},{"alias_kind":"pith_short_12","alias_value":"S6SP3LS65NRF","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"S6SP3LS65NRFZE5Y","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"S6SP3LS6","created_at":"2026-05-18T12:26:41.206345+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/S6SP3LS65NRFZE5Y6KV2B24LLS","json":"https://pith.science/pith/S6SP3LS65NRFZE5Y6KV2B24LLS.json","graph_json":"https://pith.science/api/pith-number/S6SP3LS65NRFZE5Y6KV2B24LLS/graph.json","events_json":"https://pith.science/api/pith-number/S6SP3LS65NRFZE5Y6KV2B24LLS/events.json","paper":"https://pith.science/paper/S6SP3LS6"},"agent_actions":{"view_html":"https://pith.science/pith/S6SP3LS65NRFZE5Y6KV2B24LLS","download_json":"https://pith.science/pith/S6SP3LS65NRFZE5Y6KV2B24LLS.json","view_paper":"https://pith.science/paper/S6SP3LS6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.2409&json=true","fetch_graph":"https://pith.science/api/pith-number/S6SP3LS65NRFZE5Y6KV2B24LLS/graph.json","fetch_events":"https://pith.science/api/pith-number/S6SP3LS65NRFZE5Y6KV2B24LLS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S6SP3LS65NRFZE5Y6KV2B24LLS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S6SP3LS65NRFZE5Y6KV2B24LLS/action/storage_attestation","attest_author":"https://pith.science/pith/S6SP3LS65NRFZE5Y6KV2B24LLS/action/author_attestation","sign_citation":"https://pith.science/pith/S6SP3LS65NRFZE5Y6KV2B24LLS/action/citation_signature","submit_replication":"https://pith.science/pith/S6SP3LS65NRFZE5Y6KV2B24LLS/action/replication_record"}},"created_at":"2026-05-18T02:22:58.177083+00:00","updated_at":"2026-05-18T02:22:58.177083+00:00"}