{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:2AJYCZNRDDQJXC3RTU5M3YIFIT","short_pith_number":"pith:2AJYCZNR","schema_version":"1.0","canonical_sha256":"d0138165b118e09b8b719d3acde10544c33777c0a1ac54b936271d0961b76ce9","source":{"kind":"arxiv","id":"1909.02108","version":3},"attestation_state":"computed","paper":{"title":"Quantum Natural Gradient","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"quant-ph","authors_text":"Giuseppe Carleo, James Stokes, Josh Izaac, Nathan Killoran","submitted_at":"2019-09-04T20:52:32Z","abstract_excerpt":"A quantum generalization of Natural Gradient Descent is presented as part of a general-purpose optimization framework for variational quantum circuits. The optimization dynamics is interpreted as moving in the steepest descent direction with respect to the Quantum Information Geometry, corresponding to the real part of the Quantum Geometric Tensor (QGT), also known as the Fubini-Study metric tensor. An efficient algorithm is presented for computing a block-diagonal approximation to the Fubini-Study metric tensor for parametrized quantum circuits, which may be of independent interest."},"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":"1909.02108","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"quant-ph","submitted_at":"2019-09-04T20:52:32Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"deaf28a18bd7f3510b290f0c7c42ba3839219f862712cc05f3ae048f112d0500","abstract_canon_sha256":"9440dd20b84bc20d8395907403090f6d70c5598e965e3dce64ec1e696555d12b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:05:36.427273Z","signature_b64":"GMm1huUWZ6ZhPSG9Vkon+pfbf6j6DO31clLFzvVZ44DGZIvOpLAvwH8azfJOO9ENKSj8j6Aj+NlENQSVS1+XBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0138165b118e09b8b719d3acde10544c33777c0a1ac54b936271d0961b76ce9","last_reissued_at":"2026-07-05T01:05:36.426803Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:05:36.426803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Natural Gradient","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"quant-ph","authors_text":"Giuseppe Carleo, James Stokes, Josh Izaac, Nathan Killoran","submitted_at":"2019-09-04T20:52:32Z","abstract_excerpt":"A quantum generalization of Natural Gradient Descent is presented as part of a general-purpose optimization framework for variational quantum circuits. The optimization dynamics is interpreted as moving in the steepest descent direction with respect to the Quantum Information Geometry, corresponding to the real part of the Quantum Geometric Tensor (QGT), also known as the Fubini-Study metric tensor. An efficient algorithm is presented for computing a block-diagonal approximation to the Fubini-Study metric tensor for parametrized quantum circuits, which may be of independent interest."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.02108","kind":"arxiv","version":3},"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/1909.02108/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":"1909.02108","created_at":"2026-07-05T01:05:36.426861+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.02108v3","created_at":"2026-07-05T01:05:36.426861+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.02108","created_at":"2026-07-05T01:05:36.426861+00:00"},{"alias_kind":"pith_short_12","alias_value":"2AJYCZNRDDQJ","created_at":"2026-07-05T01:05:36.426861+00:00"},{"alias_kind":"pith_short_16","alias_value":"2AJYCZNRDDQJXC3R","created_at":"2026-07-05T01:05:36.426861+00:00"},{"alias_kind":"pith_short_8","alias_value":"2AJYCZNR","created_at":"2026-07-05T01:05:36.426861+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.01253","citing_title":"Evaluating quantum circuits in the reservoir computing paradigm","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2605.28927","citing_title":"Quantum encodings that preserve persistent homology","ref_index":191,"is_internal_anchor":false},{"citing_arxiv_id":"2510.23546","citing_title":"Variational Thermal State Preparation on Digital Quantum Processors Assisted by Matrix Product States","ref_index":59,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01253","citing_title":"Evaluating quantum circuits in the reservoir computing paradigm","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05627","citing_title":"Loss-aware state space geometry for quantum variational algorithms","ref_index":58,"is_internal_anchor":false},{"citing_arxiv_id":"1811.04968","citing_title":"PennyLane: Automatic differentiation of hybrid quantum-classical computations","ref_index":62,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2AJYCZNRDDQJXC3RTU5M3YIFIT","json":"https://pith.science/pith/2AJYCZNRDDQJXC3RTU5M3YIFIT.json","graph_json":"https://pith.science/api/pith-number/2AJYCZNRDDQJXC3RTU5M3YIFIT/graph.json","events_json":"https://pith.science/api/pith-number/2AJYCZNRDDQJXC3RTU5M3YIFIT/events.json","paper":"https://pith.science/paper/2AJYCZNR"},"agent_actions":{"view_html":"https://pith.science/pith/2AJYCZNRDDQJXC3RTU5M3YIFIT","download_json":"https://pith.science/pith/2AJYCZNRDDQJXC3RTU5M3YIFIT.json","view_paper":"https://pith.science/paper/2AJYCZNR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.02108&json=true","fetch_graph":"https://pith.science/api/pith-number/2AJYCZNRDDQJXC3RTU5M3YIFIT/graph.json","fetch_events":"https://pith.science/api/pith-number/2AJYCZNRDDQJXC3RTU5M3YIFIT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2AJYCZNRDDQJXC3RTU5M3YIFIT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2AJYCZNRDDQJXC3RTU5M3YIFIT/action/storage_attestation","attest_author":"https://pith.science/pith/2AJYCZNRDDQJXC3RTU5M3YIFIT/action/author_attestation","sign_citation":"https://pith.science/pith/2AJYCZNRDDQJXC3RTU5M3YIFIT/action/citation_signature","submit_replication":"https://pith.science/pith/2AJYCZNRDDQJXC3RTU5M3YIFIT/action/replication_record"}},"created_at":"2026-07-05T01:05:36.426861+00:00","updated_at":"2026-07-05T01:05:36.426861+00:00"}