{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:P6Y3CY56KOO4TUJA4SVCBXVEGV","short_pith_number":"pith:P6Y3CY56","schema_version":"1.0","canonical_sha256":"7fb1b163be539dc9d120e4aa20dea435492a5af76a5af562071ee26dc6c9ff01","source":{"kind":"arxiv","id":"2212.11338","version":4},"attestation_state":"computed","paper":{"title":"Learning efficient decoders for quasi-chaotic quantum scramblers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alioscia Hamma, Lorenzo Leone, Salvatore F.E. Oliviero, Seth Lloyd","submitted_at":"2022-12-21T20:19:53Z","abstract_excerpt":"Scrambling of quantum information is an important feature at the root of randomization and benchmarking protocols, the onset of quantum chaos, and black-hole physics. Unscrambling this information is possible given perfect knowledge of the scrambler [arXiv:1710.03363.]. We show that one can retrieve the scrambled information even without any previous knowledge of the scrambler, by a learning algorithm that allows the building of an efficient decoder. Remarkably, the decoder is classical in the sense that it can be efficiently represented on a classical computer as a Clifford operator. It is st"},"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":"2212.11338","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-12-21T20:19:53Z","cross_cats_sorted":[],"title_canon_sha256":"27590cff0819e11d3adaba15e0675d61b8a85d2ae61a627b13764580e777606f","abstract_canon_sha256":"f86e6a2ccb5da09d895fdef782e3ea4c8106530f8df93b7943189d91dc119466"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:52:08.063148Z","signature_b64":"c03XBvBMpMned0272CcXO1vTy32iUToHzuy0fC/SrkUYfNhjN+2cKtks6ZpH508GGOnf2wgLoIGhvBRWnqzeAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fb1b163be539dc9d120e4aa20dea435492a5af76a5af562071ee26dc6c9ff01","last_reissued_at":"2026-07-05T07:52:08.062669Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:52:08.062669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning efficient decoders for quasi-chaotic quantum scramblers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alioscia Hamma, Lorenzo Leone, Salvatore F.E. Oliviero, Seth Lloyd","submitted_at":"2022-12-21T20:19:53Z","abstract_excerpt":"Scrambling of quantum information is an important feature at the root of randomization and benchmarking protocols, the onset of quantum chaos, and black-hole physics. Unscrambling this information is possible given perfect knowledge of the scrambler [arXiv:1710.03363.]. We show that one can retrieve the scrambled information even without any previous knowledge of the scrambler, by a learning algorithm that allows the building of an efficient decoder. Remarkably, the decoder is classical in the sense that it can be efficiently represented on a classical computer as a Clifford operator. It is st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.11338","kind":"arxiv","version":4},"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/2212.11338/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":"2212.11338","created_at":"2026-07-05T07:52:08.062725+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.11338v4","created_at":"2026-07-05T07:52:08.062725+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.11338","created_at":"2026-07-05T07:52:08.062725+00:00"},{"alias_kind":"pith_short_12","alias_value":"P6Y3CY56KOO4","created_at":"2026-07-05T07:52:08.062725+00:00"},{"alias_kind":"pith_short_16","alias_value":"P6Y3CY56KOO4TUJA","created_at":"2026-07-05T07:52:08.062725+00:00"},{"alias_kind":"pith_short_8","alias_value":"P6Y3CY56","created_at":"2026-07-05T07:52:08.062725+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2505.10110","citing_title":"Non-Clifford Cost of Random Unitaries","ref_index":106,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P6Y3CY56KOO4TUJA4SVCBXVEGV","json":"https://pith.science/pith/P6Y3CY56KOO4TUJA4SVCBXVEGV.json","graph_json":"https://pith.science/api/pith-number/P6Y3CY56KOO4TUJA4SVCBXVEGV/graph.json","events_json":"https://pith.science/api/pith-number/P6Y3CY56KOO4TUJA4SVCBXVEGV/events.json","paper":"https://pith.science/paper/P6Y3CY56"},"agent_actions":{"view_html":"https://pith.science/pith/P6Y3CY56KOO4TUJA4SVCBXVEGV","download_json":"https://pith.science/pith/P6Y3CY56KOO4TUJA4SVCBXVEGV.json","view_paper":"https://pith.science/paper/P6Y3CY56","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.11338&json=true","fetch_graph":"https://pith.science/api/pith-number/P6Y3CY56KOO4TUJA4SVCBXVEGV/graph.json","fetch_events":"https://pith.science/api/pith-number/P6Y3CY56KOO4TUJA4SVCBXVEGV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P6Y3CY56KOO4TUJA4SVCBXVEGV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P6Y3CY56KOO4TUJA4SVCBXVEGV/action/storage_attestation","attest_author":"https://pith.science/pith/P6Y3CY56KOO4TUJA4SVCBXVEGV/action/author_attestation","sign_citation":"https://pith.science/pith/P6Y3CY56KOO4TUJA4SVCBXVEGV/action/citation_signature","submit_replication":"https://pith.science/pith/P6Y3CY56KOO4TUJA4SVCBXVEGV/action/replication_record"}},"created_at":"2026-07-05T07:52:08.062725+00:00","updated_at":"2026-07-05T07:52:08.062725+00:00"}