{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:FFYSHYBQECVONMTDDMWPDIALX2","short_pith_number":"pith:FFYSHYBQ","schema_version":"1.0","canonical_sha256":"297123e03020aae6b2631b2cf1a00bbeb509e774e5385a338313cbfbf9399ab0","source":{"kind":"arxiv","id":"2308.01501","version":2},"attestation_state":"computed","paper":{"title":"Generalized Quantum Signal Processing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Danial Motlagh, Nathan Wiebe","submitted_at":"2023-08-03T01:51:52Z","abstract_excerpt":"Quantum Signal Processing (QSP) and Quantum Singular Value Transformation (QSVT) currently stand as the most efficient techniques for implementing functions of block encoded matrices, a central task that lies at the heart of most prominent quantum algorithms. However, current QSP approaches face several challenges, such as the restrictions imposed on the family of achievable polynomials and the difficulty of calculating the required phase angles for specific transformations. In this paper, we present a Generalized Quantum Signal Processing (GQSP) approach, employing general SU(2) rotations as "},"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":"2308.01501","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-08-03T01:51:52Z","cross_cats_sorted":[],"title_canon_sha256":"1842a282f35c50705d02b9c457d2ab26e4dd96c34818cd294902842cd8238681","abstract_canon_sha256":"ec0280148673b113596534a50931425460a5d468217a2d63b21f4a434e1181e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:35:20.048186Z","signature_b64":"CIfPdGzxxIw5TL1+Abzj8D8dgPsK9FdipiJlPYQ7Cy9vqkPFpcJSDKGrXKUor9CMC+s/kptrMWIC87ewekgOAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"297123e03020aae6b2631b2cf1a00bbeb509e774e5385a338313cbfbf9399ab0","last_reissued_at":"2026-07-05T07:35:20.047770Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:35:20.047770Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Quantum Signal Processing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Danial Motlagh, Nathan Wiebe","submitted_at":"2023-08-03T01:51:52Z","abstract_excerpt":"Quantum Signal Processing (QSP) and Quantum Singular Value Transformation (QSVT) currently stand as the most efficient techniques for implementing functions of block encoded matrices, a central task that lies at the heart of most prominent quantum algorithms. However, current QSP approaches face several challenges, such as the restrictions imposed on the family of achievable polynomials and the difficulty of calculating the required phase angles for specific transformations. In this paper, we present a Generalized Quantum Signal Processing (GQSP) approach, employing general SU(2) rotations as "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.01501","kind":"arxiv","version":2},"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/2308.01501/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":"2308.01501","created_at":"2026-07-05T07:35:20.047827+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.01501v2","created_at":"2026-07-05T07:35:20.047827+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.01501","created_at":"2026-07-05T07:35:20.047827+00:00"},{"alias_kind":"pith_short_12","alias_value":"FFYSHYBQECVO","created_at":"2026-07-05T07:35:20.047827+00:00"},{"alias_kind":"pith_short_16","alias_value":"FFYSHYBQECVONMTD","created_at":"2026-07-05T07:35:20.047827+00:00"},{"alias_kind":"pith_short_8","alias_value":"FFYSHYBQ","created_at":"2026-07-05T07:35:20.047827+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07691","citing_title":"Faster quantum linear system solver beyond the condition number","ref_index":34,"is_internal_anchor":true},{"citing_arxiv_id":"2602.19556","citing_title":"Deterministic Ground State Preparation via Power-Cosine Filtering of Time Evolution Operators","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2604.24896","citing_title":"Tightening energy-based boson truncation bound using Monte Carlo-assisted methods","ref_index":185,"is_internal_anchor":false},{"citing_arxiv_id":"2602.22313","citing_title":"Quantum simulation of massive Thirring and Gross--Neveu models for arbitrary number of flavors","ref_index":62,"is_internal_anchor":false},{"citing_arxiv_id":"2604.24896","citing_title":"Tightening energy-based boson truncation bound using Monte Carlo-assisted methods","ref_index":185,"is_internal_anchor":false},{"citing_arxiv_id":"2604.24896","citing_title":"Tightening energy-based boson truncation bound using Monte Carlo-assisted methods","ref_index":185,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FFYSHYBQECVONMTDDMWPDIALX2","json":"https://pith.science/pith/FFYSHYBQECVONMTDDMWPDIALX2.json","graph_json":"https://pith.science/api/pith-number/FFYSHYBQECVONMTDDMWPDIALX2/graph.json","events_json":"https://pith.science/api/pith-number/FFYSHYBQECVONMTDDMWPDIALX2/events.json","paper":"https://pith.science/paper/FFYSHYBQ"},"agent_actions":{"view_html":"https://pith.science/pith/FFYSHYBQECVONMTDDMWPDIALX2","download_json":"https://pith.science/pith/FFYSHYBQECVONMTDDMWPDIALX2.json","view_paper":"https://pith.science/paper/FFYSHYBQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.01501&json=true","fetch_graph":"https://pith.science/api/pith-number/FFYSHYBQECVONMTDDMWPDIALX2/graph.json","fetch_events":"https://pith.science/api/pith-number/FFYSHYBQECVONMTDDMWPDIALX2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FFYSHYBQECVONMTDDMWPDIALX2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FFYSHYBQECVONMTDDMWPDIALX2/action/storage_attestation","attest_author":"https://pith.science/pith/FFYSHYBQECVONMTDDMWPDIALX2/action/author_attestation","sign_citation":"https://pith.science/pith/FFYSHYBQECVONMTDDMWPDIALX2/action/citation_signature","submit_replication":"https://pith.science/pith/FFYSHYBQECVONMTDDMWPDIALX2/action/replication_record"}},"created_at":"2026-07-05T07:35:20.047827+00:00","updated_at":"2026-07-05T07:35:20.047827+00:00"}