{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:AAI2VJZTM73XPDYMYFGNJ6W64S","short_pith_number":"pith:AAI2VJZT","schema_version":"1.0","canonical_sha256":"0011aaa73367f7778f0cc14cd4fadee48ff71383d6a95d523036052024caf8af","source":{"kind":"arxiv","id":"2503.03026","version":2},"attestation_state":"computed","paper":{"title":"Generalized Quantum Signal Processing and Non-Linear Fourier Transform are equivalent","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Lorenzo Laneve","submitted_at":"2025-03-04T22:02:38Z","abstract_excerpt":"Quantum signal processing (QSP) and quantum singular value transformation (QSVT) are powerful techniques for the development of quantum procedures. They allow to derive circuits preparing desired polynomial transformations. Recent research [Alexis et al. 2024] showed that Non-Linear Fourier Analysis (NLFA) can be employed to numerically compute a QSP protocol, with provable stability. In this work we extend their result, showing that GQSP and the Non-Linear Fourier Transform over $SU(2)$ are the same object. This statement - proven by a simple argument - has a bunch of consequences: first, the"},"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":"2503.03026","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-03-04T22:02:38Z","cross_cats_sorted":[],"title_canon_sha256":"a74b5520eea22a4efc946477f04bbcd5518b5d196fef58039d8bb2c435cfd963","abstract_canon_sha256":"44964cbdfa817619fddf445e26f38ff6ce2c1c7ab46221e3bf4b5ad1840cf412"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:31:05.464460Z","signature_b64":"qC+SjefiQODGx/sLM6cJGZ3RVsP3yfuqy50O2nsZKbFGkRjMV+fJsIfNMiWcFZbyenQrlbc28YZ3AIz6XBHEAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0011aaa73367f7778f0cc14cd4fadee48ff71383d6a95d523036052024caf8af","last_reissued_at":"2026-07-05T11:31:05.463864Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:31:05.463864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Quantum Signal Processing and Non-Linear Fourier Transform are equivalent","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Lorenzo Laneve","submitted_at":"2025-03-04T22:02:38Z","abstract_excerpt":"Quantum signal processing (QSP) and quantum singular value transformation (QSVT) are powerful techniques for the development of quantum procedures. They allow to derive circuits preparing desired polynomial transformations. Recent research [Alexis et al. 2024] showed that Non-Linear Fourier Analysis (NLFA) can be employed to numerically compute a QSP protocol, with provable stability. In this work we extend their result, showing that GQSP and the Non-Linear Fourier Transform over $SU(2)$ are the same object. This statement - proven by a simple argument - has a bunch of consequences: first, the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.03026","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/2503.03026/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":"2503.03026","created_at":"2026-07-05T11:31:05.463934+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.03026v2","created_at":"2026-07-05T11:31:05.463934+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.03026","created_at":"2026-07-05T11:31:05.463934+00:00"},{"alias_kind":"pith_short_12","alias_value":"AAI2VJZTM73X","created_at":"2026-07-05T11:31:05.463934+00:00"},{"alias_kind":"pith_short_16","alias_value":"AAI2VJZTM73XPDYM","created_at":"2026-07-05T11:31:05.463934+00:00"},{"alias_kind":"pith_short_8","alias_value":"AAI2VJZT","created_at":"2026-07-05T11:31:05.463934+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.18276","citing_title":"Block-encodings as programming abstractions: The Eclipse Qrisp BlockEncoding Interface","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19688","citing_title":"Quantum Eigenvalue Transformations for Arbitrary Matrices","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AAI2VJZTM73XPDYMYFGNJ6W64S","json":"https://pith.science/pith/AAI2VJZTM73XPDYMYFGNJ6W64S.json","graph_json":"https://pith.science/api/pith-number/AAI2VJZTM73XPDYMYFGNJ6W64S/graph.json","events_json":"https://pith.science/api/pith-number/AAI2VJZTM73XPDYMYFGNJ6W64S/events.json","paper":"https://pith.science/paper/AAI2VJZT"},"agent_actions":{"view_html":"https://pith.science/pith/AAI2VJZTM73XPDYMYFGNJ6W64S","download_json":"https://pith.science/pith/AAI2VJZTM73XPDYMYFGNJ6W64S.json","view_paper":"https://pith.science/paper/AAI2VJZT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.03026&json=true","fetch_graph":"https://pith.science/api/pith-number/AAI2VJZTM73XPDYMYFGNJ6W64S/graph.json","fetch_events":"https://pith.science/api/pith-number/AAI2VJZTM73XPDYMYFGNJ6W64S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AAI2VJZTM73XPDYMYFGNJ6W64S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AAI2VJZTM73XPDYMYFGNJ6W64S/action/storage_attestation","attest_author":"https://pith.science/pith/AAI2VJZTM73XPDYMYFGNJ6W64S/action/author_attestation","sign_citation":"https://pith.science/pith/AAI2VJZTM73XPDYMYFGNJ6W64S/action/citation_signature","submit_replication":"https://pith.science/pith/AAI2VJZTM73XPDYMYFGNJ6W64S/action/replication_record"}},"created_at":"2026-07-05T11:31:05.463934+00:00","updated_at":"2026-07-05T11:31:05.463934+00:00"}