{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LPZEZAFK4QKQYZQWDX37BGMCIX","short_pith_number":"pith:LPZEZAFK","schema_version":"1.0","canonical_sha256":"5bf24c80aae4150c66161df7f0998245c30cf5d07191afb3260518d1cd51a085","source":{"kind":"arxiv","id":"2510.06385","version":3},"attestation_state":"computed","paper":{"title":"Fourier Spectrum of Noisy Quantum Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Uma Girish","submitted_at":"2025-10-07T19:07:59Z","abstract_excerpt":"Quantum computing promises exponential speedups for certain problems, yet fully universal quantum computers remain out of reach and near-term devices are inherently noisy. Motivated by this, we study noisy quantum algorithms and the landscape between $\\mathsf{BQP}$ and $\\mathsf{BPP}$. We build on a powerful technique to differentiate quantum and classical algorithms called the level-$\\ell$ Fourier growth (the sum of absolute values of Fourier coefficients of sets of size $\\ell$) and show that it can also be used to differentiate quantum algorithms based on the types of resources used. We show "},"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":"2510.06385","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-10-07T19:07:59Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"9b4dccba1ffe13654e82d64d48bbb9905d93b1941c2fbb9d57df3110e1db2086","abstract_canon_sha256":"1ea4a928e3376ba1a6593eac974e312bb2a4e1412f8650f081172837a4fb2871"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T01:11:57.729053Z","signature_b64":"Esp8pl7z7eP8E8eI+xcvnAIwyYIU1XKY+psO+LX/NbZFyNigog7Fv2oY25/NLwpmIyhW8ZQWgzo+svRTuzjfCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bf24c80aae4150c66161df7f0998245c30cf5d07191afb3260518d1cd51a085","last_reissued_at":"2026-06-23T01:11:57.728518Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T01:11:57.728518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fourier Spectrum of Noisy Quantum Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Uma Girish","submitted_at":"2025-10-07T19:07:59Z","abstract_excerpt":"Quantum computing promises exponential speedups for certain problems, yet fully universal quantum computers remain out of reach and near-term devices are inherently noisy. Motivated by this, we study noisy quantum algorithms and the landscape between $\\mathsf{BQP}$ and $\\mathsf{BPP}$. We build on a powerful technique to differentiate quantum and classical algorithms called the level-$\\ell$ Fourier growth (the sum of absolute values of Fourier coefficients of sets of size $\\ell$) and show that it can also be used to differentiate quantum algorithms based on the types of resources used. We show "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.06385","kind":"arxiv","version":3},"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/2510.06385/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":"2510.06385","created_at":"2026-06-23T01:11:57.728586+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.06385v3","created_at":"2026-06-23T01:11:57.728586+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.06385","created_at":"2026-06-23T01:11:57.728586+00:00"},{"alias_kind":"pith_short_12","alias_value":"LPZEZAFK4QKQ","created_at":"2026-06-23T01:11:57.728586+00:00"},{"alias_kind":"pith_short_16","alias_value":"LPZEZAFK4QKQYZQW","created_at":"2026-06-23T01:11:57.728586+00:00"},{"alias_kind":"pith_short_8","alias_value":"LPZEZAFK","created_at":"2026-06-23T01:11:57.728586+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2511.17227","citing_title":"A Lifting Theorem for Hybrid Classical-Quantum Communication Complexity","ref_index":6,"is_internal_anchor":true},{"citing_arxiv_id":"2604.15248","citing_title":"IQP circuits for 2-Forrelation","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LPZEZAFK4QKQYZQWDX37BGMCIX","json":"https://pith.science/pith/LPZEZAFK4QKQYZQWDX37BGMCIX.json","graph_json":"https://pith.science/api/pith-number/LPZEZAFK4QKQYZQWDX37BGMCIX/graph.json","events_json":"https://pith.science/api/pith-number/LPZEZAFK4QKQYZQWDX37BGMCIX/events.json","paper":"https://pith.science/paper/LPZEZAFK"},"agent_actions":{"view_html":"https://pith.science/pith/LPZEZAFK4QKQYZQWDX37BGMCIX","download_json":"https://pith.science/pith/LPZEZAFK4QKQYZQWDX37BGMCIX.json","view_paper":"https://pith.science/paper/LPZEZAFK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.06385&json=true","fetch_graph":"https://pith.science/api/pith-number/LPZEZAFK4QKQYZQWDX37BGMCIX/graph.json","fetch_events":"https://pith.science/api/pith-number/LPZEZAFK4QKQYZQWDX37BGMCIX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LPZEZAFK4QKQYZQWDX37BGMCIX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LPZEZAFK4QKQYZQWDX37BGMCIX/action/storage_attestation","attest_author":"https://pith.science/pith/LPZEZAFK4QKQYZQWDX37BGMCIX/action/author_attestation","sign_citation":"https://pith.science/pith/LPZEZAFK4QKQYZQWDX37BGMCIX/action/citation_signature","submit_replication":"https://pith.science/pith/LPZEZAFK4QKQYZQWDX37BGMCIX/action/replication_record"}},"created_at":"2026-06-23T01:11:57.728586+00:00","updated_at":"2026-06-23T01:11:57.728586+00:00"}