{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:55YE7GNBKZALMYZJUIHIN2HOOU","short_pith_number":"pith:55YE7GNB","schema_version":"1.0","canonical_sha256":"ef704f99a15640b66329a20e86e8ee751ba3bf2d9c693ad21885da3eff82f3d5","source":{"kind":"arxiv","id":"2411.03230","version":2},"attestation_state":"computed","paper":{"title":"Fermionic Independent Set and Laplacian of an independence complex are QMA-hard","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Chaithanya Rayudu","submitted_at":"2024-11-05T16:21:48Z","abstract_excerpt":"The Independent Set is a well known NP-hard optimization problem. In this work, we define a fermionic generalization of the Independent Set problem and prove that the optimization problem is QMA-hard in a $k$-particle subspace using perturbative gadgets. We discuss how the Fermionic Independent Set is related to the problem of computing the minimum eigenvalue of the $k^{\\text{th}}$-Laplacian of an independence complex of a vertex weighted graph. Consequently, we use the same perturbative gadget to prove QMA-hardness of the later problem resolving an open conjecture from arXiv:2311.17234 and gi"},"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":"2411.03230","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-11-05T16:21:48Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"1c0880963c62e3458f69bb9f3fedd4f05b046d5e0a24e4c2dca49013ea2d6f25","abstract_canon_sha256":"844adcb2b2a0e046138ccf4900c955c9507ddd706246bc8ca89aa4ecb3c5395a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:15:18.028260Z","signature_b64":"wqxYGP4tp9HkzIh1IoQ176SaysFV10u7gbbvcmlYHi+CIWOpweRNhYEBHcxHC2gzHIqxAyEXMWS5a0KdXNdcBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef704f99a15640b66329a20e86e8ee751ba3bf2d9c693ad21885da3eff82f3d5","last_reissued_at":"2026-07-05T11:15:18.027724Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:15:18.027724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fermionic Independent Set and Laplacian of an independence complex are QMA-hard","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Chaithanya Rayudu","submitted_at":"2024-11-05T16:21:48Z","abstract_excerpt":"The Independent Set is a well known NP-hard optimization problem. In this work, we define a fermionic generalization of the Independent Set problem and prove that the optimization problem is QMA-hard in a $k$-particle subspace using perturbative gadgets. We discuss how the Fermionic Independent Set is related to the problem of computing the minimum eigenvalue of the $k^{\\text{th}}$-Laplacian of an independence complex of a vertex weighted graph. Consequently, we use the same perturbative gadget to prove QMA-hardness of the later problem resolving an open conjecture from arXiv:2311.17234 and gi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.03230","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/2411.03230/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":"2411.03230","created_at":"2026-07-05T11:15:18.027785+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.03230v2","created_at":"2026-07-05T11:15:18.027785+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.03230","created_at":"2026-07-05T11:15:18.027785+00:00"},{"alias_kind":"pith_short_12","alias_value":"55YE7GNBKZAL","created_at":"2026-07-05T11:15:18.027785+00:00"},{"alias_kind":"pith_short_16","alias_value":"55YE7GNBKZALMYZJ","created_at":"2026-07-05T11:15:18.027785+00:00"},{"alias_kind":"pith_short_8","alias_value":"55YE7GNB","created_at":"2026-07-05T11:15:18.027785+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2505.18396","citing_title":"The Lie Algebra of XY-mixer Topologies and Warm Starting QAOA for Constrained Optimization","ref_index":79,"is_internal_anchor":false},{"citing_arxiv_id":"2506.01432","citing_title":"New aspects of quantum topological data analysis: Betti number estimation, and testing and tracking of homology and cohomology classes","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/55YE7GNBKZALMYZJUIHIN2HOOU","json":"https://pith.science/pith/55YE7GNBKZALMYZJUIHIN2HOOU.json","graph_json":"https://pith.science/api/pith-number/55YE7GNBKZALMYZJUIHIN2HOOU/graph.json","events_json":"https://pith.science/api/pith-number/55YE7GNBKZALMYZJUIHIN2HOOU/events.json","paper":"https://pith.science/paper/55YE7GNB"},"agent_actions":{"view_html":"https://pith.science/pith/55YE7GNBKZALMYZJUIHIN2HOOU","download_json":"https://pith.science/pith/55YE7GNBKZALMYZJUIHIN2HOOU.json","view_paper":"https://pith.science/paper/55YE7GNB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.03230&json=true","fetch_graph":"https://pith.science/api/pith-number/55YE7GNBKZALMYZJUIHIN2HOOU/graph.json","fetch_events":"https://pith.science/api/pith-number/55YE7GNBKZALMYZJUIHIN2HOOU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/55YE7GNBKZALMYZJUIHIN2HOOU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/55YE7GNBKZALMYZJUIHIN2HOOU/action/storage_attestation","attest_author":"https://pith.science/pith/55YE7GNBKZALMYZJUIHIN2HOOU/action/author_attestation","sign_citation":"https://pith.science/pith/55YE7GNBKZALMYZJUIHIN2HOOU/action/citation_signature","submit_replication":"https://pith.science/pith/55YE7GNBKZALMYZJUIHIN2HOOU/action/replication_record"}},"created_at":"2026-07-05T11:15:18.027785+00:00","updated_at":"2026-07-05T11:15:18.027785+00:00"}