{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:O2JTVEBWRWYLHMQ3MKUHD4J4ZU","short_pith_number":"pith:O2JTVEBW","canonical_record":{"source":{"id":"2309.14944","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-09-26T14:00:23Z","cross_cats_sorted":[],"title_canon_sha256":"729a408337b0a84a6245d838b281c00023785b1ad2e56198199d66b1f72a0d17","abstract_canon_sha256":"1f724949cacea179c9ce9659d124f2362597c6608c1b9876a5e81da39aca02eb"},"schema_version":"1.0"},"canonical_sha256":"76933a90368db0b3b21b62a871f13ccd2ef0e1b48c55ea6134d80517eda6309f","source":{"kind":"arxiv","id":"2309.14944","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.14944","created_at":"2026-07-05T06:54:31Z"},{"alias_kind":"arxiv_version","alias_value":"2309.14944v1","created_at":"2026-07-05T06:54:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.14944","created_at":"2026-07-05T06:54:31Z"},{"alias_kind":"pith_short_12","alias_value":"O2JTVEBWRWYL","created_at":"2026-07-05T06:54:31Z"},{"alias_kind":"pith_short_16","alias_value":"O2JTVEBWRWYLHMQ3","created_at":"2026-07-05T06:54:31Z"},{"alias_kind":"pith_short_8","alias_value":"O2JTVEBW","created_at":"2026-07-05T06:54:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:O2JTVEBWRWYLHMQ3MKUHD4J4ZU","target":"record","payload":{"canonical_record":{"source":{"id":"2309.14944","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-09-26T14:00:23Z","cross_cats_sorted":[],"title_canon_sha256":"729a408337b0a84a6245d838b281c00023785b1ad2e56198199d66b1f72a0d17","abstract_canon_sha256":"1f724949cacea179c9ce9659d124f2362597c6608c1b9876a5e81da39aca02eb"},"schema_version":"1.0"},"canonical_sha256":"76933a90368db0b3b21b62a871f13ccd2ef0e1b48c55ea6134d80517eda6309f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:54:31.925812Z","signature_b64":"bBHGhsbTBTIq8hmVrsFn+cRRytmGtSIsIIGXGJBuYuMFJcmg2eN+DVjQGMaG7J6GSlKNvE6gxtrPJwDA7fDRCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76933a90368db0b3b21b62a871f13ccd2ef0e1b48c55ea6134d80517eda6309f","last_reissued_at":"2026-07-05T06:54:31.925430Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:54:31.925430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2309.14944","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-05T06:54:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r2GzbM3TnkbcDhRr+jhlFfsAhCU2bBfVRIRGfHxiCIIirV1KX8PKCc0pyy4sP+GqgRc5E9tVIGUiYWqIhMYwCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T02:23:38.204355Z"},"content_sha256":"7671ecc889abb06a5f7e9532ad58618038a65d13b9db4c372262c2dc96533855","schema_version":"1.0","event_id":"sha256:7671ecc889abb06a5f7e9532ad58618038a65d13b9db4c372262c2dc96533855"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:O2JTVEBWRWYLHMQ3MKUHD4J4ZU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Search with Noisy Oracle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ansis Rosmanis","submitted_at":"2023-09-26T14:00:23Z","abstract_excerpt":"We consider quantum search algorithms that have access to a noisy oracle that, for every oracle call, with probability $p>0$ completely depolarizes the query registers, while otherwise working properly. Previous results had not ruled out quantum $\\mathrm{O}(\\sqrt{n})$-query algorithms in this setting, even for constant $p$. We show that, for all $p\\le 0.99$, the quantum noisy-query complexity of the unstructured search is $\\tilde\\Theta(\\max\\{np,\\sqrt{n}\\})$. The lower bound $\\Omega(\\max\\{np,\\sqrt n\\})$ holds also for the dephasing noise and even when, for every oracle call, the algorithm is pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.14944","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/2309.14944/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:54:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FwFyfBDXoOkBJ3DPnsyhpsq0VZ6+g8tWFVNucn/i4PNQO4vMY4IPgG6bPhvyO3ZK8YkzsWqrWvzS1z0Q3WQ8DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T02:23:38.204910Z"},"content_sha256":"96adebf8dd43f066f4cf9e7ed98ffb13983df8278127623d56712bf0e2afd875","schema_version":"1.0","event_id":"sha256:96adebf8dd43f066f4cf9e7ed98ffb13983df8278127623d56712bf0e2afd875"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O2JTVEBWRWYLHMQ3MKUHD4J4ZU/bundle.json","state_url":"https://pith.science/pith/O2JTVEBWRWYLHMQ3MKUHD4J4ZU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O2JTVEBWRWYLHMQ3MKUHD4J4ZU/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-15T02:23:38Z","links":{"resolver":"https://pith.science/pith/O2JTVEBWRWYLHMQ3MKUHD4J4ZU","bundle":"https://pith.science/pith/O2JTVEBWRWYLHMQ3MKUHD4J4ZU/bundle.json","state":"https://pith.science/pith/O2JTVEBWRWYLHMQ3MKUHD4J4ZU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O2JTVEBWRWYLHMQ3MKUHD4J4ZU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:O2JTVEBWRWYLHMQ3MKUHD4J4ZU","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":"1f724949cacea179c9ce9659d124f2362597c6608c1b9876a5e81da39aca02eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-09-26T14:00:23Z","title_canon_sha256":"729a408337b0a84a6245d838b281c00023785b1ad2e56198199d66b1f72a0d17"},"schema_version":"1.0","source":{"id":"2309.14944","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.14944","created_at":"2026-07-05T06:54:31Z"},{"alias_kind":"arxiv_version","alias_value":"2309.14944v1","created_at":"2026-07-05T06:54:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.14944","created_at":"2026-07-05T06:54:31Z"},{"alias_kind":"pith_short_12","alias_value":"O2JTVEBWRWYL","created_at":"2026-07-05T06:54:31Z"},{"alias_kind":"pith_short_16","alias_value":"O2JTVEBWRWYLHMQ3","created_at":"2026-07-05T06:54:31Z"},{"alias_kind":"pith_short_8","alias_value":"O2JTVEBW","created_at":"2026-07-05T06:54:31Z"}],"graph_snapshots":[{"event_id":"sha256:96adebf8dd43f066f4cf9e7ed98ffb13983df8278127623d56712bf0e2afd875","target":"graph","created_at":"2026-07-05T06:54:31Z","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/2309.14944/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider quantum search algorithms that have access to a noisy oracle that, for every oracle call, with probability $p>0$ completely depolarizes the query registers, while otherwise working properly. Previous results had not ruled out quantum $\\mathrm{O}(\\sqrt{n})$-query algorithms in this setting, even for constant $p$. We show that, for all $p\\le 0.99$, the quantum noisy-query complexity of the unstructured search is $\\tilde\\Theta(\\max\\{np,\\sqrt{n}\\})$. The lower bound $\\Omega(\\max\\{np,\\sqrt n\\})$ holds also for the dephasing noise and even when, for every oracle call, the algorithm is pr","authors_text":"Ansis Rosmanis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-09-26T14:00:23Z","title":"Quantum Search with Noisy Oracle"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.14944","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:7671ecc889abb06a5f7e9532ad58618038a65d13b9db4c372262c2dc96533855","target":"record","created_at":"2026-07-05T06:54:31Z","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":"1f724949cacea179c9ce9659d124f2362597c6608c1b9876a5e81da39aca02eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-09-26T14:00:23Z","title_canon_sha256":"729a408337b0a84a6245d838b281c00023785b1ad2e56198199d66b1f72a0d17"},"schema_version":"1.0","source":{"id":"2309.14944","kind":"arxiv","version":1}},"canonical_sha256":"76933a90368db0b3b21b62a871f13ccd2ef0e1b48c55ea6134d80517eda6309f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76933a90368db0b3b21b62a871f13ccd2ef0e1b48c55ea6134d80517eda6309f","first_computed_at":"2026-07-05T06:54:31.925430Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:54:31.925430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bBHGhsbTBTIq8hmVrsFn+cRRytmGtSIsIIGXGJBuYuMFJcmg2eN+DVjQGMaG7J6GSlKNvE6gxtrPJwDA7fDRCA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:54:31.925812Z","signed_message":"canonical_sha256_bytes"},"source_id":"2309.14944","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7671ecc889abb06a5f7e9532ad58618038a65d13b9db4c372262c2dc96533855","sha256:96adebf8dd43f066f4cf9e7ed98ffb13983df8278127623d56712bf0e2afd875"],"state_sha256":"ebc575464de19c1f9a5b705c7fa7ef5ac984abc82f6a6dde5fb37d6ee7f84652"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uxX4ZuUlLhxCE7bEWI8CPtrphH2wzDryTY/A8n92tLAcfL8fCyRYf5xOyaX+KKkpX/wtk3a+WJjPdwGSOdyYAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T02:23:38.208981Z","bundle_sha256":"22540e4bff4a1394bafd114500cae2e0d05386a1a35d5db8267d054dbf32f4ea"}}