{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:C6OE4B4IFGKO4ADGGHVSSQRCOD","short_pith_number":"pith:C6OE4B4I","schema_version":"1.0","canonical_sha256":"179c4e07882994ee006631eb29422270f678a542d5d0d423707ee966a0267978","source":{"kind":"arxiv","id":"quant-ph/0605181","version":5},"attestation_state":"computed","paper":{"title":"The BQP-hardness of approximating the Jones Polynomial","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Dorit Aharonov, Itai Arad","submitted_at":"2006-05-21T21:39:38Z","abstract_excerpt":"A celebrated important result due to Freedman, Larsen and Wang states that providing additive approximations of the Jones polynomial at the k'th root of unity, for constant k=5 and k>6, is BQP-hard. Together with the algorithmic results of Freedman et al and Aharonov et al, this gives perhaps the most natural BQP-complete problem known today and motivates further study of the topic. In this paper we focus on the universality proof; we extend the universality result of Freedman et al to k's that grow polynomially with the number of strands and crossings in the link, thus extending the BQP-hardn"},"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/0605181","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2006-05-21T21:39:38Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"7e50526ee84f1dc3d27a62d207849ee8485f4c5b66a1f6cf20b06eb1263f3308","abstract_canon_sha256":"3fe963e9cd79063072961f177bcf449a740f92d5bcb565bbc12c9d202176ae80"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:25:39.515232Z","signature_b64":"XBUQp5CvV138a3lEak39f9VIP/Qw/Gym2vcNXUYLdfnmC372x0Z+veyXdftk7VTefHx5TksNBd6AHo5xMAhMDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"179c4e07882994ee006631eb29422270f678a542d5d0d423707ee966a0267978","last_reissued_at":"2026-05-18T04:25:39.514835Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:25:39.514835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The BQP-hardness of approximating the Jones Polynomial","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Dorit Aharonov, Itai Arad","submitted_at":"2006-05-21T21:39:38Z","abstract_excerpt":"A celebrated important result due to Freedman, Larsen and Wang states that providing additive approximations of the Jones polynomial at the k'th root of unity, for constant k=5 and k>6, is BQP-hard. Together with the algorithmic results of Freedman et al and Aharonov et al, this gives perhaps the most natural BQP-complete problem known today and motivates further study of the topic. In this paper we focus on the universality proof; we extend the universality result of Freedman et al to k's that grow polynomially with the number of strands and crossings in the link, thus extending the BQP-hardn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0605181","kind":"arxiv","version":5},"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/0605181","created_at":"2026-05-18T04:25:39.514893+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0605181v5","created_at":"2026-05-18T04:25:39.514893+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0605181","created_at":"2026-05-18T04:25:39.514893+00:00"},{"alias_kind":"pith_short_12","alias_value":"C6OE4B4IFGKO","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"C6OE4B4IFGKO4ADG","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"C6OE4B4I","created_at":"2026-05-18T12:25:53.939244+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.12385","citing_title":"Lower overhead fault-tolerant building blocks for noisy quantum computers","ref_index":208,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C6OE4B4IFGKO4ADGGHVSSQRCOD","json":"https://pith.science/pith/C6OE4B4IFGKO4ADGGHVSSQRCOD.json","graph_json":"https://pith.science/api/pith-number/C6OE4B4IFGKO4ADGGHVSSQRCOD/graph.json","events_json":"https://pith.science/api/pith-number/C6OE4B4IFGKO4ADGGHVSSQRCOD/events.json","paper":"https://pith.science/paper/C6OE4B4I"},"agent_actions":{"view_html":"https://pith.science/pith/C6OE4B4IFGKO4ADGGHVSSQRCOD","download_json":"https://pith.science/pith/C6OE4B4IFGKO4ADGGHVSSQRCOD.json","view_paper":"https://pith.science/paper/C6OE4B4I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0605181&json=true","fetch_graph":"https://pith.science/api/pith-number/C6OE4B4IFGKO4ADGGHVSSQRCOD/graph.json","fetch_events":"https://pith.science/api/pith-number/C6OE4B4IFGKO4ADGGHVSSQRCOD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C6OE4B4IFGKO4ADGGHVSSQRCOD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C6OE4B4IFGKO4ADGGHVSSQRCOD/action/storage_attestation","attest_author":"https://pith.science/pith/C6OE4B4IFGKO4ADGGHVSSQRCOD/action/author_attestation","sign_citation":"https://pith.science/pith/C6OE4B4IFGKO4ADGGHVSSQRCOD/action/citation_signature","submit_replication":"https://pith.science/pith/C6OE4B4IFGKO4ADGGHVSSQRCOD/action/replication_record"}},"created_at":"2026-05-18T04:25:39.514893+00:00","updated_at":"2026-05-18T04:25:39.514893+00:00"}