{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:EYUBZDS63XUTVECP6YVH3RTOVB","short_pith_number":"pith:EYUBZDS6","schema_version":"1.0","canonical_sha256":"26281c8e5edde93a904ff62a7dc66ea87c3c7536db60b61dcb4a19d5068243e2","source":{"kind":"arxiv","id":"2410.06409","version":2},"attestation_state":"computed","paper":{"title":"Fast Phase Factor Finding for Quantum Signal Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"quant-ph","authors_text":"Hongkang Ni, Lexing Ying","submitted_at":"2024-10-08T22:42:09Z","abstract_excerpt":"This paper presents two efficient and stable algorithms for recovering phase factors in quantum signal processing (QSP), a crucial component of many quantum algorithms. The first algorithm, the ``Half Cholesky\" method, which is based on nonlinear Fourier analysis and fast solvers for structured matrices, demonstrates robust performance across all regimes. The second algorithm, ``Fast Fixed Point Iteration,\" provides even greater efficiency in the non-fully-coherent regime. Both theoretical analysis and numerical experiments demonstrate the significant advantages of these new methods over all e"},"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":"2410.06409","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-10-08T22:42:09Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"e8e020f73e6f81a6d35066219c5380fc8dbade3a02ecd2d7ded8abfd93e84d4e","abstract_canon_sha256":"531915e12137953b9254baa28c0bf209c1ac9cfd46a3cd017cdd3576ec99c608"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:27:05.549277Z","signature_b64":"F5eAgH1KfBWFgFfpUewm06yK+a3YUJ70tuPKWEUFexFU8GfMc6GkRQEYU/9sQkso2/1SycqizBUw1L593OjFDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26281c8e5edde93a904ff62a7dc66ea87c3c7536db60b61dcb4a19d5068243e2","last_reissued_at":"2026-07-05T09:27:05.548802Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:27:05.548802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Phase Factor Finding for Quantum Signal Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"quant-ph","authors_text":"Hongkang Ni, Lexing Ying","submitted_at":"2024-10-08T22:42:09Z","abstract_excerpt":"This paper presents two efficient and stable algorithms for recovering phase factors in quantum signal processing (QSP), a crucial component of many quantum algorithms. The first algorithm, the ``Half Cholesky\" method, which is based on nonlinear Fourier analysis and fast solvers for structured matrices, demonstrates robust performance across all regimes. The second algorithm, ``Fast Fixed Point Iteration,\" provides even greater efficiency in the non-fully-coherent regime. Both theoretical analysis and numerical experiments demonstrate the significant advantages of these new methods over all e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.06409","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/2410.06409/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":"2410.06409","created_at":"2026-07-05T09:27:05.548864+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.06409v2","created_at":"2026-07-05T09:27:05.548864+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.06409","created_at":"2026-07-05T09:27:05.548864+00:00"},{"alias_kind":"pith_short_12","alias_value":"EYUBZDS63XUT","created_at":"2026-07-05T09:27:05.548864+00:00"},{"alias_kind":"pith_short_16","alias_value":"EYUBZDS63XUTVECP","created_at":"2026-07-05T09:27:05.548864+00:00"},{"alias_kind":"pith_short_8","alias_value":"EYUBZDS6","created_at":"2026-07-05T09:27:05.548864+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.22463","citing_title":"Quantum analog-encoding for correlated Gaussian vectors and their exponentiation with application to rough volatility","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2604.22463","citing_title":"Quantum analog-encoding for correlated Gaussian vectors and their exponentiation with application to rough volatility","ref_index":35,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EYUBZDS63XUTVECP6YVH3RTOVB","json":"https://pith.science/pith/EYUBZDS63XUTVECP6YVH3RTOVB.json","graph_json":"https://pith.science/api/pith-number/EYUBZDS63XUTVECP6YVH3RTOVB/graph.json","events_json":"https://pith.science/api/pith-number/EYUBZDS63XUTVECP6YVH3RTOVB/events.json","paper":"https://pith.science/paper/EYUBZDS6"},"agent_actions":{"view_html":"https://pith.science/pith/EYUBZDS63XUTVECP6YVH3RTOVB","download_json":"https://pith.science/pith/EYUBZDS63XUTVECP6YVH3RTOVB.json","view_paper":"https://pith.science/paper/EYUBZDS6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.06409&json=true","fetch_graph":"https://pith.science/api/pith-number/EYUBZDS63XUTVECP6YVH3RTOVB/graph.json","fetch_events":"https://pith.science/api/pith-number/EYUBZDS63XUTVECP6YVH3RTOVB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EYUBZDS63XUTVECP6YVH3RTOVB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EYUBZDS63XUTVECP6YVH3RTOVB/action/storage_attestation","attest_author":"https://pith.science/pith/EYUBZDS63XUTVECP6YVH3RTOVB/action/author_attestation","sign_citation":"https://pith.science/pith/EYUBZDS63XUTVECP6YVH3RTOVB/action/citation_signature","submit_replication":"https://pith.science/pith/EYUBZDS63XUTVECP6YVH3RTOVB/action/replication_record"}},"created_at":"2026-07-05T09:27:05.548864+00:00","updated_at":"2026-07-05T09:27:05.548864+00:00"}