{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TNTSBGAKPEI6QQA4T62RTJUECK","short_pith_number":"pith:TNTSBGAK","schema_version":"1.0","canonical_sha256":"9b6720980a7911e8401c9fb519a68412a042674092a1b2b5dfd65bc11ae006de","source":{"kind":"arxiv","id":"2411.01391","version":1},"attestation_state":"computed","paper":{"title":"Differentiable Quantum Computing for Large-scale Linear Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET","cs.LG","cs.NA","math.NA","math.OC"],"primary_cat":"quant-ph","authors_text":"Connor Clayton, Gengzhi Yang, Jiaqi Leng, Ming C. Lin, Xiaodi Wu, Yi-Ling Qiao","submitted_at":"2024-11-03T00:54:33Z","abstract_excerpt":"As industrial models and designs grow increasingly complex, the demand for optimal control of large-scale dynamical systems has significantly increased. However, traditional methods for optimal control incur significant overhead as problem dimensions grow. In this paper, we introduce an end-to-end quantum algorithm for linear-quadratic control with provable speedups. Our algorithm, based on a policy gradient method, incorporates a novel quantum subroutine for solving the matrix Lyapunov equation. Specifically, we build a quantum-assisted differentiable simulator for efficient gradient estimati"},"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":"2411.01391","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-11-03T00:54:33Z","cross_cats_sorted":["cs.ET","cs.LG","cs.NA","math.NA","math.OC"],"title_canon_sha256":"62d9672dd9c33f436647e0a3732617e2c55e9e3f6721583d7603d51625d400ed","abstract_canon_sha256":"db505758644854bbc0c1a60a34e254f18ea066db068867c365a4791b26b332d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:30:29.560831Z","signature_b64":"IikZXBqspgJYqur2Da7u+f3y9JogO1kVQYiToHRj9YcaY74HrSjxhPyRHusHeC1itro3BbOBNNHG+7Ounmr4AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b6720980a7911e8401c9fb519a68412a042674092a1b2b5dfd65bc11ae006de","last_reissued_at":"2026-07-05T09:30:29.560498Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:30:29.560498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Differentiable Quantum Computing for Large-scale Linear Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET","cs.LG","cs.NA","math.NA","math.OC"],"primary_cat":"quant-ph","authors_text":"Connor Clayton, Gengzhi Yang, Jiaqi Leng, Ming C. Lin, Xiaodi Wu, Yi-Ling Qiao","submitted_at":"2024-11-03T00:54:33Z","abstract_excerpt":"As industrial models and designs grow increasingly complex, the demand for optimal control of large-scale dynamical systems has significantly increased. However, traditional methods for optimal control incur significant overhead as problem dimensions grow. In this paper, we introduce an end-to-end quantum algorithm for linear-quadratic control with provable speedups. Our algorithm, based on a policy gradient method, incorporates a novel quantum subroutine for solving the matrix Lyapunov equation. Specifically, we build a quantum-assisted differentiable simulator for efficient gradient estimati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.01391","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/2411.01391/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":"2411.01391","created_at":"2026-07-05T09:30:29.560547+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.01391v1","created_at":"2026-07-05T09:30:29.560547+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.01391","created_at":"2026-07-05T09:30:29.560547+00:00"},{"alias_kind":"pith_short_12","alias_value":"TNTSBGAKPEI6","created_at":"2026-07-05T09:30:29.560547+00:00"},{"alias_kind":"pith_short_16","alias_value":"TNTSBGAKPEI6QQA4","created_at":"2026-07-05T09:30:29.560547+00:00"},{"alias_kind":"pith_short_8","alias_value":"TNTSBGAK","created_at":"2026-07-05T09:30:29.560547+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.15170","citing_title":"Quantum Differential Equation Solvers with Low State Preparation Cost: Eliminating the Time Dependence in Dissipative Equations","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TNTSBGAKPEI6QQA4T62RTJUECK","json":"https://pith.science/pith/TNTSBGAKPEI6QQA4T62RTJUECK.json","graph_json":"https://pith.science/api/pith-number/TNTSBGAKPEI6QQA4T62RTJUECK/graph.json","events_json":"https://pith.science/api/pith-number/TNTSBGAKPEI6QQA4T62RTJUECK/events.json","paper":"https://pith.science/paper/TNTSBGAK"},"agent_actions":{"view_html":"https://pith.science/pith/TNTSBGAKPEI6QQA4T62RTJUECK","download_json":"https://pith.science/pith/TNTSBGAKPEI6QQA4T62RTJUECK.json","view_paper":"https://pith.science/paper/TNTSBGAK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.01391&json=true","fetch_graph":"https://pith.science/api/pith-number/TNTSBGAKPEI6QQA4T62RTJUECK/graph.json","fetch_events":"https://pith.science/api/pith-number/TNTSBGAKPEI6QQA4T62RTJUECK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TNTSBGAKPEI6QQA4T62RTJUECK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TNTSBGAKPEI6QQA4T62RTJUECK/action/storage_attestation","attest_author":"https://pith.science/pith/TNTSBGAKPEI6QQA4T62RTJUECK/action/author_attestation","sign_citation":"https://pith.science/pith/TNTSBGAKPEI6QQA4T62RTJUECK/action/citation_signature","submit_replication":"https://pith.science/pith/TNTSBGAKPEI6QQA4T62RTJUECK/action/replication_record"}},"created_at":"2026-07-05T09:30:29.560547+00:00","updated_at":"2026-07-05T09:30:29.560547+00:00"}