{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:LD2O7CFO723EJ2OEA2ENBTBJUI","short_pith_number":"pith:LD2O7CFO","schema_version":"1.0","canonical_sha256":"58f4ef88aefeb644e9c40688d0cc29a204ca5bb983108b1e1e1ea166dfd8f2b6","source":{"kind":"arxiv","id":"2401.07043","version":1},"attestation_state":"computed","paper":{"title":"Quantum Advantage Actor-Critic for Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"quant-ph","authors_text":"Claudia Linnhoff-Popien, Fabian Ritz, Jonas Stein, Maximilian Zorn, Michael K\\\"olle, Mohamad Hagog, Philipp Altmann","submitted_at":"2024-01-13T11:08:45Z","abstract_excerpt":"Quantum computing offers efficient encapsulation of high-dimensional states. In this work, we propose a novel quantum reinforcement learning approach that combines the Advantage Actor-Critic algorithm with variational quantum circuits by substituting parts of the classical components. This approach addresses reinforcement learning's scalability concerns while maintaining high performance. We empirically test multiple quantum Advantage Actor-Critic configurations with the well known Cart Pole environment to evaluate our approach in control tasks with continuous state spaces. Our results indicat"},"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":"2401.07043","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-01-13T11:08:45Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"3fb1359793d6f01b5a7304a2f1ee1932ff21120b33d63702da0d2cf6aa27d24b","abstract_canon_sha256":"15c42e150f9c6291bac323da9b1617b9e017f74daddb8ce72cffaebb374aa15b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:48:45.065656Z","signature_b64":"tyqfqstxYKHoRgZq3I8rWIu3Nd+/FptebAEX8HnAQLMBR4yKz4WLLz03bdQ/a8/jiFJQ2ecPA7ElaPbjtjnFAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58f4ef88aefeb644e9c40688d0cc29a204ca5bb983108b1e1e1ea166dfd8f2b6","last_reissued_at":"2026-07-05T11:48:45.065136Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:48:45.065136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Advantage Actor-Critic for Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"quant-ph","authors_text":"Claudia Linnhoff-Popien, Fabian Ritz, Jonas Stein, Maximilian Zorn, Michael K\\\"olle, Mohamad Hagog, Philipp Altmann","submitted_at":"2024-01-13T11:08:45Z","abstract_excerpt":"Quantum computing offers efficient encapsulation of high-dimensional states. In this work, we propose a novel quantum reinforcement learning approach that combines the Advantage Actor-Critic algorithm with variational quantum circuits by substituting parts of the classical components. This approach addresses reinforcement learning's scalability concerns while maintaining high performance. We empirically test multiple quantum Advantage Actor-Critic configurations with the well known Cart Pole environment to evaluate our approach in control tasks with continuous state spaces. Our results indicat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.07043","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/2401.07043/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":"2401.07043","created_at":"2026-07-05T11:48:45.065203+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.07043v1","created_at":"2026-07-05T11:48:45.065203+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.07043","created_at":"2026-07-05T11:48:45.065203+00:00"},{"alias_kind":"pith_short_12","alias_value":"LD2O7CFO723E","created_at":"2026-07-05T11:48:45.065203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LD2O7CFO723EJ2OE","created_at":"2026-07-05T11:48:45.065203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LD2O7CFO","created_at":"2026-07-05T11:48:45.065203+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2603.10289","citing_title":"Quantum entanglement provides a competitive advantage in adversarial games","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LD2O7CFO723EJ2OEA2ENBTBJUI","json":"https://pith.science/pith/LD2O7CFO723EJ2OEA2ENBTBJUI.json","graph_json":"https://pith.science/api/pith-number/LD2O7CFO723EJ2OEA2ENBTBJUI/graph.json","events_json":"https://pith.science/api/pith-number/LD2O7CFO723EJ2OEA2ENBTBJUI/events.json","paper":"https://pith.science/paper/LD2O7CFO"},"agent_actions":{"view_html":"https://pith.science/pith/LD2O7CFO723EJ2OEA2ENBTBJUI","download_json":"https://pith.science/pith/LD2O7CFO723EJ2OEA2ENBTBJUI.json","view_paper":"https://pith.science/paper/LD2O7CFO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.07043&json=true","fetch_graph":"https://pith.science/api/pith-number/LD2O7CFO723EJ2OEA2ENBTBJUI/graph.json","fetch_events":"https://pith.science/api/pith-number/LD2O7CFO723EJ2OEA2ENBTBJUI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LD2O7CFO723EJ2OEA2ENBTBJUI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LD2O7CFO723EJ2OEA2ENBTBJUI/action/storage_attestation","attest_author":"https://pith.science/pith/LD2O7CFO723EJ2OEA2ENBTBJUI/action/author_attestation","sign_citation":"https://pith.science/pith/LD2O7CFO723EJ2OEA2ENBTBJUI/action/citation_signature","submit_replication":"https://pith.science/pith/LD2O7CFO723EJ2OEA2ENBTBJUI/action/replication_record"}},"created_at":"2026-07-05T11:48:45.065203+00:00","updated_at":"2026-07-05T11:48:45.065203+00:00"}