{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:3PMMKD3FYVFZUFY4EXJBPR7JQU","short_pith_number":"pith:3PMMKD3F","schema_version":"1.0","canonical_sha256":"dbd8c50f65c54b9a171c25d217c7e985223e63d57fad5c39eca616dc17090757","source":{"kind":"arxiv","id":"2607.15184","version":1},"attestation_state":"computed","paper":{"title":"Backpropagating Pauli Propagation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.str-el"],"primary_cat":"quant-ph","authors_text":"Etienne Granet, Henrik Dreyer, Kevin H\\'emery, Sheng-Hsuan Lin","submitted_at":"2026-07-16T16:35:38Z","abstract_excerpt":"We develop a backpropagation algorithm for evaluating parameter gradients in quantum circuits using Pauli propagation simulation. The method has computational complexity comparable to that of standard sparse Pauli simulation techniques, while producing gradients whose accuracy is of the same order as the corresponding observable expectation values. By exploiting the reversibility of quantum circuits, the algorithm reduces the memory cost by a factor of $\\mathcal{O}(n_\\text{param})$ compared with conventional reverse-mode automatic differentiation, where $n_\\text{param}$ denotes the number of p"},"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":"2607.15184","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-16T16:35:38Z","cross_cats_sorted":["cond-mat.str-el"],"title_canon_sha256":"6d1af4183ad3b56cd0666ae3ee25901a484eb1b2111bb71e36d7f00343a4e7c1","abstract_canon_sha256":"0252b02564594d6284147f576d48f7077044c5ed0ca952329d0d0764dfbef428"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-17T01:22:13.290240Z","signature_b64":"0n1o+IibMHV4UHz8g51hQ1KJ2NER/CFUFlAuQqHhcCVRpxGGW9tV9zs5soVGgK/psTF+hhggJR+iPO7yE8zuDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbd8c50f65c54b9a171c25d217c7e985223e63d57fad5c39eca616dc17090757","last_reissued_at":"2026-07-17T01:22:13.289446Z","signature_status":"signed_v1","first_computed_at":"2026-07-17T01:22:13.289446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Backpropagating Pauli Propagation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.str-el"],"primary_cat":"quant-ph","authors_text":"Etienne Granet, Henrik Dreyer, Kevin H\\'emery, Sheng-Hsuan Lin","submitted_at":"2026-07-16T16:35:38Z","abstract_excerpt":"We develop a backpropagation algorithm for evaluating parameter gradients in quantum circuits using Pauli propagation simulation. The method has computational complexity comparable to that of standard sparse Pauli simulation techniques, while producing gradients whose accuracy is of the same order as the corresponding observable expectation values. By exploiting the reversibility of quantum circuits, the algorithm reduces the memory cost by a factor of $\\mathcal{O}(n_\\text{param})$ compared with conventional reverse-mode automatic differentiation, where $n_\\text{param}$ denotes the number of p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.15184","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/2607.15184/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":"2607.15184","created_at":"2026-07-17T01:22:13.289858+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.15184v1","created_at":"2026-07-17T01:22:13.289858+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.15184","created_at":"2026-07-17T01:22:13.289858+00:00"},{"alias_kind":"pith_short_12","alias_value":"3PMMKD3FYVFZ","created_at":"2026-07-17T01:22:13.289858+00:00"},{"alias_kind":"pith_short_16","alias_value":"3PMMKD3FYVFZUFY4","created_at":"2026-07-17T01:22:13.289858+00:00"},{"alias_kind":"pith_short_8","alias_value":"3PMMKD3F","created_at":"2026-07-17T01:22:13.289858+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3PMMKD3FYVFZUFY4EXJBPR7JQU","json":"https://pith.science/pith/3PMMKD3FYVFZUFY4EXJBPR7JQU.json","graph_json":"https://pith.science/api/pith-number/3PMMKD3FYVFZUFY4EXJBPR7JQU/graph.json","events_json":"https://pith.science/api/pith-number/3PMMKD3FYVFZUFY4EXJBPR7JQU/events.json","paper":"https://pith.science/paper/3PMMKD3F"},"agent_actions":{"view_html":"https://pith.science/pith/3PMMKD3FYVFZUFY4EXJBPR7JQU","download_json":"https://pith.science/pith/3PMMKD3FYVFZUFY4EXJBPR7JQU.json","view_paper":"https://pith.science/paper/3PMMKD3F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.15184&json=true","fetch_graph":"https://pith.science/api/pith-number/3PMMKD3FYVFZUFY4EXJBPR7JQU/graph.json","fetch_events":"https://pith.science/api/pith-number/3PMMKD3FYVFZUFY4EXJBPR7JQU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3PMMKD3FYVFZUFY4EXJBPR7JQU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3PMMKD3FYVFZUFY4EXJBPR7JQU/action/storage_attestation","attest_author":"https://pith.science/pith/3PMMKD3FYVFZUFY4EXJBPR7JQU/action/author_attestation","sign_citation":"https://pith.science/pith/3PMMKD3FYVFZUFY4EXJBPR7JQU/action/citation_signature","submit_replication":"https://pith.science/pith/3PMMKD3FYVFZUFY4EXJBPR7JQU/action/replication_record"}},"created_at":"2026-07-17T01:22:13.289858+00:00","updated_at":"2026-07-17T01:22:13.289858+00:00"}