{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:2RASFK57V33QHTJKMQN2DL3UAL","short_pith_number":"pith:2RASFK57","schema_version":"1.0","canonical_sha256":"d44122abbfaef703cd2a641ba1af7402c3a32d014717742c94210d1f99c0af3b","source":{"kind":"arxiv","id":"1205.0693","version":1},"attestation_state":"computed","paper":{"title":"How long can it take for a quantum channel to forget everything?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andre Ahlbrecht, Florian Richter, Reinhard F. Werner","submitted_at":"2012-05-03T12:24:48Z","abstract_excerpt":"We investigate quantum channels, which after a finite number $k$ of repeated applications erase all input information, i.e., channels whose $k$-th power (but no smaller power) is a completely depolarizing channel. We show that on a system with Hilbert space dimension $d$, the order is bounded by $k\\leq d^2-1$, and give an explicit construction scheme for such channels. We also consider strictly forgetful memory channels, i.e., channels with an additional input and output in every step, which after exactly $k$ steps retain no information about the initial memory state. We establish an explicit "},"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":"1205.0693","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-05-03T12:24:48Z","cross_cats_sorted":[],"title_canon_sha256":"1773ecaa51d2f15474b41969424fae5f8a14f810e1419256ab9618b2b36f1f1c","abstract_canon_sha256":"7bf48adb004ff796299be84b955eded1b77de20ca67118cafbaf246f702361c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:25.243100Z","signature_b64":"CXpUYNDSxbmGjF7c54mABfqFEn1kHvtS+RfvNYlIwpxgzW76LzTKY8uwZgfXzDD7Mu092zW3HnBcNMWQXdDbBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d44122abbfaef703cd2a641ba1af7402c3a32d014717742c94210d1f99c0af3b","last_reissued_at":"2026-05-18T03:56:25.242488Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:25.242488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How long can it take for a quantum channel to forget everything?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andre Ahlbrecht, Florian Richter, Reinhard F. Werner","submitted_at":"2012-05-03T12:24:48Z","abstract_excerpt":"We investigate quantum channels, which after a finite number $k$ of repeated applications erase all input information, i.e., channels whose $k$-th power (but no smaller power) is a completely depolarizing channel. We show that on a system with Hilbert space dimension $d$, the order is bounded by $k\\leq d^2-1$, and give an explicit construction scheme for such channels. We also consider strictly forgetful memory channels, i.e., channels with an additional input and output in every step, which after exactly $k$ steps retain no information about the initial memory state. We establish an explicit "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0693","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":"1205.0693","created_at":"2026-05-18T03:56:25.242602+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.0693v1","created_at":"2026-05-18T03:56:25.242602+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0693","created_at":"2026-05-18T03:56:25.242602+00:00"},{"alias_kind":"pith_short_12","alias_value":"2RASFK57V33Q","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"2RASFK57V33QHTJK","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"2RASFK57","created_at":"2026-05-18T12:26:50.516681+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/2RASFK57V33QHTJKMQN2DL3UAL","json":"https://pith.science/pith/2RASFK57V33QHTJKMQN2DL3UAL.json","graph_json":"https://pith.science/api/pith-number/2RASFK57V33QHTJKMQN2DL3UAL/graph.json","events_json":"https://pith.science/api/pith-number/2RASFK57V33QHTJKMQN2DL3UAL/events.json","paper":"https://pith.science/paper/2RASFK57"},"agent_actions":{"view_html":"https://pith.science/pith/2RASFK57V33QHTJKMQN2DL3UAL","download_json":"https://pith.science/pith/2RASFK57V33QHTJKMQN2DL3UAL.json","view_paper":"https://pith.science/paper/2RASFK57","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.0693&json=true","fetch_graph":"https://pith.science/api/pith-number/2RASFK57V33QHTJKMQN2DL3UAL/graph.json","fetch_events":"https://pith.science/api/pith-number/2RASFK57V33QHTJKMQN2DL3UAL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2RASFK57V33QHTJKMQN2DL3UAL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2RASFK57V33QHTJKMQN2DL3UAL/action/storage_attestation","attest_author":"https://pith.science/pith/2RASFK57V33QHTJKMQN2DL3UAL/action/author_attestation","sign_citation":"https://pith.science/pith/2RASFK57V33QHTJKMQN2DL3UAL/action/citation_signature","submit_replication":"https://pith.science/pith/2RASFK57V33QHTJKMQN2DL3UAL/action/replication_record"}},"created_at":"2026-05-18T03:56:25.242602+00:00","updated_at":"2026-05-18T03:56:25.242602+00:00"}