{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2000:3BD7WUYQGMIMHVBZY3CKONIGIX","short_pith_number":"pith:3BD7WUYQ","canonical_record":{"source":{"id":"quant-ph/0006004","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2000-06-01T18:45:53Z","cross_cats_sorted":[],"title_canon_sha256":"24f3401cf516724c7493a3cb94740a926e9a0388e5e4d09bb407bc134ef262e4","abstract_canon_sha256":"4ab2b44102a90eb8149603ec7247e0def4e25657600c4000ca57fd6a3d437ee0"},"schema_version":"1.0"},"canonical_sha256":"d847fb53103310c3d439c6c4a7350645df349dc9e58db082f47808a497d90add","source":{"kind":"arxiv","id":"quant-ph/0006004","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0006004","created_at":"2026-07-04T14:45:28Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0006004v1","created_at":"2026-07-04T14:45:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0006004","created_at":"2026-07-04T14:45:28Z"},{"alias_kind":"pith_short_12","alias_value":"3BD7WUYQGMIM","created_at":"2026-07-04T14:45:28Z"},{"alias_kind":"pith_short_16","alias_value":"3BD7WUYQGMIMHVBZ","created_at":"2026-07-04T14:45:28Z"},{"alias_kind":"pith_short_8","alias_value":"3BD7WUYQ","created_at":"2026-07-04T14:45:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2000:3BD7WUYQGMIMHVBZY3CKONIGIX","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0006004","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2000-06-01T18:45:53Z","cross_cats_sorted":[],"title_canon_sha256":"24f3401cf516724c7493a3cb94740a926e9a0388e5e4d09bb407bc134ef262e4","abstract_canon_sha256":"4ab2b44102a90eb8149603ec7247e0def4e25657600c4000ca57fd6a3d437ee0"},"schema_version":"1.0"},"canonical_sha256":"d847fb53103310c3d439c6c4a7350645df349dc9e58db082f47808a497d90add","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:45:28.998166Z","signature_b64":"gxTCh1V5DcRJ/NsKWSTnze7LgLmd7a0s/29OAy+V7wz2L+X2HMmpb3seKv5SL+r1JGH3MiXBIQ5ThoUNz+y8CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d847fb53103310c3d439c6c4a7350645df349dc9e58db082f47808a497d90add","last_reissued_at":"2026-07-04T14:45:28.997803Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:45:28.997803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0006004","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-04T14:45:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cAFSl0upjyz3nqjrE4a0XstqqHDLGUfz5vqwuwKEsRTLwT0g9eGoeewK6ngam8SEGEaQdGig/1TnMLvC6jTYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T16:57:43.894824Z"},"content_sha256":"a121b0165f30515ad2d6c14b3cf5b90e9ff17f0a6158815e71067c9562b4d9fd","schema_version":"1.0","event_id":"sha256:a121b0165f30515ad2d6c14b3cf5b90e9ff17f0a6158815e71067c9562b4d9fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2000:3BD7WUYQGMIMHVBZY3CKONIGIX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast parallel circuits for the quantum Fourier transform","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"John Watrous (University of Calgary), Richard Cleve","submitted_at":"2000-06-01T18:45:53Z","abstract_excerpt":"We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of O(log n + log log (1/epsilon)) on the circuit depth for computing an approximation of the QFT with respect to the modulus 2^n with error bounded by epsilon. Thus, even for exponentially small error, our circuits have depth O(log n). The best previous depth bound was O(n), even for approximations with constant error. Moreover, our circuits have size O(n log (n/epsilon)). We also give an upper bound of O(n (log n)^2 log log n) on the circuit size of the exact QFT modulo 2^n, for which t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0006004","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/quant-ph/0006004/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-04T14:45:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dR7h/KM9ur8+tNfovwSuTbGi2Q3Twc1uVvPaow/imkVJwtNPMW23ii5SylL7o0HAf84CQ9gSPa5NUCYNbCyLDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T16:57:43.895343Z"},"content_sha256":"67c7ae163288933842aee31138deb424ba671e04edc9d402ae04cd7987db518d","schema_version":"1.0","event_id":"sha256:67c7ae163288933842aee31138deb424ba671e04edc9d402ae04cd7987db518d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3BD7WUYQGMIMHVBZY3CKONIGIX/bundle.json","state_url":"https://pith.science/pith/3BD7WUYQGMIMHVBZY3CKONIGIX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3BD7WUYQGMIMHVBZY3CKONIGIX/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-16T16:57:43Z","links":{"resolver":"https://pith.science/pith/3BD7WUYQGMIMHVBZY3CKONIGIX","bundle":"https://pith.science/pith/3BD7WUYQGMIMHVBZY3CKONIGIX/bundle.json","state":"https://pith.science/pith/3BD7WUYQGMIMHVBZY3CKONIGIX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3BD7WUYQGMIMHVBZY3CKONIGIX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2000:3BD7WUYQGMIMHVBZY3CKONIGIX","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":"4ab2b44102a90eb8149603ec7247e0def4e25657600c4000ca57fd6a3d437ee0","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2000-06-01T18:45:53Z","title_canon_sha256":"24f3401cf516724c7493a3cb94740a926e9a0388e5e4d09bb407bc134ef262e4"},"schema_version":"1.0","source":{"id":"quant-ph/0006004","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0006004","created_at":"2026-07-04T14:45:28Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0006004v1","created_at":"2026-07-04T14:45:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0006004","created_at":"2026-07-04T14:45:28Z"},{"alias_kind":"pith_short_12","alias_value":"3BD7WUYQGMIM","created_at":"2026-07-04T14:45:28Z"},{"alias_kind":"pith_short_16","alias_value":"3BD7WUYQGMIMHVBZ","created_at":"2026-07-04T14:45:28Z"},{"alias_kind":"pith_short_8","alias_value":"3BD7WUYQ","created_at":"2026-07-04T14:45:28Z"}],"graph_snapshots":[{"event_id":"sha256:67c7ae163288933842aee31138deb424ba671e04edc9d402ae04cd7987db518d","target":"graph","created_at":"2026-07-04T14:45:28Z","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/quant-ph/0006004/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of O(log n + log log (1/epsilon)) on the circuit depth for computing an approximation of the QFT with respect to the modulus 2^n with error bounded by epsilon. Thus, even for exponentially small error, our circuits have depth O(log n). The best previous depth bound was O(n), even for approximations with constant error. Moreover, our circuits have size O(n log (n/epsilon)). We also give an upper bound of O(n (log n)^2 log log n) on the circuit size of the exact QFT modulo 2^n, for which t","authors_text":"John Watrous (University of Calgary), Richard Cleve","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2000-06-01T18:45:53Z","title":"Fast parallel circuits for the quantum Fourier transform"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0006004","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:a121b0165f30515ad2d6c14b3cf5b90e9ff17f0a6158815e71067c9562b4d9fd","target":"record","created_at":"2026-07-04T14:45:28Z","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":"4ab2b44102a90eb8149603ec7247e0def4e25657600c4000ca57fd6a3d437ee0","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2000-06-01T18:45:53Z","title_canon_sha256":"24f3401cf516724c7493a3cb94740a926e9a0388e5e4d09bb407bc134ef262e4"},"schema_version":"1.0","source":{"id":"quant-ph/0006004","kind":"arxiv","version":1}},"canonical_sha256":"d847fb53103310c3d439c6c4a7350645df349dc9e58db082f47808a497d90add","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d847fb53103310c3d439c6c4a7350645df349dc9e58db082f47808a497d90add","first_computed_at":"2026-07-04T14:45:28.997803Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:45:28.997803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gxTCh1V5DcRJ/NsKWSTnze7LgLmd7a0s/29OAy+V7wz2L+X2HMmpb3seKv5SL+r1JGH3MiXBIQ5ThoUNz+y8CQ==","signature_status":"signed_v1","signed_at":"2026-07-04T14:45:28.998166Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0006004","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a121b0165f30515ad2d6c14b3cf5b90e9ff17f0a6158815e71067c9562b4d9fd","sha256:67c7ae163288933842aee31138deb424ba671e04edc9d402ae04cd7987db518d"],"state_sha256":"d9bc4f598164687203c6f986d14b684eb588d1956666c5ceb4107ae88cb1ce73"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"25gOXl/8R93r7PhK6R/u+9JKNrOwFQ4kiWty9Q3VdGu62b33u+inPTAXmHRIBZg8vPX0abHwfdGBROc15RXDAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T16:57:43.899191Z","bundle_sha256":"15726c24e44e376b20c3b3b16e1ad6793750a19c377559bdb004987b47e665c6"}}