{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2002:V2YGGXU7ZVLIH3V7WR7VMRALNQ","short_pith_number":"pith:V2YGGXU7","schema_version":"1.0","canonical_sha256":"aeb0635e9fcd5683eebfb47f56440b6c204cc463ff75ab752be236991aee7f34","source":{"kind":"arxiv","id":"quant-ph/0211030","version":1},"attestation_state":"computed","paper":{"title":"Efficient implementations of the Quantum Fourier Transform: an experimental perspective","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dieter Suter (Department of Physics, Germany), Kavita Dorai, University of Dortmund","submitted_at":"2002-11-06T19:28:00Z","abstract_excerpt":"The Quantum Fourier transform (QFT) is a key ingredient in most quantum algorithms. We have compared various spin-based quantum computing schemes to implement the QFT from the point of view of their actual time-costs and the accuracy of the implementation. We focus here on an interesting decomposition of the QFT as a product of the non-selective Hadamard transformation followed by multiqubit gates corresponding to square- and higher-roots of controlled-NOT gates. This decomposition requires only O(n) operations and is thus linear in the number of qubits $n$. The schemes were implemented on a 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/0211030","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2002-11-06T19:28:00Z","cross_cats_sorted":[],"title_canon_sha256":"1b856f7fd802916abb64de45306b65dc8efe8125c8d546aaaebb4192794dbf01","abstract_canon_sha256":"73c887adee8933a3542bfc29e4a54fd75c25b042dd8c4c06d04f67ff0497843c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:41.385919Z","signature_b64":"X/NMe8yTyPnpX+C+t8ThU1pesSoa0nNDgQVwur7XVaOCy5+WWTBudTtY6uWZLYCL9ArXuSSI5gwiyxO686grDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aeb0635e9fcd5683eebfb47f56440b6c204cc463ff75ab752be236991aee7f34","last_reissued_at":"2026-05-18T02:45:41.385440Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:41.385440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient implementations of the Quantum Fourier Transform: an experimental perspective","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dieter Suter (Department of Physics, Germany), Kavita Dorai, University of Dortmund","submitted_at":"2002-11-06T19:28:00Z","abstract_excerpt":"The Quantum Fourier transform (QFT) is a key ingredient in most quantum algorithms. We have compared various spin-based quantum computing schemes to implement the QFT from the point of view of their actual time-costs and the accuracy of the implementation. We focus here on an interesting decomposition of the QFT as a product of the non-selective Hadamard transformation followed by multiqubit gates corresponding to square- and higher-roots of controlled-NOT gates. This decomposition requires only O(n) operations and is thus linear in the number of qubits $n$. The schemes were implemented on a t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0211030","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/0211030","created_at":"2026-05-18T02:45:41.385516+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0211030v1","created_at":"2026-05-18T02:45:41.385516+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0211030","created_at":"2026-05-18T02:45:41.385516+00:00"},{"alias_kind":"pith_short_12","alias_value":"V2YGGXU7ZVLI","created_at":"2026-05-18T12:25:51.375804+00:00"},{"alias_kind":"pith_short_16","alias_value":"V2YGGXU7ZVLIH3V7","created_at":"2026-05-18T12:25:51.375804+00:00"},{"alias_kind":"pith_short_8","alias_value":"V2YGGXU7","created_at":"2026-05-18T12:25:51.375804+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/V2YGGXU7ZVLIH3V7WR7VMRALNQ","json":"https://pith.science/pith/V2YGGXU7ZVLIH3V7WR7VMRALNQ.json","graph_json":"https://pith.science/api/pith-number/V2YGGXU7ZVLIH3V7WR7VMRALNQ/graph.json","events_json":"https://pith.science/api/pith-number/V2YGGXU7ZVLIH3V7WR7VMRALNQ/events.json","paper":"https://pith.science/paper/V2YGGXU7"},"agent_actions":{"view_html":"https://pith.science/pith/V2YGGXU7ZVLIH3V7WR7VMRALNQ","download_json":"https://pith.science/pith/V2YGGXU7ZVLIH3V7WR7VMRALNQ.json","view_paper":"https://pith.science/paper/V2YGGXU7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0211030&json=true","fetch_graph":"https://pith.science/api/pith-number/V2YGGXU7ZVLIH3V7WR7VMRALNQ/graph.json","fetch_events":"https://pith.science/api/pith-number/V2YGGXU7ZVLIH3V7WR7VMRALNQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V2YGGXU7ZVLIH3V7WR7VMRALNQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V2YGGXU7ZVLIH3V7WR7VMRALNQ/action/storage_attestation","attest_author":"https://pith.science/pith/V2YGGXU7ZVLIH3V7WR7VMRALNQ/action/author_attestation","sign_citation":"https://pith.science/pith/V2YGGXU7ZVLIH3V7WR7VMRALNQ/action/citation_signature","submit_replication":"https://pith.science/pith/V2YGGXU7ZVLIH3V7WR7VMRALNQ/action/replication_record"}},"created_at":"2026-05-18T02:45:41.385516+00:00","updated_at":"2026-05-18T02:45:41.385516+00:00"}