{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:NTQCW6BJ7ROAP2MQYKAYCNZIK3","short_pith_number":"pith:NTQCW6BJ","schema_version":"1.0","canonical_sha256":"6ce02b7829fc5c07e990c28181372856d1d0e6e81c5102ca1cb5d7fc6a062d3b","source":{"kind":"arxiv","id":"2607.06557","version":1},"attestation_state":"computed","paper":{"title":"Quantum Channel Polynomial Processing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Fedor Simkovic IV, Martin Leib, Tianhan Liu","submitted_at":"2026-07-07T17:57:48Z","abstract_excerpt":"We introduce a quantum algorithmic framework based on probabilistic mixtures of unitary channels that, similar to the framework of quantum singular value transformations, enables the application of arbitrary polynomials of hermitian operators onto arbitrary initial states. We show that our framework supports a flexible tradeoff between sample- and query complexity ranging from optimal query complexity, meaning logarithmic in the error, and exponentially scaling sample complexity to sub-polynomial query complexity in the error and polynomial sample complexity. Combined with the considerably low"},"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":"2607.06557","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-07T17:57:48Z","cross_cats_sorted":[],"title_canon_sha256":"5a59350ceff08b5af9333c57871841fda456d10f889f72f3ee0aa9003b48dddc","abstract_canon_sha256":"2b43deaf22b75ef38024da3ddf6ffb5d8dd1a534b0c3b2cfebf5db86ba57bb8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-08T01:19:29.866621Z","signature_b64":"6b0iV9Zy9WNnfc/yJRsW05L2SEfitLRUiBLGgJ/D/MaWsduQ9hI7Gmb53oN4RiI/hskTUShzR4wULxVp4YMfBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ce02b7829fc5c07e990c28181372856d1d0e6e81c5102ca1cb5d7fc6a062d3b","last_reissued_at":"2026-07-08T01:19:29.866190Z","signature_status":"signed_v1","first_computed_at":"2026-07-08T01:19:29.866190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Channel Polynomial Processing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Fedor Simkovic IV, Martin Leib, Tianhan Liu","submitted_at":"2026-07-07T17:57:48Z","abstract_excerpt":"We introduce a quantum algorithmic framework based on probabilistic mixtures of unitary channels that, similar to the framework of quantum singular value transformations, enables the application of arbitrary polynomials of hermitian operators onto arbitrary initial states. We show that our framework supports a flexible tradeoff between sample- and query complexity ranging from optimal query complexity, meaning logarithmic in the error, and exponentially scaling sample complexity to sub-polynomial query complexity in the error and polynomial sample complexity. Combined with the considerably low"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.06557","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/2607.06557/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":"2607.06557","created_at":"2026-07-08T01:19:29.866244+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.06557v1","created_at":"2026-07-08T01:19:29.866244+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.06557","created_at":"2026-07-08T01:19:29.866244+00:00"},{"alias_kind":"pith_short_12","alias_value":"NTQCW6BJ7ROA","created_at":"2026-07-08T01:19:29.866244+00:00"},{"alias_kind":"pith_short_16","alias_value":"NTQCW6BJ7ROAP2MQ","created_at":"2026-07-08T01:19:29.866244+00:00"},{"alias_kind":"pith_short_8","alias_value":"NTQCW6BJ","created_at":"2026-07-08T01:19:29.866244+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/NTQCW6BJ7ROAP2MQYKAYCNZIK3","json":"https://pith.science/pith/NTQCW6BJ7ROAP2MQYKAYCNZIK3.json","graph_json":"https://pith.science/api/pith-number/NTQCW6BJ7ROAP2MQYKAYCNZIK3/graph.json","events_json":"https://pith.science/api/pith-number/NTQCW6BJ7ROAP2MQYKAYCNZIK3/events.json","paper":"https://pith.science/paper/NTQCW6BJ"},"agent_actions":{"view_html":"https://pith.science/pith/NTQCW6BJ7ROAP2MQYKAYCNZIK3","download_json":"https://pith.science/pith/NTQCW6BJ7ROAP2MQYKAYCNZIK3.json","view_paper":"https://pith.science/paper/NTQCW6BJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.06557&json=true","fetch_graph":"https://pith.science/api/pith-number/NTQCW6BJ7ROAP2MQYKAYCNZIK3/graph.json","fetch_events":"https://pith.science/api/pith-number/NTQCW6BJ7ROAP2MQYKAYCNZIK3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NTQCW6BJ7ROAP2MQYKAYCNZIK3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NTQCW6BJ7ROAP2MQYKAYCNZIK3/action/storage_attestation","attest_author":"https://pith.science/pith/NTQCW6BJ7ROAP2MQYKAYCNZIK3/action/author_attestation","sign_citation":"https://pith.science/pith/NTQCW6BJ7ROAP2MQYKAYCNZIK3/action/citation_signature","submit_replication":"https://pith.science/pith/NTQCW6BJ7ROAP2MQYKAYCNZIK3/action/replication_record"}},"created_at":"2026-07-08T01:19:29.866244+00:00","updated_at":"2026-07-08T01:19:29.866244+00:00"}