{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:INOFUY3UQYDVTPOANXAXP3A6XO","short_pith_number":"pith:INOFUY3U","schema_version":"1.0","canonical_sha256":"435c5a6374860759bdc06dc177ec1ebbacd77cc27ac74ba2f634628d084216b5","source":{"kind":"arxiv","id":"2606.31952","version":1},"attestation_state":"computed","paper":{"title":"An efficient Pauli decomposition algorithm for structured matrices","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexey V. Gorshkov, Daniel J. Spencer, Kishor Bharti","submitted_at":"2026-06-30T16:57:07Z","abstract_excerpt":"Decomposing classical matrices into linear combinations of Pauli strings is a major bottleneck for end-to-end implementations of near-term quantum algorithms. In this work, we consider a promise version of this Pauli decomposition problem in which the matrix is guaranteed to have support on only $k = \\mathsf{poly}(n)$ Pauli strings and is given through classical sparse query access. Existing Pauli decomposition algorithms are designed for the generic, dense problem and do not inherently take advantage of this promised sparsity, so these approaches take time that is exponential in $n$. We prese"},"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":"2606.31952","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-30T16:57:07Z","cross_cats_sorted":[],"title_canon_sha256":"7a3b8323338434a2f6666e95792be6d8d44a19ffb66004510575eb8f6e140814","abstract_canon_sha256":"7b8a607d60e2f23459ce5fe1781ab88ba24d4f25016f7fd2fefdcf24eecd7523"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-01T01:18:26.846089Z","signature_b64":"n9OnWcX/BKe1WDgnbZ17h/oeBZ9gc/LoRVjSRPeS3kix5GmsUtqMXRsStJqZMDAkWgxofmObp4LKhlgX/BbvCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"435c5a6374860759bdc06dc177ec1ebbacd77cc27ac74ba2f634628d084216b5","last_reissued_at":"2026-07-01T01:18:26.845616Z","signature_status":"signed_v1","first_computed_at":"2026-07-01T01:18:26.845616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An efficient Pauli decomposition algorithm for structured matrices","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexey V. Gorshkov, Daniel J. Spencer, Kishor Bharti","submitted_at":"2026-06-30T16:57:07Z","abstract_excerpt":"Decomposing classical matrices into linear combinations of Pauli strings is a major bottleneck for end-to-end implementations of near-term quantum algorithms. In this work, we consider a promise version of this Pauli decomposition problem in which the matrix is guaranteed to have support on only $k = \\mathsf{poly}(n)$ Pauli strings and is given through classical sparse query access. Existing Pauli decomposition algorithms are designed for the generic, dense problem and do not inherently take advantage of this promised sparsity, so these approaches take time that is exponential in $n$. We prese"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.31952","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/2606.31952/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":"2606.31952","created_at":"2026-07-01T01:18:26.845673+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.31952v1","created_at":"2026-07-01T01:18:26.845673+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.31952","created_at":"2026-07-01T01:18:26.845673+00:00"},{"alias_kind":"pith_short_12","alias_value":"INOFUY3UQYDV","created_at":"2026-07-01T01:18:26.845673+00:00"},{"alias_kind":"pith_short_16","alias_value":"INOFUY3UQYDVTPOA","created_at":"2026-07-01T01:18:26.845673+00:00"},{"alias_kind":"pith_short_8","alias_value":"INOFUY3U","created_at":"2026-07-01T01:18:26.845673+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/INOFUY3UQYDVTPOANXAXP3A6XO","json":"https://pith.science/pith/INOFUY3UQYDVTPOANXAXP3A6XO.json","graph_json":"https://pith.science/api/pith-number/INOFUY3UQYDVTPOANXAXP3A6XO/graph.json","events_json":"https://pith.science/api/pith-number/INOFUY3UQYDVTPOANXAXP3A6XO/events.json","paper":"https://pith.science/paper/INOFUY3U"},"agent_actions":{"view_html":"https://pith.science/pith/INOFUY3UQYDVTPOANXAXP3A6XO","download_json":"https://pith.science/pith/INOFUY3UQYDVTPOANXAXP3A6XO.json","view_paper":"https://pith.science/paper/INOFUY3U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.31952&json=true","fetch_graph":"https://pith.science/api/pith-number/INOFUY3UQYDVTPOANXAXP3A6XO/graph.json","fetch_events":"https://pith.science/api/pith-number/INOFUY3UQYDVTPOANXAXP3A6XO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/INOFUY3UQYDVTPOANXAXP3A6XO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/INOFUY3UQYDVTPOANXAXP3A6XO/action/storage_attestation","attest_author":"https://pith.science/pith/INOFUY3UQYDVTPOANXAXP3A6XO/action/author_attestation","sign_citation":"https://pith.science/pith/INOFUY3UQYDVTPOANXAXP3A6XO/action/citation_signature","submit_replication":"https://pith.science/pith/INOFUY3UQYDVTPOANXAXP3A6XO/action/replication_record"}},"created_at":"2026-07-01T01:18:26.845673+00:00","updated_at":"2026-07-01T01:18:26.845673+00:00"}