{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:7BFAP66TTFVVFCBRRCXWPJWAQY","short_pith_number":"pith:7BFAP66T","schema_version":"1.0","canonical_sha256":"f84a07fbd3996b52883188af67a6c086223797ccfb57f29eada0e22a18649314","source":{"kind":"arxiv","id":"2605.12656","version":1},"attestation_state":"computed","paper":{"title":"Optimal Bounds, Barriers, and Extensions for Non-Hermitian Bivariate Quantum Signal Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Bivariate quantum signal processing establishes a tight query complexity of Θ(β_I T + log(1/ε)/log log(1/ε)) for anti-Hermitian Hamiltonian simulation.","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Joshua M. Courtney","submitted_at":"2026-05-12T19:03:36Z","abstract_excerpt":"Multivariate quantum signal processing (M-QSP) has recently been shown to be applicable for non-Hermitian Hamiltonian simulation, opening several problems regarding the optimization landscape, angle-finding, and constant-factor analysis. We resolve several of these problems here. We find the anti-Hermitian query complexity $d_I = \\Theta(\\betaI T + \\log(1/\\varepsilon)/\\log\\log(1/\\varepsilon))$ to be tight, established via Chebyshev coefficient bounds, modified Bessel function asymptotics, and Lambert~$W$ inversion. Fast-forwarding to $d_I = \\mathcal{O}(\\sqrt{\\betaI T})$ is impossible in the biv"},"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":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.12656","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-12T19:03:36Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"81d6a2fa1aa4c5b555d464e453d33aa1930b71a0e42d515f97eef982e81ecab4","abstract_canon_sha256":"6045dd74df55ec8d7f7da502dbfafbe5f2951342b19c66011fcc4647972e7b65"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:50.627412Z","signature_b64":"Zk3M3HhwVzeua/xlnFOXdUlqINZA0rzPcQChhYaKzKpvu0pq7ufVisNzyucXLNJWKZACzneVMqswnFBZIq1sBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f84a07fbd3996b52883188af67a6c086223797ccfb57f29eada0e22a18649314","last_reissued_at":"2026-05-18T03:09:50.626661Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:50.626661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Bounds, Barriers, and Extensions for Non-Hermitian Bivariate Quantum Signal Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Bivariate quantum signal processing establishes a tight query complexity of Θ(β_I T + log(1/ε)/log log(1/ε)) for anti-Hermitian Hamiltonian simulation.","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Joshua M. Courtney","submitted_at":"2026-05-12T19:03:36Z","abstract_excerpt":"Multivariate quantum signal processing (M-QSP) has recently been shown to be applicable for non-Hermitian Hamiltonian simulation, opening several problems regarding the optimization landscape, angle-finding, and constant-factor analysis. We resolve several of these problems here. We find the anti-Hermitian query complexity $d_I = \\Theta(\\betaI T + \\log(1/\\varepsilon)/\\log\\log(1/\\varepsilon))$ to be tight, established via Chebyshev coefficient bounds, modified Bessel function asymptotics, and Lambert~$W$ inversion. Fast-forwarding to $d_I = \\mathcal{O}(\\sqrt{\\betaI T})$ is impossible in the biv"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We find the anti-Hermitian query complexity d_I = Θ(β_I T + log(1/ε)/log log(1/ε)) to be tight, established via Chebyshev coefficient bounds, modified Bessel function asymptotics, and Lambert W inversion.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The bivariate polynomial model and walk-operator oracle model assumptions continue to apply without modification to the non-Hermitian setting and that the constant-ratio condition extends to non-identical signal operators.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Tight anti-Hermitian query complexity d_I = Θ(β_I T + log(1/ε)/log log(1/ε)) is established for non-Hermitian M-QSP, with impossibility of √(β_I T) fast-forwarding, new angle-finding algorithms, and extensions to time-dependent cases.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Bivariate quantum signal processing establishes a tight query complexity of Θ(β_I T + log(1/ε)/log log(1/ε)) for anti-Hermitian Hamiltonian simulation.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"944996f23a8620ace1863c1b1afd5942097d5fcccc82f17d2dc9ff012455f896"},"source":{"id":"2605.12656","kind":"arxiv","version":1},"verdict":{"id":"d8110df5-4f00-4d96-b8c0-b39b929cae14","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T20:17:45.022815Z","strongest_claim":"We find the anti-Hermitian query complexity d_I = Θ(β_I T + log(1/ε)/log log(1/ε)) to be tight, established via Chebyshev coefficient bounds, modified Bessel function asymptotics, and Lambert W inversion.","one_line_summary":"Tight anti-Hermitian query complexity d_I = Θ(β_I T + log(1/ε)/log log(1/ε)) is established for non-Hermitian M-QSP, with impossibility of √(β_I T) fast-forwarding, new angle-finding algorithms, and extensions to time-dependent cases.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The bivariate polynomial model and walk-operator oracle model assumptions continue to apply without modification to the non-Hermitian setting and that the constant-ratio condition extends to non-identical signal operators.","pith_extraction_headline":"Bivariate quantum signal processing establishes a tight query complexity of Θ(β_I T + log(1/ε)/log log(1/ε)) for anti-Hermitian Hamiltonian simulation."},"references":{"count":48,"sample":[{"doi":"","year":null,"title":"Standard recursive:O(d·d R ·d I) =O(d 3)","work_id":"3cf8e6f1-2753-49c5-a17e-167243e62c1f","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"CRC-exploiting block peeling:O(dR ·d I) =O(d 2)","work_id":"23e6884e-3587-4126-9026-45ebeb29378e","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"ap- proximately2","work_id":"02db4a62-8830-442d-b522-2f2115d37e14","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"The warm-start basin guarantee (Theorem 10) requires a full-rank Jacobian, and the analytical basin radius de- cays polynomially with degree asρ analytical ∼d −4.62 (Eq","work_id":"f5152b39-36a5-4076-9bdf-12102436de2f","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Direct-access polynomial construction.A poly- nomial designed ab initio for the direct-access model that achievesλ=e ωT (1 +o(1))on the full bitorus (Problem 42) would establish exponential advantage ","work_id":"cac23478-fd4e-4a63-a260-31063398e060","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":48,"snapshot_sha256":"46ff21561e160a104da89fb271b3498b1500a68ad93dc82fbd25c60744a66bc0","internal_anchors":1},"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":"2605.12656","created_at":"2026-05-18T03:09:50.626774+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.12656v1","created_at":"2026-05-18T03:09:50.626774+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12656","created_at":"2026-05-18T03:09:50.626774+00:00"},{"alias_kind":"pith_short_12","alias_value":"7BFAP66TTFVV","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"7BFAP66TTFVVFCBR","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"7BFAP66T","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7BFAP66TTFVVFCBRRCXWPJWAQY","json":"https://pith.science/pith/7BFAP66TTFVVFCBRRCXWPJWAQY.json","graph_json":"https://pith.science/api/pith-number/7BFAP66TTFVVFCBRRCXWPJWAQY/graph.json","events_json":"https://pith.science/api/pith-number/7BFAP66TTFVVFCBRRCXWPJWAQY/events.json","paper":"https://pith.science/paper/7BFAP66T"},"agent_actions":{"view_html":"https://pith.science/pith/7BFAP66TTFVVFCBRRCXWPJWAQY","download_json":"https://pith.science/pith/7BFAP66TTFVVFCBRRCXWPJWAQY.json","view_paper":"https://pith.science/paper/7BFAP66T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.12656&json=true","fetch_graph":"https://pith.science/api/pith-number/7BFAP66TTFVVFCBRRCXWPJWAQY/graph.json","fetch_events":"https://pith.science/api/pith-number/7BFAP66TTFVVFCBRRCXWPJWAQY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7BFAP66TTFVVFCBRRCXWPJWAQY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7BFAP66TTFVVFCBRRCXWPJWAQY/action/storage_attestation","attest_author":"https://pith.science/pith/7BFAP66TTFVVFCBRRCXWPJWAQY/action/author_attestation","sign_citation":"https://pith.science/pith/7BFAP66TTFVVFCBRRCXWPJWAQY/action/citation_signature","submit_replication":"https://pith.science/pith/7BFAP66TTFVVFCBRRCXWPJWAQY/action/replication_record"}},"created_at":"2026-05-18T03:09:50.626774+00:00","updated_at":"2026-05-18T03:09:50.626774+00:00"}