{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:KZM5DURP2XWWZEJHD2R744ZRU7","short_pith_number":"pith:KZM5DURP","canonical_record":{"source":{"id":"2202.11443","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-02-23T11:43:17Z","cross_cats_sorted":[],"title_canon_sha256":"c7967ad3cdd8ffbd18d6955f23c011008822653266c244c4d08fe6dbfdefbce0","abstract_canon_sha256":"c4b86b10b04229f6b6f51c53e1c0a6143cf9aca6b57eb4ec67111ca4c333ee76"},"schema_version":"1.0"},"canonical_sha256":"5659d1d22fd5ed6c91271ea3fe7331a7c3c8668f5623d5cf6202683c8f0632ce","source":{"kind":"arxiv","id":"2202.11443","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.11443","created_at":"2026-07-05T06:17:36Z"},{"alias_kind":"arxiv_version","alias_value":"2202.11443v2","created_at":"2026-07-05T06:17:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.11443","created_at":"2026-07-05T06:17:36Z"},{"alias_kind":"pith_short_12","alias_value":"KZM5DURP2XWW","created_at":"2026-07-05T06:17:36Z"},{"alias_kind":"pith_short_16","alias_value":"KZM5DURP2XWWZEJH","created_at":"2026-07-05T06:17:36Z"},{"alias_kind":"pith_short_8","alias_value":"KZM5DURP","created_at":"2026-07-05T06:17:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:KZM5DURP2XWWZEJHD2R744ZRU7","target":"record","payload":{"canonical_record":{"source":{"id":"2202.11443","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-02-23T11:43:17Z","cross_cats_sorted":[],"title_canon_sha256":"c7967ad3cdd8ffbd18d6955f23c011008822653266c244c4d08fe6dbfdefbce0","abstract_canon_sha256":"c4b86b10b04229f6b6f51c53e1c0a6143cf9aca6b57eb4ec67111ca4c333ee76"},"schema_version":"1.0"},"canonical_sha256":"5659d1d22fd5ed6c91271ea3fe7331a7c3c8668f5623d5cf6202683c8f0632ce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:17:36.849442Z","signature_b64":"WmLMEBVtVBvuxEVJRmWY1aHv2xWQQISVYEUjaTtHzT7H3jX7EMvNeeCJAROUj+1HeY00dr4Zi60cguKdX2KCBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5659d1d22fd5ed6c91271ea3fe7331a7c3c8668f5623d5cf6202683c8f0632ce","last_reissued_at":"2026-07-05T06:17:36.848956Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:17:36.848956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2202.11443","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-05T06:17:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N2rcQa4Kl/7xUKtOT5ojNMvFypml4uQIT+oJckUkynkDG/FjtVDd2IbyPPRzfqpQMWZ2VCurlbj2fjtC6RZlDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T12:00:05.563293Z"},"content_sha256":"4e938dfe58290f51c9cf3c9d4255b9f3b4e3a3024351a60c8d65b091eb65de70","schema_version":"1.0","event_id":"sha256:4e938dfe58290f51c9cf3c9d4255b9f3b4e3a3024351a60c8d65b091eb65de70"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:KZM5DURP2XWWZEJHD2R744ZRU7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hybrid Quantum-Classical Search Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ansis Rosmanis","submitted_at":"2022-02-23T11:43:17Z","abstract_excerpt":"Search is one of the most commonly used primitives in quantum algorithm design. It is known that quadratic speedups provided by Grover's algorithm are optimal, and no faster quantum algorithms for Search exist. While it is known that at least some quantum computation is required to achieve these speedups, the existing bounds do not rule out the possibility of an equally fast hybrid quantum-classical algorithm where most of the computation is classical. In this work, we study such hybrid algorithms and we show that classical computation, unless it by itself can solve the Search problem, cannot "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.11443","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/2202.11443/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-05T06:17:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QUwgO7Ru+gZZNOgIYldE3UkKajJDXHucCBIW5RbDfNld89KtPorIc8p2ZQdy78Xi1YdgZ9dOmdkoYvO18jOvBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T12:00:05.563845Z"},"content_sha256":"9259485801de4660aed67eaad53d15104788a70aef273415c7dc9a97c835540e","schema_version":"1.0","event_id":"sha256:9259485801de4660aed67eaad53d15104788a70aef273415c7dc9a97c835540e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KZM5DURP2XWWZEJHD2R744ZRU7/bundle.json","state_url":"https://pith.science/pith/KZM5DURP2XWWZEJHD2R744ZRU7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KZM5DURP2XWWZEJHD2R744ZRU7/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-13T12:00:05Z","links":{"resolver":"https://pith.science/pith/KZM5DURP2XWWZEJHD2R744ZRU7","bundle":"https://pith.science/pith/KZM5DURP2XWWZEJHD2R744ZRU7/bundle.json","state":"https://pith.science/pith/KZM5DURP2XWWZEJHD2R744ZRU7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KZM5DURP2XWWZEJHD2R744ZRU7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:KZM5DURP2XWWZEJHD2R744ZRU7","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":"c4b86b10b04229f6b6f51c53e1c0a6143cf9aca6b57eb4ec67111ca4c333ee76","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-02-23T11:43:17Z","title_canon_sha256":"c7967ad3cdd8ffbd18d6955f23c011008822653266c244c4d08fe6dbfdefbce0"},"schema_version":"1.0","source":{"id":"2202.11443","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.11443","created_at":"2026-07-05T06:17:36Z"},{"alias_kind":"arxiv_version","alias_value":"2202.11443v2","created_at":"2026-07-05T06:17:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.11443","created_at":"2026-07-05T06:17:36Z"},{"alias_kind":"pith_short_12","alias_value":"KZM5DURP2XWW","created_at":"2026-07-05T06:17:36Z"},{"alias_kind":"pith_short_16","alias_value":"KZM5DURP2XWWZEJH","created_at":"2026-07-05T06:17:36Z"},{"alias_kind":"pith_short_8","alias_value":"KZM5DURP","created_at":"2026-07-05T06:17:36Z"}],"graph_snapshots":[{"event_id":"sha256:9259485801de4660aed67eaad53d15104788a70aef273415c7dc9a97c835540e","target":"graph","created_at":"2026-07-05T06:17:36Z","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/2202.11443/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Search is one of the most commonly used primitives in quantum algorithm design. It is known that quadratic speedups provided by Grover's algorithm are optimal, and no faster quantum algorithms for Search exist. While it is known that at least some quantum computation is required to achieve these speedups, the existing bounds do not rule out the possibility of an equally fast hybrid quantum-classical algorithm where most of the computation is classical. In this work, we study such hybrid algorithms and we show that classical computation, unless it by itself can solve the Search problem, cannot ","authors_text":"Ansis Rosmanis","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-02-23T11:43:17Z","title":"Hybrid Quantum-Classical Search Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.11443","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:4e938dfe58290f51c9cf3c9d4255b9f3b4e3a3024351a60c8d65b091eb65de70","target":"record","created_at":"2026-07-05T06:17:36Z","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":"c4b86b10b04229f6b6f51c53e1c0a6143cf9aca6b57eb4ec67111ca4c333ee76","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-02-23T11:43:17Z","title_canon_sha256":"c7967ad3cdd8ffbd18d6955f23c011008822653266c244c4d08fe6dbfdefbce0"},"schema_version":"1.0","source":{"id":"2202.11443","kind":"arxiv","version":2}},"canonical_sha256":"5659d1d22fd5ed6c91271ea3fe7331a7c3c8668f5623d5cf6202683c8f0632ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5659d1d22fd5ed6c91271ea3fe7331a7c3c8668f5623d5cf6202683c8f0632ce","first_computed_at":"2026-07-05T06:17:36.848956Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:17:36.848956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WmLMEBVtVBvuxEVJRmWY1aHv2xWQQISVYEUjaTtHzT7H3jX7EMvNeeCJAROUj+1HeY00dr4Zi60cguKdX2KCBg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:17:36.849442Z","signed_message":"canonical_sha256_bytes"},"source_id":"2202.11443","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e938dfe58290f51c9cf3c9d4255b9f3b4e3a3024351a60c8d65b091eb65de70","sha256:9259485801de4660aed67eaad53d15104788a70aef273415c7dc9a97c835540e"],"state_sha256":"d9b999af652c46ae2f44c92678455691d33fd14e2496b6defd96dd957f988c35"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EDOFX1sW4z2/GeCAy1NF1Nf/uqCuTldg/n4S3jcj8Eb/im1IbRhCwdiiEzfBnk3uuXYLN6O+hH2iKdKR2yYGBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T12:00:05.569003Z","bundle_sha256":"74b6392ba3881df01b195d5194c78a1fc3c3b6b66b9e9119157b74e69603ad18"}}