{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:3YS7BJVS3FAF76AZ7YVGPPCEVT","short_pith_number":"pith:3YS7BJVS","schema_version":"1.0","canonical_sha256":"de25f0a6b2d9405ff819fe2a67bc44acfe5d1de38ce1f13ef34e7a6bd1093f4d","source":{"kind":"arxiv","id":"2505.10080","version":2},"attestation_state":"computed","paper":{"title":"Role of scrambling and noise in temporal information processing with quantum systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cs.LG","cs.NE","stat.ML"],"primary_cat":"quant-ph","authors_text":"Armando Angrisani, Supanut Thanasilp, Thiparat Chotibut, Weijie Xiong, Yudai Suzuki, Zo\\\"e Holmes","submitted_at":"2025-05-15T08:35:10Z","abstract_excerpt":"Scrambling quantum systems have attracted attention as effective substrates for temporal information processing. Here we consider a quantum reservoir processing framework that captures a broad range of physical computing models with quantum systems. We examine the scalability and memory retention of the model with scrambling reservoirs modelled by high-order unitary designs in both noiseless and noisy settings. In the former regime, we show that measurement readouts become exponentially concentrated with increasing reservoir size, yet strikingly do not worsen with the reservoir iterations. Thu"},"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":"2505.10080","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-05-15T08:35:10Z","cross_cats_sorted":["cond-mat.dis-nn","cs.LG","cs.NE","stat.ML"],"title_canon_sha256":"207d92d92e5e51e55c778d55650ee9ad80463885b7484f60fd123f17137cd8f5","abstract_canon_sha256":"a27aa7f9b55442fa10e0f545e6f6ade881c9c74d58d3390ccc2ab698c3d887da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:33:05.106138Z","signature_b64":"/0NMfiJyDNGDjCCtiYLOzCKBzJ25cpnZsKhA2LK/Wd07mvazAE0RekyFg2HhY94PJn3v/3E34iLLzviFQyliDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de25f0a6b2d9405ff819fe2a67bc44acfe5d1de38ce1f13ef34e7a6bd1093f4d","last_reissued_at":"2026-07-05T11:33:05.105618Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:33:05.105618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Role of scrambling and noise in temporal information processing with quantum systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cs.LG","cs.NE","stat.ML"],"primary_cat":"quant-ph","authors_text":"Armando Angrisani, Supanut Thanasilp, Thiparat Chotibut, Weijie Xiong, Yudai Suzuki, Zo\\\"e Holmes","submitted_at":"2025-05-15T08:35:10Z","abstract_excerpt":"Scrambling quantum systems have attracted attention as effective substrates for temporal information processing. Here we consider a quantum reservoir processing framework that captures a broad range of physical computing models with quantum systems. We examine the scalability and memory retention of the model with scrambling reservoirs modelled by high-order unitary designs in both noiseless and noisy settings. In the former regime, we show that measurement readouts become exponentially concentrated with increasing reservoir size, yet strikingly do not worsen with the reservoir iterations. Thu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.10080","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/2505.10080/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":"2505.10080","created_at":"2026-07-05T11:33:05.105686+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.10080v2","created_at":"2026-07-05T11:33:05.105686+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.10080","created_at":"2026-07-05T11:33:05.105686+00:00"},{"alias_kind":"pith_short_12","alias_value":"3YS7BJVS3FAF","created_at":"2026-07-05T11:33:05.105686+00:00"},{"alias_kind":"pith_short_16","alias_value":"3YS7BJVS3FAF76AZ","created_at":"2026-07-05T11:33:05.105686+00:00"},{"alias_kind":"pith_short_8","alias_value":"3YS7BJVS","created_at":"2026-07-05T11:33:05.105686+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08037","citing_title":"Robust Quantum Learning through Hamiltonian Reservoir Computing","ref_index":24,"is_internal_anchor":true},{"citing_arxiv_id":"2606.18991","citing_title":"Measurement-enabled online quantum processing with amplitude encoding","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2510.18623","citing_title":"Optimal quantum reservoir learning in proximity to universality","ref_index":83,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3YS7BJVS3FAF76AZ7YVGPPCEVT","json":"https://pith.science/pith/3YS7BJVS3FAF76AZ7YVGPPCEVT.json","graph_json":"https://pith.science/api/pith-number/3YS7BJVS3FAF76AZ7YVGPPCEVT/graph.json","events_json":"https://pith.science/api/pith-number/3YS7BJVS3FAF76AZ7YVGPPCEVT/events.json","paper":"https://pith.science/paper/3YS7BJVS"},"agent_actions":{"view_html":"https://pith.science/pith/3YS7BJVS3FAF76AZ7YVGPPCEVT","download_json":"https://pith.science/pith/3YS7BJVS3FAF76AZ7YVGPPCEVT.json","view_paper":"https://pith.science/paper/3YS7BJVS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.10080&json=true","fetch_graph":"https://pith.science/api/pith-number/3YS7BJVS3FAF76AZ7YVGPPCEVT/graph.json","fetch_events":"https://pith.science/api/pith-number/3YS7BJVS3FAF76AZ7YVGPPCEVT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3YS7BJVS3FAF76AZ7YVGPPCEVT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3YS7BJVS3FAF76AZ7YVGPPCEVT/action/storage_attestation","attest_author":"https://pith.science/pith/3YS7BJVS3FAF76AZ7YVGPPCEVT/action/author_attestation","sign_citation":"https://pith.science/pith/3YS7BJVS3FAF76AZ7YVGPPCEVT/action/citation_signature","submit_replication":"https://pith.science/pith/3YS7BJVS3FAF76AZ7YVGPPCEVT/action/replication_record"}},"created_at":"2026-07-05T11:33:05.105686+00:00","updated_at":"2026-07-05T11:33:05.105686+00:00"}