{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:LKXRN5XPRBZBPFYYTMWFDNF5ZJ","short_pith_number":"pith:LKXRN5XP","schema_version":"1.0","canonical_sha256":"5aaf16f6ef88721797189b2c51b4bdca42b81df716128053774648db44d687b3","source":{"kind":"arxiv","id":"cond-mat/0609411","version":2},"attestation_state":"computed","paper":{"title":"Large Fourier transforms never exactly realized by braiding conformal blocks","license":"","headline":"","cross_cats":["math-ph","math.MP","quant-ph"],"primary_cat":"cond-mat.mes-hall","authors_text":"Michael H. Freedman, Zhenghan Wang","submitted_at":"2006-09-18T05:33:52Z","abstract_excerpt":"Fourier transform is an essential ingredient in Shor's factoring algorithm. In the standard quantum circuit model with the gate set $\\{\\U(2), \\textrm{CNOT}\\}$, the discrete Fourier transforms $F_N=(\\omega^{ij})_{N\\times N},i,j=0,1,..., N-1, \\omega=e^{\\frac{2\\pi i}{N}}$, can be realized exactly by quantum circuits of size $O(n^2), n=\\textrm{log}N$, and so can the discrete sine/cosine transforms. In topological quantum computing, the simplest universal topological quantum computer is based on the Fibonacci (2+1)-topological quantum field theory (TQFT), where the standard quantum circuits are rep"},"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":"cond-mat/0609411","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cond-mat.mes-hall","submitted_at":"2006-09-18T05:33:52Z","cross_cats_sorted":["math-ph","math.MP","quant-ph"],"title_canon_sha256":"62c371ca49d211eb6fe4d1368685e36de1e38bb289f560c14030585585d7f949","abstract_canon_sha256":"f446d815d2550a5fa5a28ead64da62e763c72d597f6b8ca65a92f25cd446bef7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:39:43.281265Z","signature_b64":"4TR2xQHcaiQHZGkqDqyxnQQb+djlMxJtLh9bEiP7Gcib+qWOR3JNVZ07zETYUVWuKZofO39IRqKBBk4HXfLHAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5aaf16f6ef88721797189b2c51b4bdca42b81df716128053774648db44d687b3","last_reissued_at":"2026-05-18T01:39:43.280735Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:39:43.280735Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large Fourier transforms never exactly realized by braiding conformal blocks","license":"","headline":"","cross_cats":["math-ph","math.MP","quant-ph"],"primary_cat":"cond-mat.mes-hall","authors_text":"Michael H. Freedman, Zhenghan Wang","submitted_at":"2006-09-18T05:33:52Z","abstract_excerpt":"Fourier transform is an essential ingredient in Shor's factoring algorithm. In the standard quantum circuit model with the gate set $\\{\\U(2), \\textrm{CNOT}\\}$, the discrete Fourier transforms $F_N=(\\omega^{ij})_{N\\times N},i,j=0,1,..., N-1, \\omega=e^{\\frac{2\\pi i}{N}}$, can be realized exactly by quantum circuits of size $O(n^2), n=\\textrm{log}N$, and so can the discrete sine/cosine transforms. In topological quantum computing, the simplest universal topological quantum computer is based on the Fibonacci (2+1)-topological quantum field theory (TQFT), where the standard quantum circuits are rep"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cond-mat/0609411","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":""},"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":"cond-mat/0609411","created_at":"2026-05-18T01:39:43.280822+00:00"},{"alias_kind":"arxiv_version","alias_value":"cond-mat/0609411v2","created_at":"2026-05-18T01:39:43.280822+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cond-mat/0609411","created_at":"2026-05-18T01:39:43.280822+00:00"},{"alias_kind":"pith_short_12","alias_value":"LKXRN5XPRBZB","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"LKXRN5XPRBZBPFYY","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"LKXRN5XP","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":238,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LKXRN5XPRBZBPFYYTMWFDNF5ZJ","json":"https://pith.science/pith/LKXRN5XPRBZBPFYYTMWFDNF5ZJ.json","graph_json":"https://pith.science/api/pith-number/LKXRN5XPRBZBPFYYTMWFDNF5ZJ/graph.json","events_json":"https://pith.science/api/pith-number/LKXRN5XPRBZBPFYYTMWFDNF5ZJ/events.json","paper":"https://pith.science/paper/LKXRN5XP"},"agent_actions":{"view_html":"https://pith.science/pith/LKXRN5XPRBZBPFYYTMWFDNF5ZJ","download_json":"https://pith.science/pith/LKXRN5XPRBZBPFYYTMWFDNF5ZJ.json","view_paper":"https://pith.science/paper/LKXRN5XP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cond-mat/0609411&json=true","fetch_graph":"https://pith.science/api/pith-number/LKXRN5XPRBZBPFYYTMWFDNF5ZJ/graph.json","fetch_events":"https://pith.science/api/pith-number/LKXRN5XPRBZBPFYYTMWFDNF5ZJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LKXRN5XPRBZBPFYYTMWFDNF5ZJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LKXRN5XPRBZBPFYYTMWFDNF5ZJ/action/storage_attestation","attest_author":"https://pith.science/pith/LKXRN5XPRBZBPFYYTMWFDNF5ZJ/action/author_attestation","sign_citation":"https://pith.science/pith/LKXRN5XPRBZBPFYYTMWFDNF5ZJ/action/citation_signature","submit_replication":"https://pith.science/pith/LKXRN5XPRBZBPFYYTMWFDNF5ZJ/action/replication_record"}},"created_at":"2026-05-18T01:39:43.280822+00:00","updated_at":"2026-05-18T01:39:43.280822+00:00"}