{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:RJEO4QYDZJA5BYIAMRYUEMHW2I","short_pith_number":"pith:RJEO4QYD","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"},"canonical_sha256":"8a48ee4303ca41d0e10064714230f6d233037c1d6ad93cc5eb817f991474aa11","source":{"kind":"arxiv","id":"2209.14286","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.14286","created_at":"2026-07-05T07:30:44Z"},{"alias_kind":"arxiv_version","alias_value":"2209.14286v2","created_at":"2026-07-05T07:30:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.14286","created_at":"2026-07-05T07:30:44Z"},{"alias_kind":"pith_short_12","alias_value":"RJEO4QYDZJA5","created_at":"2026-07-05T07:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"RJEO4QYDZJA5BYIA","created_at":"2026-07-05T07:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"RJEO4QYD","created_at":"2026-07-05T07:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:RJEO4QYDZJA5BYIAMRYUEMHW2I","target":"record","payload":{"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"},"canonical_sha256":"8a48ee4303ca41d0e10064714230f6d233037c1d6ad93cc5eb817f991474aa11","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"},"source_kind":"arxiv","source_id":"2209.14286","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:30:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DGPapFrArZi7UBy/WKn1fOyY6w6ebCNa96gWAoX4xqTSKdPdpRNEf/Cxk4HJ0u9WuFi2ACSHX1ErGA0AzUy1Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T12:05:27.104616Z"},"content_sha256":"83a96b16d120c01e9968bb345ddcdb691c1be0ffb8e087752ea919ef0d30bbdd","schema_version":"1.0","event_id":"sha256:83a96b16d120c01e9968bb345ddcdb691c1be0ffb8e087752ea919ef0d30bbdd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:RJEO4QYDZJA5BYIAMRYUEMHW2I","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:30:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tpfivb6nwSSTo1OSVxZezWRtPPhiEvGxQzDeNFE46+OUeLiH3k0TxfnNxWKqYrlUrS3Fg2QiKddbx6UXNev+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T12:05:27.105227Z"},"content_sha256":"f7ef5a1874664bd3f7ed19504bf06716c540da86504de4f8bb63d5e0be9ecb4d","schema_version":"1.0","event_id":"sha256:f7ef5a1874664bd3f7ed19504bf06716c540da86504de4f8bb63d5e0be9ecb4d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RJEO4QYDZJA5BYIAMRYUEMHW2I/bundle.json","state_url":"https://pith.science/pith/RJEO4QYDZJA5BYIAMRYUEMHW2I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RJEO4QYDZJA5BYIAMRYUEMHW2I/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-16T12:05:27Z","links":{"resolver":"https://pith.science/pith/RJEO4QYDZJA5BYIAMRYUEMHW2I","bundle":"https://pith.science/pith/RJEO4QYDZJA5BYIAMRYUEMHW2I/bundle.json","state":"https://pith.science/pith/RJEO4QYDZJA5BYIAMRYUEMHW2I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RJEO4QYDZJA5BYIAMRYUEMHW2I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:RJEO4QYDZJA5BYIAMRYUEMHW2I","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a99f4b2d896f69c9a98483ed099208aea753ebf6c9a9a6e6d2817341930c8ab6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-09-28T17:53:25Z","title_canon_sha256":"8bf94f9ddd51b1abcca7164366738b29ed6683993c9c363ce9f79984479f724a"},"schema_version":"1.0","source":{"id":"2209.14286","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.14286","created_at":"2026-07-05T07:30:44Z"},{"alias_kind":"arxiv_version","alias_value":"2209.14286v2","created_at":"2026-07-05T07:30:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.14286","created_at":"2026-07-05T07:30:44Z"},{"alias_kind":"pith_short_12","alias_value":"RJEO4QYDZJA5","created_at":"2026-07-05T07:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"RJEO4QYDZJA5BYIA","created_at":"2026-07-05T07:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"RJEO4QYD","created_at":"2026-07-05T07:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:f7ef5a1874664bd3f7ed19504bf06716c540da86504de4f8bb63d5e0be9ecb4d","target":"graph","created_at":"2026-07-05T07:30:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2209.14286/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alexander Schmidhuber, Seth Lloyd","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-09-28T17:53:25Z","title":"Complexity-Theoretic Limitations on Quantum Algorithms for Topological Data Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.14286","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:83a96b16d120c01e9968bb345ddcdb691c1be0ffb8e087752ea919ef0d30bbdd","target":"record","created_at":"2026-07-05T07:30:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a99f4b2d896f69c9a98483ed099208aea753ebf6c9a9a6e6d2817341930c8ab6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-09-28T17:53:25Z","title_canon_sha256":"8bf94f9ddd51b1abcca7164366738b29ed6683993c9c363ce9f79984479f724a"},"schema_version":"1.0","source":{"id":"2209.14286","kind":"arxiv","version":2}},"canonical_sha256":"8a48ee4303ca41d0e10064714230f6d233037c1d6ad93cc5eb817f991474aa11","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a48ee4303ca41d0e10064714230f6d233037c1d6ad93cc5eb817f991474aa11","first_computed_at":"2026-07-05T07:30:44.756733Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:30:44.756733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vY7eLU/BtPEXJ2tyyo45JCi2BJog4qZCiMNEy8Ox15ss8NHtb6YKLNgPk5I9LMTtQrLoSMu2wjFVk4fs+wOzAA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:30:44.757236Z","signed_message":"canonical_sha256_bytes"},"source_id":"2209.14286","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83a96b16d120c01e9968bb345ddcdb691c1be0ffb8e087752ea919ef0d30bbdd","sha256:f7ef5a1874664bd3f7ed19504bf06716c540da86504de4f8bb63d5e0be9ecb4d"],"state_sha256":"0c6e266272e3d430dea584d38a57de4628efb84da482df678b0bb195300b1320"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3PewmoZH/0e+jplHNMIFhSsu7LCoPrAORFtugXydMaeHdfGTwZTjtBXGEYo32Ky0M7VLqagGsVo0dawPsLwZBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T12:05:27.110375Z","bundle_sha256":"e59a8675db7327f88fb54f9b738687e3d3605ca9a849cab56860ddfba6b7715b"}}