{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:452NKDCPO2ENDG3X55VX3VXFTV","short_pith_number":"pith:452NKDCP","schema_version":"1.0","canonical_sha256":"e774d50c4f7688d19b77ef6b7dd6e59d73423b06e9268dadd27f544f2eec6480","source":{"kind":"arxiv","id":"2409.19043","version":2},"attestation_state":"computed","paper":{"title":"Parallel Quantum Signal Processing Via Polynomial Factorization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Isaac L. Chuang, John M. Martyn, Kevin Z. Cheng, Yuan Liu, Zane M. Rossi","submitted_at":"2024-09-27T17:54:30Z","abstract_excerpt":"Quantum signal processing (QSP) is a methodology for constructing polynomial transformations of a linear operator encoded in a unitary. Applied to an encoding of a state $\\rho$, QSP enables the evaluation of nonlinear functions of the form $\\text{tr}(P(\\rho))$ for a polynomial $P(x)$, which encompasses relevant properties like entropies and fidelity. However, QSP is a sequential algorithm: implementing a degree-$d$ polynomial necessitates $d$ queries to the encoding, equating to a query depth $d$. Here, we reduce the depth of these property estimation algorithms by developing Parallel Quantum "},"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":"2409.19043","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-09-27T17:54:30Z","cross_cats_sorted":[],"title_canon_sha256":"8aa71a3ac9ab93f12d64e3cc7b752a932bcc9373bf5ef963bbe137e89cc2ae9f","abstract_canon_sha256":"bcb8470523dfa05482409a322cffd3ffbb78607f79b64e83e9a4426fdc9fe46c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:59:54.005653Z","signature_b64":"Cl1hz8GyaZKdz4wy7BG/dnNzzAy1wNc3tA1wkRilrrH44hDLr0rsDYzR+tOe/dfV/aeVBJ3QxJr3Z3YtNUE1DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e774d50c4f7688d19b77ef6b7dd6e59d73423b06e9268dadd27f544f2eec6480","last_reissued_at":"2026-07-05T11:59:54.005151Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:59:54.005151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Quantum Signal Processing Via Polynomial Factorization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Isaac L. Chuang, John M. Martyn, Kevin Z. Cheng, Yuan Liu, Zane M. Rossi","submitted_at":"2024-09-27T17:54:30Z","abstract_excerpt":"Quantum signal processing (QSP) is a methodology for constructing polynomial transformations of a linear operator encoded in a unitary. Applied to an encoding of a state $\\rho$, QSP enables the evaluation of nonlinear functions of the form $\\text{tr}(P(\\rho))$ for a polynomial $P(x)$, which encompasses relevant properties like entropies and fidelity. However, QSP is a sequential algorithm: implementing a degree-$d$ polynomial necessitates $d$ queries to the encoding, equating to a query depth $d$. Here, we reduce the depth of these property estimation algorithms by developing Parallel Quantum "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.19043","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/2409.19043/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":"2409.19043","created_at":"2026-07-05T11:59:54.005215+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.19043v2","created_at":"2026-07-05T11:59:54.005215+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.19043","created_at":"2026-07-05T11:59:54.005215+00:00"},{"alias_kind":"pith_short_12","alias_value":"452NKDCPO2EN","created_at":"2026-07-05T11:59:54.005215+00:00"},{"alias_kind":"pith_short_16","alias_value":"452NKDCPO2ENDG3X","created_at":"2026-07-05T11:59:54.005215+00:00"},{"alias_kind":"pith_short_8","alias_value":"452NKDCP","created_at":"2026-07-05T11:59:54.005215+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2508.06121","citing_title":"Near-Heisenberg-limited parallel amplitude estimation with logarithmic depth circuit","ref_index":38,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/452NKDCPO2ENDG3X55VX3VXFTV","json":"https://pith.science/pith/452NKDCPO2ENDG3X55VX3VXFTV.json","graph_json":"https://pith.science/api/pith-number/452NKDCPO2ENDG3X55VX3VXFTV/graph.json","events_json":"https://pith.science/api/pith-number/452NKDCPO2ENDG3X55VX3VXFTV/events.json","paper":"https://pith.science/paper/452NKDCP"},"agent_actions":{"view_html":"https://pith.science/pith/452NKDCPO2ENDG3X55VX3VXFTV","download_json":"https://pith.science/pith/452NKDCPO2ENDG3X55VX3VXFTV.json","view_paper":"https://pith.science/paper/452NKDCP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.19043&json=true","fetch_graph":"https://pith.science/api/pith-number/452NKDCPO2ENDG3X55VX3VXFTV/graph.json","fetch_events":"https://pith.science/api/pith-number/452NKDCPO2ENDG3X55VX3VXFTV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/452NKDCPO2ENDG3X55VX3VXFTV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/452NKDCPO2ENDG3X55VX3VXFTV/action/storage_attestation","attest_author":"https://pith.science/pith/452NKDCPO2ENDG3X55VX3VXFTV/action/author_attestation","sign_citation":"https://pith.science/pith/452NKDCPO2ENDG3X55VX3VXFTV/action/citation_signature","submit_replication":"https://pith.science/pith/452NKDCPO2ENDG3X55VX3VXFTV/action/replication_record"}},"created_at":"2026-07-05T11:59:54.005215+00:00","updated_at":"2026-07-05T11:59:54.005215+00:00"}