{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:SCJ2NJ2MWTIRKXPEWAHZVSHFDI","short_pith_number":"pith:SCJ2NJ2M","canonical_record":{"source":{"id":"2505.00701","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-05-01T17:58:36Z","cross_cats_sorted":[],"title_canon_sha256":"405975802bb9712bc9af51bb34c267142db515c91d7e0950ed29310ff1d88048","abstract_canon_sha256":"1adac170ac7fbd5a7d8d77733123a9f81d9f5e5b330b1ed004d13bd0062ba0e1"},"schema_version":"1.0"},"canonical_sha256":"9093a6a74cb4d1155de4b00f9ac8e51a0aa193c9c084eb5ac8de6352d0da3bc7","source":{"kind":"arxiv","id":"2505.00701","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.00701","created_at":"2026-07-05T11:09:12Z"},{"alias_kind":"arxiv_version","alias_value":"2505.00701v2","created_at":"2026-07-05T11:09:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.00701","created_at":"2026-07-05T11:09:12Z"},{"alias_kind":"pith_short_12","alias_value":"SCJ2NJ2MWTIR","created_at":"2026-07-05T11:09:12Z"},{"alias_kind":"pith_short_16","alias_value":"SCJ2NJ2MWTIRKXPE","created_at":"2026-07-05T11:09:12Z"},{"alias_kind":"pith_short_8","alias_value":"SCJ2NJ2M","created_at":"2026-07-05T11:09:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:SCJ2NJ2MWTIRKXPEWAHZVSHFDI","target":"record","payload":{"canonical_record":{"source":{"id":"2505.00701","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-05-01T17:58:36Z","cross_cats_sorted":[],"title_canon_sha256":"405975802bb9712bc9af51bb34c267142db515c91d7e0950ed29310ff1d88048","abstract_canon_sha256":"1adac170ac7fbd5a7d8d77733123a9f81d9f5e5b330b1ed004d13bd0062ba0e1"},"schema_version":"1.0"},"canonical_sha256":"9093a6a74cb4d1155de4b00f9ac8e51a0aa193c9c084eb5ac8de6352d0da3bc7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:09:12.458753Z","signature_b64":"eZxcfPD3cE/l/aW1Zs9NN5FEa9+cazPZxiRdFREASQJTYFxhqLoeyASuh3ys7uALYSJB7j8vqBlSITFzkO2IAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9093a6a74cb4d1155de4b00f9ac8e51a0aa193c9c084eb5ac8de6352d0da3bc7","last_reissued_at":"2026-07-05T11:09:12.458280Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:09:12.458280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.00701","source_version":2,"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-05T11:09:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g+R+b79qdSTNiVLndF8jf4W6LHUReBb/MgQfMlop/cRXK+R3mJGy8Gt4eUPpNdnMOExW8Qxrmi8dlIguiKxgBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T03:26:44.222616Z"},"content_sha256":"29bd4bb4eb84a4aa609ebeb083c1c9eaa2eee6d6aef5814e5fcdc423fd353bc1","schema_version":"1.0","event_id":"sha256:29bd4bb4eb84a4aa609ebeb083c1c9eaa2eee6d6aef5814e5fcdc423fd353bc1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:SCJ2NJ2MWTIRKXPEWAHZVSHFDI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A log-depth in-place quantum Fourier transform that rarely needs ancillas","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Craig Gidney, Gregory D. Kahanamoku-Meyer, Isaac L. Chuang, John Blue, Thiago Bergamaschi","submitted_at":"2025-05-01T17:58:36Z","abstract_excerpt":"When designing quantum circuits for a given unitary, it can be much cheaper to achieve a good approximation on most inputs than on all inputs. In this work we formalize this idea, and propose that such \"optimistic quantum circuits\" are often sufficient in the context of larger quantum algorithms. For the rare algorithm in which a subroutine needs to be a good approximation on all inputs, we provide a reduction which transforms optimistic circuits into general ones. Applying these ideas, we build an optimistic circuit for the in-place quantum Fourier transform (QFT). Our circuit has depth $O(\\l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.00701","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/2505.00701/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-05T11:09:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"paRX35Lahc5fnE1Rkkv+zh/do8cpFs280cDU039QCWSNdyiBn0ehSQU5XOxZ1jg8Rvb0gEF+LJe9TqhnpT6aDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T03:26:44.223377Z"},"content_sha256":"b168759170e7bbb52114894afe283b953841edc1c03ed3ebc92b0dbf48e9f4fb","schema_version":"1.0","event_id":"sha256:b168759170e7bbb52114894afe283b953841edc1c03ed3ebc92b0dbf48e9f4fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SCJ2NJ2MWTIRKXPEWAHZVSHFDI/bundle.json","state_url":"https://pith.science/pith/SCJ2NJ2MWTIRKXPEWAHZVSHFDI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SCJ2NJ2MWTIRKXPEWAHZVSHFDI/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-11T03:26:44Z","links":{"resolver":"https://pith.science/pith/SCJ2NJ2MWTIRKXPEWAHZVSHFDI","bundle":"https://pith.science/pith/SCJ2NJ2MWTIRKXPEWAHZVSHFDI/bundle.json","state":"https://pith.science/pith/SCJ2NJ2MWTIRKXPEWAHZVSHFDI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SCJ2NJ2MWTIRKXPEWAHZVSHFDI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:SCJ2NJ2MWTIRKXPEWAHZVSHFDI","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":"1adac170ac7fbd5a7d8d77733123a9f81d9f5e5b330b1ed004d13bd0062ba0e1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-05-01T17:58:36Z","title_canon_sha256":"405975802bb9712bc9af51bb34c267142db515c91d7e0950ed29310ff1d88048"},"schema_version":"1.0","source":{"id":"2505.00701","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.00701","created_at":"2026-07-05T11:09:12Z"},{"alias_kind":"arxiv_version","alias_value":"2505.00701v2","created_at":"2026-07-05T11:09:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.00701","created_at":"2026-07-05T11:09:12Z"},{"alias_kind":"pith_short_12","alias_value":"SCJ2NJ2MWTIR","created_at":"2026-07-05T11:09:12Z"},{"alias_kind":"pith_short_16","alias_value":"SCJ2NJ2MWTIRKXPE","created_at":"2026-07-05T11:09:12Z"},{"alias_kind":"pith_short_8","alias_value":"SCJ2NJ2M","created_at":"2026-07-05T11:09:12Z"}],"graph_snapshots":[{"event_id":"sha256:b168759170e7bbb52114894afe283b953841edc1c03ed3ebc92b0dbf48e9f4fb","target":"graph","created_at":"2026-07-05T11:09:12Z","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/2505.00701/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"When designing quantum circuits for a given unitary, it can be much cheaper to achieve a good approximation on most inputs than on all inputs. In this work we formalize this idea, and propose that such \"optimistic quantum circuits\" are often sufficient in the context of larger quantum algorithms. For the rare algorithm in which a subroutine needs to be a good approximation on all inputs, we provide a reduction which transforms optimistic circuits into general ones. Applying these ideas, we build an optimistic circuit for the in-place quantum Fourier transform (QFT). Our circuit has depth $O(\\l","authors_text":"Craig Gidney, Gregory D. Kahanamoku-Meyer, Isaac L. Chuang, John Blue, Thiago Bergamaschi","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-05-01T17:58:36Z","title":"A log-depth in-place quantum Fourier transform that rarely needs ancillas"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.00701","kind":"arxiv","version":2},"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:29bd4bb4eb84a4aa609ebeb083c1c9eaa2eee6d6aef5814e5fcdc423fd353bc1","target":"record","created_at":"2026-07-05T11:09:12Z","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":"1adac170ac7fbd5a7d8d77733123a9f81d9f5e5b330b1ed004d13bd0062ba0e1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-05-01T17:58:36Z","title_canon_sha256":"405975802bb9712bc9af51bb34c267142db515c91d7e0950ed29310ff1d88048"},"schema_version":"1.0","source":{"id":"2505.00701","kind":"arxiv","version":2}},"canonical_sha256":"9093a6a74cb4d1155de4b00f9ac8e51a0aa193c9c084eb5ac8de6352d0da3bc7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9093a6a74cb4d1155de4b00f9ac8e51a0aa193c9c084eb5ac8de6352d0da3bc7","first_computed_at":"2026-07-05T11:09:12.458280Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:09:12.458280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eZxcfPD3cE/l/aW1Zs9NN5FEa9+cazPZxiRdFREASQJTYFxhqLoeyASuh3ys7uALYSJB7j8vqBlSITFzkO2IAg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:09:12.458753Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.00701","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:29bd4bb4eb84a4aa609ebeb083c1c9eaa2eee6d6aef5814e5fcdc423fd353bc1","sha256:b168759170e7bbb52114894afe283b953841edc1c03ed3ebc92b0dbf48e9f4fb"],"state_sha256":"1e523ee93d77aa22891553df8ae2a4ea09366e893343d4bab43455e52a46dd48"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mTNg3IQl/6Rizp05GKAsH2XKbLAqky2xN9kPein9VK6PuKyD69uCxmmsmJGo282IjNVI8YoMibeDu01A0kZYAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T03:26:44.229946Z","bundle_sha256":"fcb0948faa75452934ce007a0505cf385f69d18dcb940ae7d0b01671cb63a4fd"}}