{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:O4H6DOEYTTV7776HNQAIFKJHP2","short_pith_number":"pith:O4H6DOEY","schema_version":"1.0","canonical_sha256":"770fe1b8989cebffffc76c0082a9277e94b94cb096d5b017ba8af90df4ae28c5","source":{"kind":"arxiv","id":"quant-ph/0603069","version":3},"attestation_state":"computed","paper":{"title":"The Jones polynomial: quantum algorithms and applications in quantum complexity theory","license":"","headline":"","cross_cats":["math.GT"],"primary_cat":"quant-ph","authors_text":"Jon Yard, Pawel Wocjan","submitted_at":"2006-03-08T17:43:33Z","abstract_excerpt":"We analyze relationships between quantum computation and a family of generalizations of the Jones polynomial. Extending recent work by Aharonov et al., we give efficient quantum circuits for implementing the unitary Jones-Wenzl representations of the braid group. We use these to provide new quantum algorithms for approximately evaluating a family of specializations of the HOMFLYPT two-variable polynomial of trace closures of braids. We also give algorithms for approximating the Jones polynomial of a general class of closures of braids at roots of unity. Next we provide a self-contained proof o"},"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/0603069","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2006-03-08T17:43:33Z","cross_cats_sorted":["math.GT"],"title_canon_sha256":"a1341880a61bc6a602ec8b48c9f1072fdb28bde38da588ae0aada5d10a404a85","abstract_canon_sha256":"148874036005a1f4d02680da0d1a698bc147b70f66d8b98f118f9d8c5b1b49fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:52.273183Z","signature_b64":"jYLjSES0UH22cTIFwHKf62pbDVMiqpuBS/1ztZsMAt+W0r6k5iw5y41drg2aVRtylc78zxculL2yWj1UBEldBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"770fe1b8989cebffffc76c0082a9277e94b94cb096d5b017ba8af90df4ae28c5","last_reissued_at":"2026-05-18T04:08:52.272691Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:52.272691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Jones polynomial: quantum algorithms and applications in quantum complexity theory","license":"","headline":"","cross_cats":["math.GT"],"primary_cat":"quant-ph","authors_text":"Jon Yard, Pawel Wocjan","submitted_at":"2006-03-08T17:43:33Z","abstract_excerpt":"We analyze relationships between quantum computation and a family of generalizations of the Jones polynomial. Extending recent work by Aharonov et al., we give efficient quantum circuits for implementing the unitary Jones-Wenzl representations of the braid group. We use these to provide new quantum algorithms for approximately evaluating a family of specializations of the HOMFLYPT two-variable polynomial of trace closures of braids. We also give algorithms for approximating the Jones polynomial of a general class of closures of braids at roots of unity. Next we provide a self-contained proof o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0603069","kind":"arxiv","version":3},"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/0603069","created_at":"2026-05-18T04:08:52.272762+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0603069v3","created_at":"2026-05-18T04:08:52.272762+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0603069","created_at":"2026-05-18T04:08:52.272762+00:00"},{"alias_kind":"pith_short_12","alias_value":"O4H6DOEYTTV7","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"O4H6DOEYTTV7776H","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"O4H6DOEY","created_at":"2026-05-18T12:25:54.717736+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":285,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O4H6DOEYTTV7776HNQAIFKJHP2","json":"https://pith.science/pith/O4H6DOEYTTV7776HNQAIFKJHP2.json","graph_json":"https://pith.science/api/pith-number/O4H6DOEYTTV7776HNQAIFKJHP2/graph.json","events_json":"https://pith.science/api/pith-number/O4H6DOEYTTV7776HNQAIFKJHP2/events.json","paper":"https://pith.science/paper/O4H6DOEY"},"agent_actions":{"view_html":"https://pith.science/pith/O4H6DOEYTTV7776HNQAIFKJHP2","download_json":"https://pith.science/pith/O4H6DOEYTTV7776HNQAIFKJHP2.json","view_paper":"https://pith.science/paper/O4H6DOEY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0603069&json=true","fetch_graph":"https://pith.science/api/pith-number/O4H6DOEYTTV7776HNQAIFKJHP2/graph.json","fetch_events":"https://pith.science/api/pith-number/O4H6DOEYTTV7776HNQAIFKJHP2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O4H6DOEYTTV7776HNQAIFKJHP2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O4H6DOEYTTV7776HNQAIFKJHP2/action/storage_attestation","attest_author":"https://pith.science/pith/O4H6DOEYTTV7776HNQAIFKJHP2/action/author_attestation","sign_citation":"https://pith.science/pith/O4H6DOEYTTV7776HNQAIFKJHP2/action/citation_signature","submit_replication":"https://pith.science/pith/O4H6DOEYTTV7776HNQAIFKJHP2/action/replication_record"}},"created_at":"2026-05-18T04:08:52.272762+00:00","updated_at":"2026-05-18T04:08:52.272762+00:00"}