{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:ZKLGXTIL5CV5HSIK54FEUVQSAS","short_pith_number":"pith:ZKLGXTIL","canonical_record":{"source":{"id":"2301.13835","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-01-31T18:25:40Z","cross_cats_sorted":[],"title_canon_sha256":"d1935c15a13b121fa24285867b2833b0ceb5d9c1bb489426203cb322e96cabea","abstract_canon_sha256":"4a5482779f6d263aa565d9a8bad0d1861b465ed03cd8c29c336de9d9cebe57e5"},"schema_version":"1.0"},"canonical_sha256":"ca966bcd0be8abd3c90aef0a4a561204baa4bed2263c3604cc028d5ba9448d7b","source":{"kind":"arxiv","id":"2301.13835","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.13835","created_at":"2026-07-05T05:37:19Z"},{"alias_kind":"arxiv_version","alias_value":"2301.13835v1","created_at":"2026-07-05T05:37:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.13835","created_at":"2026-07-05T05:37:19Z"},{"alias_kind":"pith_short_12","alias_value":"ZKLGXTIL5CV5","created_at":"2026-07-05T05:37:19Z"},{"alias_kind":"pith_short_16","alias_value":"ZKLGXTIL5CV5HSIK","created_at":"2026-07-05T05:37:19Z"},{"alias_kind":"pith_short_8","alias_value":"ZKLGXTIL","created_at":"2026-07-05T05:37:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:ZKLGXTIL5CV5HSIK54FEUVQSAS","target":"record","payload":{"canonical_record":{"source":{"id":"2301.13835","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-01-31T18:25:40Z","cross_cats_sorted":[],"title_canon_sha256":"d1935c15a13b121fa24285867b2833b0ceb5d9c1bb489426203cb322e96cabea","abstract_canon_sha256":"4a5482779f6d263aa565d9a8bad0d1861b465ed03cd8c29c336de9d9cebe57e5"},"schema_version":"1.0"},"canonical_sha256":"ca966bcd0be8abd3c90aef0a4a561204baa4bed2263c3604cc028d5ba9448d7b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:37:19.468185Z","signature_b64":"oO/IHKGLFP8+XKOQcd4jNQQodSS6rvKmtTlc16R4100ctq+ckVnNiinY0h1haUhQinQToqwOyM00M2ucG2SZAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca966bcd0be8abd3c90aef0a4a561204baa4bed2263c3604cc028d5ba9448d7b","last_reissued_at":"2026-07-05T05:37:19.467743Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:37:19.467743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2301.13835","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:37:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uE4SPlPvMCCTPEhwA5+LKgyUu4dmOMdphgGtnDrbQnJGFLecBQPVQPtXvFncnSK2ARs9+s40gHRGPhNN/Gn6Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T13:10:09.666674Z"},"content_sha256":"2bae1aba9c8e1ccdc287105b8c4751cde968e3ce281da5edaa90549bc36cdd71","schema_version":"1.0","event_id":"sha256:2bae1aba9c8e1ccdc287105b8c4751cde968e3ce281da5edaa90549bc36cdd71"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:ZKLGXTIL5CV5HSIK54FEUVQSAS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multidimensional Quantum Fourier Transformation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Philipp Pfeffer","submitted_at":"2023-01-31T18:25:40Z","abstract_excerpt":"The Quantum Fourier Transformation (QFT) is a well-known subroutine for algorithms on qubit-based universal quantum computers. In this work, the known QFT circuit is used to derive an efficient circuit for the multidimensional QFT. The complexity of the algorithm is $\\mathcal{O}( \\log^2(M)/d )$ for an array with $M=(2^n)^d$ elements $(n \\in \\mathbb{N})$ equally separated along $d$ dimensions. Relevant properties for application are discussed. An example on current hardware is depicted by a 6 qubit 2D-QFT with an IBM quantum computer."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.13835","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2301.13835/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:37:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HmcNKiwp3cKul8I6Z0XfK4Vm76x0ak/Mu8aguv3Y7HJUm/8Z5NE3Zw7gz83D/gZzvZV5dfsAYyZpbExxCnggAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T13:10:09.667194Z"},"content_sha256":"10af531533fe8ffc9a0363633d730cc290933cf622f2b5702cae73529fc2747d","schema_version":"1.0","event_id":"sha256:10af531533fe8ffc9a0363633d730cc290933cf622f2b5702cae73529fc2747d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZKLGXTIL5CV5HSIK54FEUVQSAS/bundle.json","state_url":"https://pith.science/pith/ZKLGXTIL5CV5HSIK54FEUVQSAS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZKLGXTIL5CV5HSIK54FEUVQSAS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-04T13:10:09Z","links":{"resolver":"https://pith.science/pith/ZKLGXTIL5CV5HSIK54FEUVQSAS","bundle":"https://pith.science/pith/ZKLGXTIL5CV5HSIK54FEUVQSAS/bundle.json","state":"https://pith.science/pith/ZKLGXTIL5CV5HSIK54FEUVQSAS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZKLGXTIL5CV5HSIK54FEUVQSAS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:ZKLGXTIL5CV5HSIK54FEUVQSAS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4a5482779f6d263aa565d9a8bad0d1861b465ed03cd8c29c336de9d9cebe57e5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-01-31T18:25:40Z","title_canon_sha256":"d1935c15a13b121fa24285867b2833b0ceb5d9c1bb489426203cb322e96cabea"},"schema_version":"1.0","source":{"id":"2301.13835","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.13835","created_at":"2026-07-05T05:37:19Z"},{"alias_kind":"arxiv_version","alias_value":"2301.13835v1","created_at":"2026-07-05T05:37:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.13835","created_at":"2026-07-05T05:37:19Z"},{"alias_kind":"pith_short_12","alias_value":"ZKLGXTIL5CV5","created_at":"2026-07-05T05:37:19Z"},{"alias_kind":"pith_short_16","alias_value":"ZKLGXTIL5CV5HSIK","created_at":"2026-07-05T05:37:19Z"},{"alias_kind":"pith_short_8","alias_value":"ZKLGXTIL","created_at":"2026-07-05T05:37:19Z"}],"graph_snapshots":[{"event_id":"sha256:10af531533fe8ffc9a0363633d730cc290933cf622f2b5702cae73529fc2747d","target":"graph","created_at":"2026-07-05T05:37:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2301.13835/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Quantum Fourier Transformation (QFT) is a well-known subroutine for algorithms on qubit-based universal quantum computers. In this work, the known QFT circuit is used to derive an efficient circuit for the multidimensional QFT. The complexity of the algorithm is $\\mathcal{O}( \\log^2(M)/d )$ for an array with $M=(2^n)^d$ elements $(n \\in \\mathbb{N})$ equally separated along $d$ dimensions. Relevant properties for application are discussed. An example on current hardware is depicted by a 6 qubit 2D-QFT with an IBM quantum computer.","authors_text":"Philipp Pfeffer","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-01-31T18:25:40Z","title":"Multidimensional Quantum Fourier Transformation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.13835","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2bae1aba9c8e1ccdc287105b8c4751cde968e3ce281da5edaa90549bc36cdd71","target":"record","created_at":"2026-07-05T05:37:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4a5482779f6d263aa565d9a8bad0d1861b465ed03cd8c29c336de9d9cebe57e5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-01-31T18:25:40Z","title_canon_sha256":"d1935c15a13b121fa24285867b2833b0ceb5d9c1bb489426203cb322e96cabea"},"schema_version":"1.0","source":{"id":"2301.13835","kind":"arxiv","version":1}},"canonical_sha256":"ca966bcd0be8abd3c90aef0a4a561204baa4bed2263c3604cc028d5ba9448d7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca966bcd0be8abd3c90aef0a4a561204baa4bed2263c3604cc028d5ba9448d7b","first_computed_at":"2026-07-05T05:37:19.467743Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:37:19.467743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oO/IHKGLFP8+XKOQcd4jNQQodSS6rvKmtTlc16R4100ctq+ckVnNiinY0h1haUhQinQToqwOyM00M2ucG2SZAA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:37:19.468185Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.13835","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2bae1aba9c8e1ccdc287105b8c4751cde968e3ce281da5edaa90549bc36cdd71","sha256:10af531533fe8ffc9a0363633d730cc290933cf622f2b5702cae73529fc2747d"],"state_sha256":"d474d15f2f724812879a4f2a33fbaccaed802eb0e2a96a2241cca15f66709cd8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EwMNLo/fXTKsnAMi2ONjlL5HXeDoFKXFuMAHTeDdzomHKEbhsjyde8oI89sMTFBDnc9hB6d8Zi3+1JsjmiNIAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T13:10:09.672953Z","bundle_sha256":"6e1b4bcc3f8767920cfa9ed9859c15dbc8cbc5edd143d47e0c0b40e101489439"}}