{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:OKDXQRDGOD75DVNZS4EHY4SRJD","short_pith_number":"pith:OKDXQRDG","schema_version":"1.0","canonical_sha256":"728778446670ffd1d5b997087c725148d345a12756f9cc6c75cb6b545ebf16b7","source":{"kind":"arxiv","id":"2408.04321","version":2},"attestation_state":"computed","paper":{"title":"Mostly Harmless Methods for QSP-Processing with Laurent Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"S. E. Skelton","submitted_at":"2024-08-08T09:02:01Z","abstract_excerpt":"Quantum signal processing (QSP) and its extensions are increasingly popular frameworks for developing quantum algorithms. Yet QSP implementations still struggle to complete a classical pre-processing step ('QSP-processing') that determines the set of $SU(2)$ rotation matrices defining the QSP circuit. We introduce a method of QSP-processing for complex polynomials that identifies a solution without optimization or root-finding and verify the success of our methods with polynomials characterized by floating point precision coefficients. We demonstrate the success of our technique for relevant t"},"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":"2408.04321","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-08-08T09:02:01Z","cross_cats_sorted":[],"title_canon_sha256":"d5d37db7f72e452ff1385926e148124b24e80dab08cd0d4c5610a61109cab6f4","abstract_canon_sha256":"524629855a217545e42e124082c1a8a761fc9d4cf3c7975c7dccd30fcc54d903"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:14:48.857715Z","signature_b64":"4n9T7kCzoJoLqhwy/9WrspbuZNC+44hmfvyEmKm8R6wNFOAGGMHir3ODO0UDktgrpDspjGRCyDj17uzd8bxFBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"728778446670ffd1d5b997087c725148d345a12756f9cc6c75cb6b545ebf16b7","last_reissued_at":"2026-07-05T11:14:48.857212Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:14:48.857212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mostly Harmless Methods for QSP-Processing with Laurent Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"S. E. Skelton","submitted_at":"2024-08-08T09:02:01Z","abstract_excerpt":"Quantum signal processing (QSP) and its extensions are increasingly popular frameworks for developing quantum algorithms. Yet QSP implementations still struggle to complete a classical pre-processing step ('QSP-processing') that determines the set of $SU(2)$ rotation matrices defining the QSP circuit. We introduce a method of QSP-processing for complex polynomials that identifies a solution without optimization or root-finding and verify the success of our methods with polynomials characterized by floating point precision coefficients. We demonstrate the success of our technique for relevant t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.04321","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/2408.04321/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":"2408.04321","created_at":"2026-07-05T11:14:48.857267+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.04321v2","created_at":"2026-07-05T11:14:48.857267+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.04321","created_at":"2026-07-05T11:14:48.857267+00:00"},{"alias_kind":"pith_short_12","alias_value":"OKDXQRDGOD75","created_at":"2026-07-05T11:14:48.857267+00:00"},{"alias_kind":"pith_short_16","alias_value":"OKDXQRDGOD75DVNZ","created_at":"2026-07-05T11:14:48.857267+00:00"},{"alias_kind":"pith_short_8","alias_value":"OKDXQRDG","created_at":"2026-07-05T11:14:48.857267+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.04285","citing_title":"Progress in the development of quantum algorithms and software","ref_index":87,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OKDXQRDGOD75DVNZS4EHY4SRJD","json":"https://pith.science/pith/OKDXQRDGOD75DVNZS4EHY4SRJD.json","graph_json":"https://pith.science/api/pith-number/OKDXQRDGOD75DVNZS4EHY4SRJD/graph.json","events_json":"https://pith.science/api/pith-number/OKDXQRDGOD75DVNZS4EHY4SRJD/events.json","paper":"https://pith.science/paper/OKDXQRDG"},"agent_actions":{"view_html":"https://pith.science/pith/OKDXQRDGOD75DVNZS4EHY4SRJD","download_json":"https://pith.science/pith/OKDXQRDGOD75DVNZS4EHY4SRJD.json","view_paper":"https://pith.science/paper/OKDXQRDG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.04321&json=true","fetch_graph":"https://pith.science/api/pith-number/OKDXQRDGOD75DVNZS4EHY4SRJD/graph.json","fetch_events":"https://pith.science/api/pith-number/OKDXQRDGOD75DVNZS4EHY4SRJD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OKDXQRDGOD75DVNZS4EHY4SRJD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OKDXQRDGOD75DVNZS4EHY4SRJD/action/storage_attestation","attest_author":"https://pith.science/pith/OKDXQRDGOD75DVNZS4EHY4SRJD/action/author_attestation","sign_citation":"https://pith.science/pith/OKDXQRDGOD75DVNZS4EHY4SRJD/action/citation_signature","submit_replication":"https://pith.science/pith/OKDXQRDGOD75DVNZS4EHY4SRJD/action/replication_record"}},"created_at":"2026-07-05T11:14:48.857267+00:00","updated_at":"2026-07-05T11:14:48.857267+00:00"}