{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:IOE7LTOHLRYDLUEWZVXQMHMXMC","short_pith_number":"pith:IOE7LTOH","schema_version":"1.0","canonical_sha256":"4389f5cdc75c7035d096cd6f061d9760885951826c677c468f507f94331129ce","source":{"kind":"arxiv","id":"0906.5416","version":1},"attestation_state":"computed","paper":{"title":"Non-Identity Check Remains QMA-Complete for Short Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Xiaodi Wu, Zhengfeng Ji","submitted_at":"2009-06-30T06:11:22Z","abstract_excerpt":"The Non-Identity Check problem asks whether a given a quantum circuit is far away from the identity or not. It is well known that this problem is QMA-Complete \\cite{JWB05}. In this note, it is shown that the Non-Identity Check problem remains QMA-Complete for circuits of short depth. Specifically, we prove that for constant depth quantum circuit in which each gate is given to at least $\\Omega(\\log n)$ bits of precision, the Non-Identity Check problem is QMA-Complete. It also follows that the hardness of the problem remains for polylogarithmic depth circuit consisting of only gates from any uni"},"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":"0906.5416","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-06-30T06:11:22Z","cross_cats_sorted":[],"title_canon_sha256":"53e5e3b7ae2525545f252b2eade1124e5bd6c4128927cb7f346e7bc8808dbc1a","abstract_canon_sha256":"ce00a31e5d525cd43aa7c68ff91b239cbbcf104a34a81845c32d641df2709b1a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:45:19.036281Z","signature_b64":"XsjTL0JExFW0EpIWOJalZvhmM1qpUz3gppeY8SnqK5Zcab8Y32sz0l1JLn88U0+ApsIUfP3aCOWciofVDdCvCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4389f5cdc75c7035d096cd6f061d9760885951826c677c468f507f94331129ce","last_reissued_at":"2026-07-04T15:45:19.035930Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:45:19.035930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Identity Check Remains QMA-Complete for Short Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Xiaodi Wu, Zhengfeng Ji","submitted_at":"2009-06-30T06:11:22Z","abstract_excerpt":"The Non-Identity Check problem asks whether a given a quantum circuit is far away from the identity or not. It is well known that this problem is QMA-Complete \\cite{JWB05}. In this note, it is shown that the Non-Identity Check problem remains QMA-Complete for circuits of short depth. Specifically, we prove that for constant depth quantum circuit in which each gate is given to at least $\\Omega(\\log n)$ bits of precision, the Non-Identity Check problem is QMA-Complete. It also follows that the hardness of the problem remains for polylogarithmic depth circuit consisting of only gates from any uni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.5416","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/0906.5416/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":"0906.5416","created_at":"2026-07-04T15:45:19.035995+00:00"},{"alias_kind":"arxiv_version","alias_value":"0906.5416v1","created_at":"2026-07-04T15:45:19.035995+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.5416","created_at":"2026-07-04T15:45:19.035995+00:00"},{"alias_kind":"pith_short_12","alias_value":"IOE7LTOHLRYD","created_at":"2026-07-04T15:45:19.035995+00:00"},{"alias_kind":"pith_short_16","alias_value":"IOE7LTOHLRYDLUEW","created_at":"2026-07-04T15:45:19.035995+00:00"},{"alias_kind":"pith_short_8","alias_value":"IOE7LTOH","created_at":"2026-07-04T15:45:19.035995+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.00514","citing_title":"Q-Sylvan: A Parallel Decision Diagram Package for Quantum Computing","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IOE7LTOHLRYDLUEWZVXQMHMXMC","json":"https://pith.science/pith/IOE7LTOHLRYDLUEWZVXQMHMXMC.json","graph_json":"https://pith.science/api/pith-number/IOE7LTOHLRYDLUEWZVXQMHMXMC/graph.json","events_json":"https://pith.science/api/pith-number/IOE7LTOHLRYDLUEWZVXQMHMXMC/events.json","paper":"https://pith.science/paper/IOE7LTOH"},"agent_actions":{"view_html":"https://pith.science/pith/IOE7LTOHLRYDLUEWZVXQMHMXMC","download_json":"https://pith.science/pith/IOE7LTOHLRYDLUEWZVXQMHMXMC.json","view_paper":"https://pith.science/paper/IOE7LTOH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0906.5416&json=true","fetch_graph":"https://pith.science/api/pith-number/IOE7LTOHLRYDLUEWZVXQMHMXMC/graph.json","fetch_events":"https://pith.science/api/pith-number/IOE7LTOHLRYDLUEWZVXQMHMXMC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IOE7LTOHLRYDLUEWZVXQMHMXMC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IOE7LTOHLRYDLUEWZVXQMHMXMC/action/storage_attestation","attest_author":"https://pith.science/pith/IOE7LTOHLRYDLUEWZVXQMHMXMC/action/author_attestation","sign_citation":"https://pith.science/pith/IOE7LTOHLRYDLUEWZVXQMHMXMC/action/citation_signature","submit_replication":"https://pith.science/pith/IOE7LTOHLRYDLUEWZVXQMHMXMC/action/replication_record"}},"created_at":"2026-07-04T15:45:19.035995+00:00","updated_at":"2026-07-04T15:45:19.035995+00:00"}