{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:E2KZPE6EC4SF55BOFUYJXTZAZV","short_pith_number":"pith:E2KZPE6E","schema_version":"1.0","canonical_sha256":"26959793c417245ef42e2d309bcf20cd74baa2f85c82e36dfb1b15909ee53c3a","source":{"kind":"arxiv","id":"quant-ph/0611156","version":2},"attestation_state":"computed","paper":{"title":"The quantum FFT can be classically simulated","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dorit Aharonov, Johann Makowsky, Zeph Landau","submitted_at":"2006-11-14T18:31:23Z","abstract_excerpt":"In this note we describe a simple and intriguing observation: the quantum Fourier transform (QFT) over $Z_q$, which is considered the most ``quantum'' part of Shor's algorithm, can in fact be simulated efficiently by classical computers.\n  More precisely, we observe that the QFT can be performed by a circuit of poly-logarithmic path-width, if the circuit is allowed to apply not only unitary gates but also general linear gates. Recalling the results of Markov and Shi [MaSh] and Jozsa [Jo] which provided classical simulations of such circuits in time exponential in the tree-width, this implies t"},"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/0611156","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2006-11-14T18:31:23Z","cross_cats_sorted":[],"title_canon_sha256":"7ec6535080115b7b812998546e100de281a2740105f4620c241daad09e832dad","abstract_canon_sha256":"9867a8acc46712be2ff464ce8b1955cbc93ca53d0b61eb40b5363c24c0e3e5a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:00:29.378468Z","signature_b64":"8zpAPngpgD/y69j9gYfjh3SoQ99Y/l+Va2c9uxqlRt7vAU0hOmfW+zW4mBsjNnVs/LoCRcjw3IixW29NbVYXAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26959793c417245ef42e2d309bcf20cd74baa2f85c82e36dfb1b15909ee53c3a","last_reissued_at":"2026-07-04T15:00:29.377994Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:00:29.377994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The quantum FFT can be classically simulated","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dorit Aharonov, Johann Makowsky, Zeph Landau","submitted_at":"2006-11-14T18:31:23Z","abstract_excerpt":"In this note we describe a simple and intriguing observation: the quantum Fourier transform (QFT) over $Z_q$, which is considered the most ``quantum'' part of Shor's algorithm, can in fact be simulated efficiently by classical computers.\n  More precisely, we observe that the QFT can be performed by a circuit of poly-logarithmic path-width, if the circuit is allowed to apply not only unitary gates but also general linear gates. Recalling the results of Markov and Shi [MaSh] and Jozsa [Jo] which provided classical simulations of such circuits in time exponential in the tree-width, this implies t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0611156","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/0611156/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":"quant-ph/0611156","created_at":"2026-07-04T15:00:29.378060+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0611156v2","created_at":"2026-07-04T15:00:29.378060+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0611156","created_at":"2026-07-04T15:00:29.378060+00:00"},{"alias_kind":"pith_short_12","alias_value":"E2KZPE6EC4SF","created_at":"2026-07-04T15:00:29.378060+00:00"},{"alias_kind":"pith_short_16","alias_value":"E2KZPE6EC4SF55BO","created_at":"2026-07-04T15:00:29.378060+00:00"},{"alias_kind":"pith_short_8","alias_value":"E2KZPE6E","created_at":"2026-07-04T15:00:29.378060+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.11034","citing_title":"Carving-width and contraction trees for tensor networks","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E2KZPE6EC4SF55BOFUYJXTZAZV","json":"https://pith.science/pith/E2KZPE6EC4SF55BOFUYJXTZAZV.json","graph_json":"https://pith.science/api/pith-number/E2KZPE6EC4SF55BOFUYJXTZAZV/graph.json","events_json":"https://pith.science/api/pith-number/E2KZPE6EC4SF55BOFUYJXTZAZV/events.json","paper":"https://pith.science/paper/E2KZPE6E"},"agent_actions":{"view_html":"https://pith.science/pith/E2KZPE6EC4SF55BOFUYJXTZAZV","download_json":"https://pith.science/pith/E2KZPE6EC4SF55BOFUYJXTZAZV.json","view_paper":"https://pith.science/paper/E2KZPE6E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0611156&json=true","fetch_graph":"https://pith.science/api/pith-number/E2KZPE6EC4SF55BOFUYJXTZAZV/graph.json","fetch_events":"https://pith.science/api/pith-number/E2KZPE6EC4SF55BOFUYJXTZAZV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E2KZPE6EC4SF55BOFUYJXTZAZV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E2KZPE6EC4SF55BOFUYJXTZAZV/action/storage_attestation","attest_author":"https://pith.science/pith/E2KZPE6EC4SF55BOFUYJXTZAZV/action/author_attestation","sign_citation":"https://pith.science/pith/E2KZPE6EC4SF55BOFUYJXTZAZV/action/citation_signature","submit_replication":"https://pith.science/pith/E2KZPE6EC4SF55BOFUYJXTZAZV/action/replication_record"}},"created_at":"2026-07-04T15:00:29.378060+00:00","updated_at":"2026-07-04T15:00:29.378060+00:00"}