{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:RJEO4QYDZJA5BYIAMRYUEMHW2I","short_pith_number":"pith:RJEO4QYD","schema_version":"1.0","canonical_sha256":"8a48ee4303ca41d0e10064714230f6d233037c1d6ad93cc5eb817f991474aa11","source":{"kind":"arxiv","id":"2209.14286","version":2},"attestation_state":"computed","paper":{"title":"Complexity-Theoretic Limitations on Quantum Algorithms for Topological Data Analysis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexander Schmidhuber, Seth Lloyd","submitted_at":"2022-09-28T17:53:25Z","abstract_excerpt":"Quantum algorithms for topological data analysis (TDA) seem to provide an exponential advantage over the best classical approach while remaining immune to dequantization procedures and the data-loading problem. In this paper, we give complexity-theoretic evidence that the central task of TDA -- estimating Betti numbers -- is intractable even for quantum computers. Specifically, we prove that the problem of computing Betti numbers exactly is #P-hard, while the problem of approximating Betti numbers up to multiplicative error is NP-hard. Moreover, both problems retain their hardness if restricte"},"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":"2209.14286","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-09-28T17:53:25Z","cross_cats_sorted":[],"title_canon_sha256":"8bf94f9ddd51b1abcca7164366738b29ed6683993c9c363ce9f79984479f724a","abstract_canon_sha256":"a99f4b2d896f69c9a98483ed099208aea753ebf6c9a9a6e6d2817341930c8ab6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:30:44.757236Z","signature_b64":"vY7eLU/BtPEXJ2tyyo45JCi2BJog4qZCiMNEy8Ox15ss8NHtb6YKLNgPk5I9LMTtQrLoSMu2wjFVk4fs+wOzAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a48ee4303ca41d0e10064714230f6d233037c1d6ad93cc5eb817f991474aa11","last_reissued_at":"2026-07-05T07:30:44.756733Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:30:44.756733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity-Theoretic Limitations on Quantum Algorithms for Topological Data Analysis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexander Schmidhuber, Seth Lloyd","submitted_at":"2022-09-28T17:53:25Z","abstract_excerpt":"Quantum algorithms for topological data analysis (TDA) seem to provide an exponential advantage over the best classical approach while remaining immune to dequantization procedures and the data-loading problem. In this paper, we give complexity-theoretic evidence that the central task of TDA -- estimating Betti numbers -- is intractable even for quantum computers. Specifically, we prove that the problem of computing Betti numbers exactly is #P-hard, while the problem of approximating Betti numbers up to multiplicative error is NP-hard. Moreover, both problems retain their hardness if restricte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.14286","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/2209.14286/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":"2209.14286","created_at":"2026-07-05T07:30:44.756791+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.14286v2","created_at":"2026-07-05T07:30:44.756791+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.14286","created_at":"2026-07-05T07:30:44.756791+00:00"},{"alias_kind":"pith_short_12","alias_value":"RJEO4QYDZJA5","created_at":"2026-07-05T07:30:44.756791+00:00"},{"alias_kind":"pith_short_16","alias_value":"RJEO4QYDZJA5BYIA","created_at":"2026-07-05T07:30:44.756791+00:00"},{"alias_kind":"pith_short_8","alias_value":"RJEO4QYD","created_at":"2026-07-05T07:30:44.756791+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.28927","citing_title":"Quantum encodings that preserve persistent homology","ref_index":195,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RJEO4QYDZJA5BYIAMRYUEMHW2I","json":"https://pith.science/pith/RJEO4QYDZJA5BYIAMRYUEMHW2I.json","graph_json":"https://pith.science/api/pith-number/RJEO4QYDZJA5BYIAMRYUEMHW2I/graph.json","events_json":"https://pith.science/api/pith-number/RJEO4QYDZJA5BYIAMRYUEMHW2I/events.json","paper":"https://pith.science/paper/RJEO4QYD"},"agent_actions":{"view_html":"https://pith.science/pith/RJEO4QYDZJA5BYIAMRYUEMHW2I","download_json":"https://pith.science/pith/RJEO4QYDZJA5BYIAMRYUEMHW2I.json","view_paper":"https://pith.science/paper/RJEO4QYD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.14286&json=true","fetch_graph":"https://pith.science/api/pith-number/RJEO4QYDZJA5BYIAMRYUEMHW2I/graph.json","fetch_events":"https://pith.science/api/pith-number/RJEO4QYDZJA5BYIAMRYUEMHW2I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RJEO4QYDZJA5BYIAMRYUEMHW2I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RJEO4QYDZJA5BYIAMRYUEMHW2I/action/storage_attestation","attest_author":"https://pith.science/pith/RJEO4QYDZJA5BYIAMRYUEMHW2I/action/author_attestation","sign_citation":"https://pith.science/pith/RJEO4QYDZJA5BYIAMRYUEMHW2I/action/citation_signature","submit_replication":"https://pith.science/pith/RJEO4QYDZJA5BYIAMRYUEMHW2I/action/replication_record"}},"created_at":"2026-07-05T07:30:44.756791+00:00","updated_at":"2026-07-05T07:30:44.756791+00:00"}