{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:S23GLASCPONMNEZAX77UFHDPBA","short_pith_number":"pith:S23GLASC","canonical_record":{"source":{"id":"2504.20832","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-29T14:56:41Z","cross_cats_sorted":[],"title_canon_sha256":"611cbe2d05746ca030982b75307cfd786f5a4cf30f657d6ea0fc974febe18cdf","abstract_canon_sha256":"b9a31a2cc39be7ecf9710a14917f23b374b2db858ee3067ae4653452850d5a74"},"schema_version":"1.0"},"canonical_sha256":"96b66582427b9ac69320bfff429c6f0814f171f9f161eaeb7aca78782aadcc6f","source":{"kind":"arxiv","id":"2504.20832","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.20832","created_at":"2026-07-05T10:55:49Z"},{"alias_kind":"arxiv_version","alias_value":"2504.20832v1","created_at":"2026-07-05T10:55:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.20832","created_at":"2026-07-05T10:55:49Z"},{"alias_kind":"pith_short_12","alias_value":"S23GLASCPONM","created_at":"2026-07-05T10:55:49Z"},{"alias_kind":"pith_short_16","alias_value":"S23GLASCPONMNEZA","created_at":"2026-07-05T10:55:49Z"},{"alias_kind":"pith_short_8","alias_value":"S23GLASC","created_at":"2026-07-05T10:55:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:S23GLASCPONMNEZAX77UFHDPBA","target":"record","payload":{"canonical_record":{"source":{"id":"2504.20832","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-29T14:56:41Z","cross_cats_sorted":[],"title_canon_sha256":"611cbe2d05746ca030982b75307cfd786f5a4cf30f657d6ea0fc974febe18cdf","abstract_canon_sha256":"b9a31a2cc39be7ecf9710a14917f23b374b2db858ee3067ae4653452850d5a74"},"schema_version":"1.0"},"canonical_sha256":"96b66582427b9ac69320bfff429c6f0814f171f9f161eaeb7aca78782aadcc6f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:55:49.519438Z","signature_b64":"20q1hqafErGR01DphiQgt3jLq2zoHC/ncLrt/B2oGqRQ/eMinWVKwbTbSrrv4ZP28K+6llAGR4gyQIGFOHRsBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96b66582427b9ac69320bfff429c6f0814f171f9f161eaeb7aca78782aadcc6f","last_reissued_at":"2026-07-05T10:55:49.518932Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:55:49.518932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.20832","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-05T10:55:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qfZw+IomwJWAvsDQT9s2/7sv2JZezFJL9wRV8NrIiUVn7YWHsxniwjyS7b8VaKVg+SQ8/gHolRYh1B4zwqtCDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T00:57:16.694954Z"},"content_sha256":"038252f5790b2df26368dead473d8897669a357150f029834036dd0215a1b472","schema_version":"1.0","event_id":"sha256:038252f5790b2df26368dead473d8897669a357150f029834036dd0215a1b472"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:S23GLASCPONMNEZAX77UFHDPBA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate Quantum Fourier Transform in Logarithmic Depth on a Line","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David Sutter, Elisa B\\\"aumer, Stefan Woerner","submitted_at":"2025-04-29T14:56:41Z","abstract_excerpt":"The approximate quantum Fourier transform (AQFT) on $n$ qubits can be implemented in logarithmic depth using $8n$ qubits with all-to-all connectivity, as shown in [Hales, PhD Thesis Berkeley, 2002]. However, realizing the required all-to-all connectivity can be challenging in practice. In this work, we use dynamic circuits, i.e., mid-circuit measurements and feed-forward operations, to implement the AQFT in logarithmic depth using only $4n$ qubits arranged on a line with nearest-neighbor connectivity. Furthermore, for states with a specific structure, the number of qubits can be further reduce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.20832","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/2504.20832/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-05T10:55:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LYWS45ixkopKxi5x/dIKE9KZjNhbE4g8KzuPnh8TaxRh2a184eah3nKxoMh8zAaeu8QeFfDXfuS+y6uxXhfGDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T00:57:16.695833Z"},"content_sha256":"5810259289d1173eea385d90e20f8eb86597d17f31065f407f258084d07352af","schema_version":"1.0","event_id":"sha256:5810259289d1173eea385d90e20f8eb86597d17f31065f407f258084d07352af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S23GLASCPONMNEZAX77UFHDPBA/bundle.json","state_url":"https://pith.science/pith/S23GLASCPONMNEZAX77UFHDPBA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S23GLASCPONMNEZAX77UFHDPBA/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-08T00:57:16Z","links":{"resolver":"https://pith.science/pith/S23GLASCPONMNEZAX77UFHDPBA","bundle":"https://pith.science/pith/S23GLASCPONMNEZAX77UFHDPBA/bundle.json","state":"https://pith.science/pith/S23GLASCPONMNEZAX77UFHDPBA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S23GLASCPONMNEZAX77UFHDPBA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:S23GLASCPONMNEZAX77UFHDPBA","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":"b9a31a2cc39be7ecf9710a14917f23b374b2db858ee3067ae4653452850d5a74","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-29T14:56:41Z","title_canon_sha256":"611cbe2d05746ca030982b75307cfd786f5a4cf30f657d6ea0fc974febe18cdf"},"schema_version":"1.0","source":{"id":"2504.20832","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.20832","created_at":"2026-07-05T10:55:49Z"},{"alias_kind":"arxiv_version","alias_value":"2504.20832v1","created_at":"2026-07-05T10:55:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.20832","created_at":"2026-07-05T10:55:49Z"},{"alias_kind":"pith_short_12","alias_value":"S23GLASCPONM","created_at":"2026-07-05T10:55:49Z"},{"alias_kind":"pith_short_16","alias_value":"S23GLASCPONMNEZA","created_at":"2026-07-05T10:55:49Z"},{"alias_kind":"pith_short_8","alias_value":"S23GLASC","created_at":"2026-07-05T10:55:49Z"}],"graph_snapshots":[{"event_id":"sha256:5810259289d1173eea385d90e20f8eb86597d17f31065f407f258084d07352af","target":"graph","created_at":"2026-07-05T10:55:49Z","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/2504.20832/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The approximate quantum Fourier transform (AQFT) on $n$ qubits can be implemented in logarithmic depth using $8n$ qubits with all-to-all connectivity, as shown in [Hales, PhD Thesis Berkeley, 2002]. However, realizing the required all-to-all connectivity can be challenging in practice. In this work, we use dynamic circuits, i.e., mid-circuit measurements and feed-forward operations, to implement the AQFT in logarithmic depth using only $4n$ qubits arranged on a line with nearest-neighbor connectivity. Furthermore, for states with a specific structure, the number of qubits can be further reduce","authors_text":"David Sutter, Elisa B\\\"aumer, Stefan Woerner","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-29T14:56:41Z","title":"Approximate Quantum Fourier Transform in Logarithmic Depth on a Line"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.20832","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:038252f5790b2df26368dead473d8897669a357150f029834036dd0215a1b472","target":"record","created_at":"2026-07-05T10:55:49Z","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":"b9a31a2cc39be7ecf9710a14917f23b374b2db858ee3067ae4653452850d5a74","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-29T14:56:41Z","title_canon_sha256":"611cbe2d05746ca030982b75307cfd786f5a4cf30f657d6ea0fc974febe18cdf"},"schema_version":"1.0","source":{"id":"2504.20832","kind":"arxiv","version":1}},"canonical_sha256":"96b66582427b9ac69320bfff429c6f0814f171f9f161eaeb7aca78782aadcc6f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96b66582427b9ac69320bfff429c6f0814f171f9f161eaeb7aca78782aadcc6f","first_computed_at":"2026-07-05T10:55:49.518932Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:55:49.518932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"20q1hqafErGR01DphiQgt3jLq2zoHC/ncLrt/B2oGqRQ/eMinWVKwbTbSrrv4ZP28K+6llAGR4gyQIGFOHRsBA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:55:49.519438Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.20832","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:038252f5790b2df26368dead473d8897669a357150f029834036dd0215a1b472","sha256:5810259289d1173eea385d90e20f8eb86597d17f31065f407f258084d07352af"],"state_sha256":"1cd675dc5322fda5cb0a8b697a3e8827ac83468c02989942bcf9fe16b9ae01f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QRG2OAQiW6f1jRnWyL9SPjge88RLh/Ott8gPq1ynE6wWRwltSg/R4s2h+BZLtIDmFFLPH4mTYzEg480euYrcDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T00:57:16.717453Z","bundle_sha256":"dc56ffa4b9fe3302a642ff735f9385a06a5aea2d316cc61af88b47e6846da639"}}