{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2003:XEGMPHUHIXOYJXJIPRULXWE24E","short_pith_number":"pith:XEGMPHUH","schema_version":"1.0","canonical_sha256":"b90cc79e8745dd84dd287c68bbd89ae105d4f58a97df6340a2a7d40f2fb944a9","source":{"kind":"arxiv","id":"quant-ph/0305050","version":1},"attestation_state":"computed","paper":{"title":"Identity check is QMA-complete","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dominik Janzing, Pawel Wocjan, Thomas Beth","submitted_at":"2003-05-09T12:02:37Z","abstract_excerpt":"We define the problem identity check: Given a classical description of a quantum circuit, determine whether it is almost equivalent to the identity. Explicitly, the task is to decide whether the corresponding unitary is close to a complex multiple of the identity matrix with respect to the operator norm. We show that this problem is QMA-complete.\n A generalization of this problem is equivalence check: Given two descriptions of quantum circuits and a description of a common invariant subspace, decide whether the restrictions of the circuits to this subspace almost coincide. We show that equival"},"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":"quant-ph/0305050","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2003-05-09T12:02:37Z","cross_cats_sorted":[],"title_canon_sha256":"5cb13f9cfc099785fecc2b5c946e8531e3fd10be21797b7c000e1057a94b2e29","abstract_canon_sha256":"37a0d612620a11388f4be23a7f4f89bb61ac8042e41a1c6067cadce94268ee0b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:04.015350Z","signature_b64":"joZPrX4GvWreFimnvkRolGkHIj7qc8xQRXVN202WyGxCYGMo/VOVEqQXRfHQfIOpWR5WSX6IHZsz3ZhOptFnAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b90cc79e8745dd84dd287c68bbd89ae105d4f58a97df6340a2a7d40f2fb944a9","last_reissued_at":"2026-05-18T01:05:04.014652Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:04.014652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Identity check is QMA-complete","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dominik Janzing, Pawel Wocjan, Thomas Beth","submitted_at":"2003-05-09T12:02:37Z","abstract_excerpt":"We define the problem identity check: Given a classical description of a quantum circuit, determine whether it is almost equivalent to the identity. Explicitly, the task is to decide whether the corresponding unitary is close to a complex multiple of the identity matrix with respect to the operator norm. We show that this problem is QMA-complete.\n A generalization of this problem is equivalence check: Given two descriptions of quantum circuits and a description of a common invariant subspace, decide whether the restrictions of the circuits to this subspace almost coincide. We show that equival"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0305050","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":""},"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":"quant-ph/0305050","created_at":"2026-05-18T01:05:04.014761+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0305050v1","created_at":"2026-05-18T01:05:04.014761+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0305050","created_at":"2026-05-18T01:05:04.014761+00:00"},{"alias_kind":"pith_short_12","alias_value":"XEGMPHUHIXOY","created_at":"2026-05-18T12:25:52.051335+00:00"},{"alias_kind":"pith_short_16","alias_value":"XEGMPHUHIXOYJXJI","created_at":"2026-05-18T12:25:52.051335+00:00"},{"alias_kind":"pith_short_8","alias_value":"XEGMPHUH","created_at":"2026-05-18T12:25:52.051335+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XEGMPHUHIXOYJXJIPRULXWE24E","json":"https://pith.science/pith/XEGMPHUHIXOYJXJIPRULXWE24E.json","graph_json":"https://pith.science/api/pith-number/XEGMPHUHIXOYJXJIPRULXWE24E/graph.json","events_json":"https://pith.science/api/pith-number/XEGMPHUHIXOYJXJIPRULXWE24E/events.json","paper":"https://pith.science/paper/XEGMPHUH"},"agent_actions":{"view_html":"https://pith.science/pith/XEGMPHUHIXOYJXJIPRULXWE24E","download_json":"https://pith.science/pith/XEGMPHUHIXOYJXJIPRULXWE24E.json","view_paper":"https://pith.science/paper/XEGMPHUH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0305050&json=true","fetch_graph":"https://pith.science/api/pith-number/XEGMPHUHIXOYJXJIPRULXWE24E/graph.json","fetch_events":"https://pith.science/api/pith-number/XEGMPHUHIXOYJXJIPRULXWE24E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XEGMPHUHIXOYJXJIPRULXWE24E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XEGMPHUHIXOYJXJIPRULXWE24E/action/storage_attestation","attest_author":"https://pith.science/pith/XEGMPHUHIXOYJXJIPRULXWE24E/action/author_attestation","sign_citation":"https://pith.science/pith/XEGMPHUHIXOYJXJIPRULXWE24E/action/citation_signature","submit_replication":"https://pith.science/pith/XEGMPHUHIXOYJXJIPRULXWE24E/action/replication_record"}},"created_at":"2026-05-18T01:05:04.014761+00:00","updated_at":"2026-05-18T01:05:04.014761+00:00"}