{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:FC6TQZBJLNGAMBPMSJVUZX67JT","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"233285fa19e4e8dbe4af27ece30669e61ae7cb46b64d67f78986f36670cd2b8b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GM","submitted_at":"2026-04-09T17:42:37Z","title_canon_sha256":"f66f7849f8e7b4fc0ab922a2c176833e6180851daaef8ec745a9fd6cd0742ec3"},"schema_version":"1.0","source":{"id":"2604.13096","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.13096","created_at":"2026-07-03T01:17:20Z"},{"alias_kind":"arxiv_version","alias_value":"2604.13096v2","created_at":"2026-07-03T01:17:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.13096","created_at":"2026-07-03T01:17:20Z"},{"alias_kind":"pith_short_12","alias_value":"FC6TQZBJLNGA","created_at":"2026-07-03T01:17:20Z"},{"alias_kind":"pith_short_16","alias_value":"FC6TQZBJLNGAMBPM","created_at":"2026-07-03T01:17:20Z"},{"alias_kind":"pith_short_8","alias_value":"FC6TQZBJ","created_at":"2026-07-03T01:17:20Z"}],"graph_snapshots":[{"event_id":"sha256:f855a38d53e94d85bb013077e8386c62f8554d7449da77db797b87f1e0d1fd0d","target":"graph","created_at":"2026-07-03T01:17:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"we identify and quantify a two-level reduction in the computational complexity of the expected return, from the nominally exponential O(e^N) scaling in the trajectory length N to an explicit power-law O(N^I): a trajectory-based level, arising from equivalence classes of paths sharing the same unordered state counts and transition frequencies, and a policy-based level, arising from the sparsity of the transition graph enforced by constrained unitary actions."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The specific choice of unitary controls and projective measurements onto a fixed reference basis in finite-dimensional spaces is assumed to permit closed-form derivations and to capture the essential complexity and degeneracy features relevant to broader quantum RL."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Analytically solvable QRL models reduce expected-return computation from O(e^N) to O(N^I) via path equivalence and transition sparsity, while exhibiting unique optima governed by Zeno effect or discrete/plateau degeneracy at critical energies."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Quantum RL with unitary control and measurement reduces expected return complexity from exponential to power-law scaling while revealing distinct optimal policy degeneracy patterns."}],"snapshot_sha256":"7118ef9dfdb8a08702cf8d946336aa667c86e0ba72b74cbf4f22f60da15fbfc6"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.13096/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose and analyse a class of analytically solvable models of quantum reinforcement learning (QRL), formulated as finite-horizon Markov decision processes in finite-dimensional Hilbert spaces. The models are built around a `unitary-control-then-measure' protocol, in which a learning agent applies unitary transformations to a quantum state and interleaves each control step with a projective measurement onto a prescribed reference basis. Exact closed-form expressions for trajectory probabilities, rewards, and the expected return are derived for four concrete realisations: a closed-chain and ","authors_text":"Alessandro Michelangeli, Andrea Cintio, Dmitrii Tsutskov","cross_cats":[],"headline":"Quantum RL with unitary control and measurement reduces expected return complexity from exponential to power-law scaling while revealing distinct optimal policy degeneracy patterns.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GM","submitted_at":"2026-04-09T17:42:37Z","title":"Complexity scaling and optimal policy degeneracy in quantum reinforcement learning via analytically solvable unitary-control-then-measure models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.13096","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-10T17:04:50.361582Z","id":"4d6a153c-2976-4c6e-916a-139fd195dc8f","model_set":{"reader":"grok-4.3"},"one_line_summary":"Analytically solvable QRL models reduce expected-return computation from O(e^N) to O(N^I) via path equivalence and transition sparsity, while exhibiting unique optima governed by Zeno effect or discrete/plateau degeneracy at critical energies.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Quantum RL with unitary control and measurement reduces expected return complexity from exponential to power-law scaling while revealing distinct optimal policy degeneracy patterns.","strongest_claim":"we identify and quantify a two-level reduction in the computational complexity of the expected return, from the nominally exponential O(e^N) scaling in the trajectory length N to an explicit power-law O(N^I): a trajectory-based level, arising from equivalence classes of paths sharing the same unordered state counts and transition frequencies, and a policy-based level, arising from the sparsity of the transition graph enforced by constrained unitary actions.","weakest_assumption":"The specific choice of unitary controls and projective measurements onto a fixed reference basis in finite-dimensional spaces is assumed to permit closed-form derivations and to capture the essential complexity and degeneracy features relevant to broader quantum RL."}},"verdict_id":"4d6a153c-2976-4c6e-916a-139fd195dc8f"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e7c562b10e2734f76f5948ad6be712ffde2bfd80915c95802a54a45ce7fb2f4b","target":"record","created_at":"2026-07-03T01:17:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"233285fa19e4e8dbe4af27ece30669e61ae7cb46b64d67f78986f36670cd2b8b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GM","submitted_at":"2026-04-09T17:42:37Z","title_canon_sha256":"f66f7849f8e7b4fc0ab922a2c176833e6180851daaef8ec745a9fd6cd0742ec3"},"schema_version":"1.0","source":{"id":"2604.13096","kind":"arxiv","version":2}},"canonical_sha256":"28bd3864295b4c0605ec926b4cdfdf4cfe46fc36bd4128b9205d806cdbc3946f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"28bd3864295b4c0605ec926b4cdfdf4cfe46fc36bd4128b9205d806cdbc3946f","first_computed_at":"2026-07-03T01:17:20.453111Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-03T01:17:20.453111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F7bPXwmtVg8riVETRZ2rzUBDjOg1yhruV8dyYfeD0gs1IbWI6U2NEppF25Q76UIv4anydaL2D+0nhXMQJ/FMAg==","signature_status":"signed_v1","signed_at":"2026-07-03T01:17:20.453650Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.13096","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7c562b10e2734f76f5948ad6be712ffde2bfd80915c95802a54a45ce7fb2f4b","sha256:f855a38d53e94d85bb013077e8386c62f8554d7449da77db797b87f1e0d1fd0d"],"state_sha256":"fc58e2721e04b5eca16946e70af02de7c09ba29b07fcdfc983682ceeab85369e"}