{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:KJQQYEZSNN4LAGYPMH4CCCQTRC","short_pith_number":"pith:KJQQYEZS","schema_version":"1.0","canonical_sha256":"52610c13326b78b01b0f61f8210a1388b841b0384abe55cc89fba3ef287466e2","source":{"kind":"arxiv","id":"2312.09072","version":1},"attestation_state":"computed","paper":{"title":"On variants of multivariate quantum signal processing and their characterizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY","math.AG","math.CV"],"primary_cat":"quant-ph","authors_text":"Andr\\'as Gily\\'en, Bal\\'azs N\\'emeth, Blanka K\\\"ov\\'er, Bogl\\'arka Kulcs\\'ar, Roland Botond Mikl\\'osi","submitted_at":"2023-12-14T16:06:58Z","abstract_excerpt":"Quantum signal processing (QSP) is a highly successful algorithmic primitive in quantum computing which leads to conceptually simple and efficient quantum algorithms using the block-encoding framework of quantum linear algebra. Multivariate variants of quantum signal processing (MQSP) could be a valuable tool in extending earlier results via implementing multivariate (matrix) polynomials. However, MQSP remains much less understood than its single-variate version lacking a clear characterization of \"achievable\" multivariate polynomials. We show that Haah's characterization of general univariate"},"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":"2312.09072","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-12-14T16:06:58Z","cross_cats_sorted":["cs.SY","eess.SY","math.AG","math.CV"],"title_canon_sha256":"fad7e2d84565e5ca9f2e281a438acc267f539e325277edc97df58973dfd3ac1d","abstract_canon_sha256":"f71991b0c6be41f1ce87f70afe262dea6bb4641d9f375da30e59ce8eb011bee8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:24:13.956645Z","signature_b64":"9/FqTF1bXvJR9vIV13IXa1lIkIVg+82mz0jks8VZVliiesjni633MyoSqI3ByFSVh79fcnkHZmo9+0RCcJReBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52610c13326b78b01b0f61f8210a1388b841b0384abe55cc89fba3ef287466e2","last_reissued_at":"2026-07-05T07:24:13.956167Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:24:13.956167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On variants of multivariate quantum signal processing and their characterizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY","math.AG","math.CV"],"primary_cat":"quant-ph","authors_text":"Andr\\'as Gily\\'en, Bal\\'azs N\\'emeth, Blanka K\\\"ov\\'er, Bogl\\'arka Kulcs\\'ar, Roland Botond Mikl\\'osi","submitted_at":"2023-12-14T16:06:58Z","abstract_excerpt":"Quantum signal processing (QSP) is a highly successful algorithmic primitive in quantum computing which leads to conceptually simple and efficient quantum algorithms using the block-encoding framework of quantum linear algebra. Multivariate variants of quantum signal processing (MQSP) could be a valuable tool in extending earlier results via implementing multivariate (matrix) polynomials. However, MQSP remains much less understood than its single-variate version lacking a clear characterization of \"achievable\" multivariate polynomials. We show that Haah's characterization of general univariate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.09072","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/2312.09072/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":"2312.09072","created_at":"2026-07-05T07:24:13.956223+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.09072v1","created_at":"2026-07-05T07:24:13.956223+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.09072","created_at":"2026-07-05T07:24:13.956223+00:00"},{"alias_kind":"pith_short_12","alias_value":"KJQQYEZSNN4L","created_at":"2026-07-05T07:24:13.956223+00:00"},{"alias_kind":"pith_short_16","alias_value":"KJQQYEZSNN4LAGYP","created_at":"2026-07-05T07:24:13.956223+00:00"},{"alias_kind":"pith_short_8","alias_value":"KJQQYEZS","created_at":"2026-07-05T07:24:13.956223+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.01843","citing_title":"Low-ancilla block encodings via Hamiltonian simulation","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2410.02332","citing_title":"Polynomial time constructive decision algorithm for multivariable quantum signal processing","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12450","citing_title":"Simulation of Non-Hermitian Hamiltonians with Bivariate Quantum Signal Processing","ref_index":83,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05321","citing_title":"Analytical Angle-Finding and Series Expansions for Quantum Signal Processing via Orthogonal Polynomial Theory","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KJQQYEZSNN4LAGYPMH4CCCQTRC","json":"https://pith.science/pith/KJQQYEZSNN4LAGYPMH4CCCQTRC.json","graph_json":"https://pith.science/api/pith-number/KJQQYEZSNN4LAGYPMH4CCCQTRC/graph.json","events_json":"https://pith.science/api/pith-number/KJQQYEZSNN4LAGYPMH4CCCQTRC/events.json","paper":"https://pith.science/paper/KJQQYEZS"},"agent_actions":{"view_html":"https://pith.science/pith/KJQQYEZSNN4LAGYPMH4CCCQTRC","download_json":"https://pith.science/pith/KJQQYEZSNN4LAGYPMH4CCCQTRC.json","view_paper":"https://pith.science/paper/KJQQYEZS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.09072&json=true","fetch_graph":"https://pith.science/api/pith-number/KJQQYEZSNN4LAGYPMH4CCCQTRC/graph.json","fetch_events":"https://pith.science/api/pith-number/KJQQYEZSNN4LAGYPMH4CCCQTRC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KJQQYEZSNN4LAGYPMH4CCCQTRC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KJQQYEZSNN4LAGYPMH4CCCQTRC/action/storage_attestation","attest_author":"https://pith.science/pith/KJQQYEZSNN4LAGYPMH4CCCQTRC/action/author_attestation","sign_citation":"https://pith.science/pith/KJQQYEZSNN4LAGYPMH4CCCQTRC/action/citation_signature","submit_replication":"https://pith.science/pith/KJQQYEZSNN4LAGYPMH4CCCQTRC/action/replication_record"}},"created_at":"2026-07-05T07:24:13.956223+00:00","updated_at":"2026-07-05T07:24:13.956223+00:00"}