{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:FC6TQZBJLNGAMBPMSJVUZX67JT","short_pith_number":"pith:FC6TQZBJ","schema_version":"1.0","canonical_sha256":"28bd3864295b4c0605ec926b4cdfdf4cfe46fc36bd4128b9205d806cdbc3946f","source":{"kind":"arxiv","id":"2604.13096","version":2},"attestation_state":"computed","paper":{"title":"Complexity scaling and optimal policy degeneracy in quantum reinforcement learning via analytically solvable unitary-control-then-measure models","license":"http://creativecommons.org/licenses/by/4.0/","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.","cross_cats":[],"primary_cat":"math.GM","authors_text":"Alessandro Michelangeli, Andrea Cintio, Dmitrii Tsutskov","submitted_at":"2026-04-09T17:42:37Z","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 "},"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":"2604.13096","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GM","submitted_at":"2026-04-09T17:42:37Z","cross_cats_sorted":[],"title_canon_sha256":"f66f7849f8e7b4fc0ab922a2c176833e6180851daaef8ec745a9fd6cd0742ec3","abstract_canon_sha256":"233285fa19e4e8dbe4af27ece30669e61ae7cb46b64d67f78986f36670cd2b8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-03T01:17:20.453650Z","signature_b64":"F7bPXwmtVg8riVETRZ2rzUBDjOg1yhruV8dyYfeD0gs1IbWI6U2NEppF25Q76UIv4anydaL2D+0nhXMQJ/FMAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28bd3864295b4c0605ec926b4cdfdf4cfe46fc36bd4128b9205d806cdbc3946f","last_reissued_at":"2026-07-03T01:17:20.453111Z","signature_status":"signed_v1","first_computed_at":"2026-07-03T01:17:20.453111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity scaling and optimal policy degeneracy in quantum reinforcement learning via analytically solvable unitary-control-then-measure models","license":"http://creativecommons.org/licenses/by/4.0/","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.","cross_cats":[],"primary_cat":"math.GM","authors_text":"Alessandro Michelangeli, Andrea Cintio, Dmitrii Tsutskov","submitted_at":"2026-04-09T17:42:37Z","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 "},"claims":{"count":4,"items":[{"kind":"strongest_claim","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.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","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.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","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.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","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.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"7118ef9dfdb8a08702cf8d946336aa667c86e0ba72b74cbf4f22f60da15fbfc6"},"source":{"id":"2604.13096","kind":"arxiv","version":2},"verdict":{"id":"4d6a153c-2976-4c6e-916a-139fd195dc8f","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T17:04:50.361582Z","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.","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","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.","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."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.13096/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":"2604.13096","created_at":"2026-07-03T01:17:20.453163+00:00"},{"alias_kind":"arxiv_version","alias_value":"2604.13096v2","created_at":"2026-07-03T01:17:20.453163+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.13096","created_at":"2026-07-03T01:17:20.453163+00:00"},{"alias_kind":"pith_short_12","alias_value":"FC6TQZBJLNGA","created_at":"2026-07-03T01:17:20.453163+00:00"},{"alias_kind":"pith_short_16","alias_value":"FC6TQZBJLNGAMBPM","created_at":"2026-07-03T01:17:20.453163+00:00"},{"alias_kind":"pith_short_8","alias_value":"FC6TQZBJ","created_at":"2026-07-03T01:17:20.453163+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.06760","citing_title":"QANTIS: Hardware-Calibrated Sequential POMDP Belief Updates on IBM Heron","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FC6TQZBJLNGAMBPMSJVUZX67JT","json":"https://pith.science/pith/FC6TQZBJLNGAMBPMSJVUZX67JT.json","graph_json":"https://pith.science/api/pith-number/FC6TQZBJLNGAMBPMSJVUZX67JT/graph.json","events_json":"https://pith.science/api/pith-number/FC6TQZBJLNGAMBPMSJVUZX67JT/events.json","paper":"https://pith.science/paper/FC6TQZBJ"},"agent_actions":{"view_html":"https://pith.science/pith/FC6TQZBJLNGAMBPMSJVUZX67JT","download_json":"https://pith.science/pith/FC6TQZBJLNGAMBPMSJVUZX67JT.json","view_paper":"https://pith.science/paper/FC6TQZBJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2604.13096&json=true","fetch_graph":"https://pith.science/api/pith-number/FC6TQZBJLNGAMBPMSJVUZX67JT/graph.json","fetch_events":"https://pith.science/api/pith-number/FC6TQZBJLNGAMBPMSJVUZX67JT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FC6TQZBJLNGAMBPMSJVUZX67JT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FC6TQZBJLNGAMBPMSJVUZX67JT/action/storage_attestation","attest_author":"https://pith.science/pith/FC6TQZBJLNGAMBPMSJVUZX67JT/action/author_attestation","sign_citation":"https://pith.science/pith/FC6TQZBJLNGAMBPMSJVUZX67JT/action/citation_signature","submit_replication":"https://pith.science/pith/FC6TQZBJLNGAMBPMSJVUZX67JT/action/replication_record"}},"created_at":"2026-07-03T01:17:20.453163+00:00","updated_at":"2026-07-03T01:17:20.453163+00:00"}