{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:BB22R3N5QT5MYNBBOMDQPDZH7M","short_pith_number":"pith:BB22R3N5","schema_version":"1.0","canonical_sha256":"0875a8edbd84facc34217307078f27fb3143a313fc2a0fe3dbcf49ce89805295","source":{"kind":"arxiv","id":"2608.05435","version":1},"attestation_state":"computed","paper":{"title":"Experimental demonstration of the Quantum Fourier Transform on up to 100 qubits using a convolutional compilation strategy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Michael J. Biercuk, Paul Coote, Yuval Baum","submitted_at":"2026-08-05T22:06:34Z","abstract_excerpt":"We present and experimentally validate the `Convolutional QFT': a constructive compilation strategy for the Quantum Fourier Transform (QFT) subroutine on a linear nearest neighbor (LNN) qubit topology. We first introduce a novel strategy that compiles the $n$-qubit QFT onto an LNN topology using only $n^2 - n$ $CX$ gates, matching requirements of a direct compilation on an all-to-all architecture. We then derive the convolutional variant used in our experiments, which requires an additional two $CX$ gates in total, and is realized via a compact, translation-invariant kernel circuit gadget that"},"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":"2608.05435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-08-05T22:06:34Z","cross_cats_sorted":[],"title_canon_sha256":"1967af0fe624adc70ca88a54e668c9e7c29444fc688ef9134920c731657f1386","abstract_canon_sha256":"aa34186cb20a4a41e46cfdc96294f3c9ba12b3d03ffe825d8842c9af714ffb69"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-07T00:47:51.535122Z","signature_b64":"xh5tqtlB6IUVV/C6km6ySgb3DrY5yilXe9uH8LrK+vIlY8ERIlm7/YTEGq6h9OMzu0GfQ27bgJAaygk6qm3mCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0875a8edbd84facc34217307078f27fb3143a313fc2a0fe3dbcf49ce89805295","last_reissued_at":"2026-08-07T00:47:51.533747Z","signature_status":"signed_v1","first_computed_at":"2026-08-07T00:47:51.533747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Experimental demonstration of the Quantum Fourier Transform on up to 100 qubits using a convolutional compilation strategy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Michael J. Biercuk, Paul Coote, Yuval Baum","submitted_at":"2026-08-05T22:06:34Z","abstract_excerpt":"We present and experimentally validate the `Convolutional QFT': a constructive compilation strategy for the Quantum Fourier Transform (QFT) subroutine on a linear nearest neighbor (LNN) qubit topology. We first introduce a novel strategy that compiles the $n$-qubit QFT onto an LNN topology using only $n^2 - n$ $CX$ gates, matching requirements of a direct compilation on an all-to-all architecture. We then derive the convolutional variant used in our experiments, which requires an additional two $CX$ gates in total, and is realized via a compact, translation-invariant kernel circuit gadget that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.05435","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/2608.05435/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":"2608.05435","created_at":"2026-08-07T00:47:51.535071+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.05435v1","created_at":"2026-08-07T00:47:51.535071+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.05435","created_at":"2026-08-07T00:47:51.535071+00:00"},{"alias_kind":"pith_short_12","alias_value":"BB22R3N5QT5M","created_at":"2026-08-07T00:47:51.535071+00:00"},{"alias_kind":"pith_short_16","alias_value":"BB22R3N5QT5MYNBB","created_at":"2026-08-07T00:47:51.535071+00:00"},{"alias_kind":"pith_short_8","alias_value":"BB22R3N5","created_at":"2026-08-07T00:47:51.535071+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/BB22R3N5QT5MYNBBOMDQPDZH7M","json":"https://pith.science/pith/BB22R3N5QT5MYNBBOMDQPDZH7M.json","graph_json":"https://pith.science/api/pith-number/BB22R3N5QT5MYNBBOMDQPDZH7M/graph.json","events_json":"https://pith.science/api/pith-number/BB22R3N5QT5MYNBBOMDQPDZH7M/events.json","paper":"https://pith.science/paper/BB22R3N5"},"agent_actions":{"view_html":"https://pith.science/pith/BB22R3N5QT5MYNBBOMDQPDZH7M","download_json":"https://pith.science/pith/BB22R3N5QT5MYNBBOMDQPDZH7M.json","view_paper":"https://pith.science/paper/BB22R3N5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.05435&json=true","fetch_graph":"https://pith.science/api/pith-number/BB22R3N5QT5MYNBBOMDQPDZH7M/graph.json","fetch_events":"https://pith.science/api/pith-number/BB22R3N5QT5MYNBBOMDQPDZH7M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BB22R3N5QT5MYNBBOMDQPDZH7M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BB22R3N5QT5MYNBBOMDQPDZH7M/action/storage_attestation","attest_author":"https://pith.science/pith/BB22R3N5QT5MYNBBOMDQPDZH7M/action/author_attestation","sign_citation":"https://pith.science/pith/BB22R3N5QT5MYNBBOMDQPDZH7M/action/citation_signature","submit_replication":"https://pith.science/pith/BB22R3N5QT5MYNBBOMDQPDZH7M/action/replication_record"}},"created_at":"2026-08-07T00:47:51.535071+00:00","updated_at":"2026-08-07T00:47:51.535071+00:00"}