{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:IOENMXH2LHTLIADTCEXZMYTAEM","short_pith_number":"pith:IOENMXH2","schema_version":"1.0","canonical_sha256":"4388d65cfa59e6b40073112f9662602319ac923efb2615a35b0996be35075068","source":{"kind":"arxiv","id":"2212.09328","version":1},"attestation_state":"computed","paper":{"title":"Quantum policy gradient algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","stat.ML"],"primary_cat":"quant-ph","authors_text":"Arjan Cornelissen, M\\=aris Ozols, Sofiene Jerbi, Vedran Dunjko","submitted_at":"2022-12-19T09:45:58Z","abstract_excerpt":"Understanding the power and limitations of quantum access to data in machine learning tasks is primordial to assess the potential of quantum computing in artificial intelligence. Previous works have already shown that speed-ups in learning are possible when given quantum access to reinforcement learning environments. Yet, the applicability of quantum algorithms in this setting remains very limited, notably in environments with large state and action spaces. In this work, we design quantum algorithms to train state-of-the-art reinforcement learning policies by exploiting quantum interactions wi"},"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.09328","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-12-19T09:45:58Z","cross_cats_sorted":["cs.AI","cs.LG","stat.ML"],"title_canon_sha256":"1fa106b62722ca7b10a05661cd8a9395785a0a19b7f78d577ec1bc609fa1e88e","abstract_canon_sha256":"27ce080b20428fee45fd02e812eb76098d5bfa4178382f31e58c21eeac3afbb0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:33:03.498000Z","signature_b64":"tKHZEJQhe4ISmUXCznjSQyHpWSmqfa7BjLHpyBx0LHIGVfU59JOsktMeLFUbnQAu6r6yxZfn324bdoCzlwHDCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4388d65cfa59e6b40073112f9662602319ac923efb2615a35b0996be35075068","last_reissued_at":"2026-07-05T06:33:03.497521Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:33:03.497521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum policy gradient algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","stat.ML"],"primary_cat":"quant-ph","authors_text":"Arjan Cornelissen, M\\=aris Ozols, Sofiene Jerbi, Vedran Dunjko","submitted_at":"2022-12-19T09:45:58Z","abstract_excerpt":"Understanding the power and limitations of quantum access to data in machine learning tasks is primordial to assess the potential of quantum computing in artificial intelligence. Previous works have already shown that speed-ups in learning are possible when given quantum access to reinforcement learning environments. Yet, the applicability of quantum algorithms in this setting remains very limited, notably in environments with large state and action spaces. In this work, we design quantum algorithms to train state-of-the-art reinforcement learning policies by exploiting quantum interactions wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.09328","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2212.09328/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.09328","created_at":"2026-07-05T06:33:03.497577+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.09328v1","created_at":"2026-07-05T06:33:03.497577+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.09328","created_at":"2026-07-05T06:33:03.497577+00:00"},{"alias_kind":"pith_short_12","alias_value":"IOENMXH2LHTL","created_at":"2026-07-05T06:33:03.497577+00:00"},{"alias_kind":"pith_short_16","alias_value":"IOENMXH2LHTLIADT","created_at":"2026-07-05T06:33:03.497577+00:00"},{"alias_kind":"pith_short_8","alias_value":"IOENMXH2","created_at":"2026-07-05T06:33:03.497577+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.07909","citing_title":"A Review of Variational Quantum Algorithms: Insights into Fault-Tolerant Quantum Computing","ref_index":280,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IOENMXH2LHTLIADTCEXZMYTAEM","json":"https://pith.science/pith/IOENMXH2LHTLIADTCEXZMYTAEM.json","graph_json":"https://pith.science/api/pith-number/IOENMXH2LHTLIADTCEXZMYTAEM/graph.json","events_json":"https://pith.science/api/pith-number/IOENMXH2LHTLIADTCEXZMYTAEM/events.json","paper":"https://pith.science/paper/IOENMXH2"},"agent_actions":{"view_html":"https://pith.science/pith/IOENMXH2LHTLIADTCEXZMYTAEM","download_json":"https://pith.science/pith/IOENMXH2LHTLIADTCEXZMYTAEM.json","view_paper":"https://pith.science/paper/IOENMXH2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.09328&json=true","fetch_graph":"https://pith.science/api/pith-number/IOENMXH2LHTLIADTCEXZMYTAEM/graph.json","fetch_events":"https://pith.science/api/pith-number/IOENMXH2LHTLIADTCEXZMYTAEM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IOENMXH2LHTLIADTCEXZMYTAEM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IOENMXH2LHTLIADTCEXZMYTAEM/action/storage_attestation","attest_author":"https://pith.science/pith/IOENMXH2LHTLIADTCEXZMYTAEM/action/author_attestation","sign_citation":"https://pith.science/pith/IOENMXH2LHTLIADTCEXZMYTAEM/action/citation_signature","submit_replication":"https://pith.science/pith/IOENMXH2LHTLIADTCEXZMYTAEM/action/replication_record"}},"created_at":"2026-07-05T06:33:03.497577+00:00","updated_at":"2026-07-05T06:33:03.497577+00:00"}