{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:B7YNYHR6C3YYBMOLRKWU3NL6OX","short_pith_number":"pith:B7YNYHR6","canonical_record":{"source":{"id":"1908.04171","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-08-12T14:29:42Z","cross_cats_sorted":[],"title_canon_sha256":"ecdc74ad6e6ad5a4571013a22d783e1158e07ee112e7a6f7c0e790a673075c40","abstract_canon_sha256":"c164cc6a8bd21b7577c97095173ef0b3e380198205ec94a19cc2a820dbf58132"},"schema_version":"1.0"},"canonical_sha256":"0ff0dc1e3e16f180b1cb8aad4db57e75edd1b7a282710a2ed463e3ed5f4e2c35","source":{"kind":"arxiv","id":"1908.04171","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.04171","created_at":"2026-07-05T00:51:03Z"},{"alias_kind":"arxiv_version","alias_value":"1908.04171v3","created_at":"2026-07-05T00:51:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04171","created_at":"2026-07-05T00:51:03Z"},{"alias_kind":"pith_short_12","alias_value":"B7YNYHR6C3YY","created_at":"2026-07-05T00:51:03Z"},{"alias_kind":"pith_short_16","alias_value":"B7YNYHR6C3YYBMOL","created_at":"2026-07-05T00:51:03Z"},{"alias_kind":"pith_short_8","alias_value":"B7YNYHR6","created_at":"2026-07-05T00:51:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:B7YNYHR6C3YYBMOLRKWU3NL6OX","target":"record","payload":{"canonical_record":{"source":{"id":"1908.04171","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-08-12T14:29:42Z","cross_cats_sorted":[],"title_canon_sha256":"ecdc74ad6e6ad5a4571013a22d783e1158e07ee112e7a6f7c0e790a673075c40","abstract_canon_sha256":"c164cc6a8bd21b7577c97095173ef0b3e380198205ec94a19cc2a820dbf58132"},"schema_version":"1.0"},"canonical_sha256":"0ff0dc1e3e16f180b1cb8aad4db57e75edd1b7a282710a2ed463e3ed5f4e2c35","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:51:03.368657Z","signature_b64":"f6qzzENdkW+7zbdB3fiHg4q5BzINvj4qQrh5uWgWEk/zYv0RfLCFwNmEAzcDnR7XfP+2FpP+HtvJgLU10JvMCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ff0dc1e3e16f180b1cb8aad4db57e75edd1b7a282710a2ed463e3ed5f4e2c35","last_reissued_at":"2026-07-05T00:51:03.368244Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:51:03.368244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.04171","source_version":3,"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-05T00:51:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E1bwHBqEYUWS1ifmWF0DvDbeDM2Oef0S7X0Y2a6Rub04aoC8gHTNyIsTzgR+sfjTb0W1daaPt7DnnHYR6FtPBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T21:59:15.446790Z"},"content_sha256":"0c1ee055a85cfd5805eb454b4f43a611266c9e181d06503ad94ec24c72a47af5","schema_version":"1.0","event_id":"sha256:0c1ee055a85cfd5805eb454b4f43a611266c9e181d06503ad94ec24c72a47af5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:B7YNYHR6C3YYBMOLRKWU3NL6OX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Depth optimization of quantum search algorithms beyond Grover's algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Kun Zhang, Vladimir E. Korepin","submitted_at":"2019-08-12T14:29:42Z","abstract_excerpt":"Grover's quantum search algorithm provides a quadratic speedup over the classical one. The computational complexity is based on the number of queries to the oracle. However, depth is a more modern metric for noisy intermediate-scale quantum computers. We propose a new depth optimization method for quantum search algorithms. We show that Grover's algorithm is not optimal in depth. We propose a quantum search algorithm, which can be divided into several stages. Each stage has a new initialization, which is a rescaling of the database. This decreases errors. The multistage design is natural for p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04171","kind":"arxiv","version":3},"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/1908.04171/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-05T00:51:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AFZL842GDZ5yVwRVA+yiEP/0aBCqc4FY/J+TEcsKVyPs8zZwQp0000wm5u5owI/3rtNvo2co43F1SDnxDOmVCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T21:59:15.447321Z"},"content_sha256":"170d6151f6e38d1a7d5297ec03db6c49768c4bf3c7d5b335ac1056ecb064e74a","schema_version":"1.0","event_id":"sha256:170d6151f6e38d1a7d5297ec03db6c49768c4bf3c7d5b335ac1056ecb064e74a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B7YNYHR6C3YYBMOLRKWU3NL6OX/bundle.json","state_url":"https://pith.science/pith/B7YNYHR6C3YYBMOLRKWU3NL6OX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B7YNYHR6C3YYBMOLRKWU3NL6OX/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-15T21:59:15Z","links":{"resolver":"https://pith.science/pith/B7YNYHR6C3YYBMOLRKWU3NL6OX","bundle":"https://pith.science/pith/B7YNYHR6C3YYBMOLRKWU3NL6OX/bundle.json","state":"https://pith.science/pith/B7YNYHR6C3YYBMOLRKWU3NL6OX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B7YNYHR6C3YYBMOLRKWU3NL6OX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:B7YNYHR6C3YYBMOLRKWU3NL6OX","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":"c164cc6a8bd21b7577c97095173ef0b3e380198205ec94a19cc2a820dbf58132","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-08-12T14:29:42Z","title_canon_sha256":"ecdc74ad6e6ad5a4571013a22d783e1158e07ee112e7a6f7c0e790a673075c40"},"schema_version":"1.0","source":{"id":"1908.04171","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.04171","created_at":"2026-07-05T00:51:03Z"},{"alias_kind":"arxiv_version","alias_value":"1908.04171v3","created_at":"2026-07-05T00:51:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04171","created_at":"2026-07-05T00:51:03Z"},{"alias_kind":"pith_short_12","alias_value":"B7YNYHR6C3YY","created_at":"2026-07-05T00:51:03Z"},{"alias_kind":"pith_short_16","alias_value":"B7YNYHR6C3YYBMOL","created_at":"2026-07-05T00:51:03Z"},{"alias_kind":"pith_short_8","alias_value":"B7YNYHR6","created_at":"2026-07-05T00:51:03Z"}],"graph_snapshots":[{"event_id":"sha256:170d6151f6e38d1a7d5297ec03db6c49768c4bf3c7d5b335ac1056ecb064e74a","target":"graph","created_at":"2026-07-05T00:51:03Z","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/1908.04171/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Grover's quantum search algorithm provides a quadratic speedup over the classical one. The computational complexity is based on the number of queries to the oracle. However, depth is a more modern metric for noisy intermediate-scale quantum computers. We propose a new depth optimization method for quantum search algorithms. We show that Grover's algorithm is not optimal in depth. We propose a quantum search algorithm, which can be divided into several stages. Each stage has a new initialization, which is a rescaling of the database. This decreases errors. The multistage design is natural for p","authors_text":"Kun Zhang, Vladimir E. Korepin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-08-12T14:29:42Z","title":"Depth optimization of quantum search algorithms beyond Grover's algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04171","kind":"arxiv","version":3},"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:0c1ee055a85cfd5805eb454b4f43a611266c9e181d06503ad94ec24c72a47af5","target":"record","created_at":"2026-07-05T00:51:03Z","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":"c164cc6a8bd21b7577c97095173ef0b3e380198205ec94a19cc2a820dbf58132","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-08-12T14:29:42Z","title_canon_sha256":"ecdc74ad6e6ad5a4571013a22d783e1158e07ee112e7a6f7c0e790a673075c40"},"schema_version":"1.0","source":{"id":"1908.04171","kind":"arxiv","version":3}},"canonical_sha256":"0ff0dc1e3e16f180b1cb8aad4db57e75edd1b7a282710a2ed463e3ed5f4e2c35","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ff0dc1e3e16f180b1cb8aad4db57e75edd1b7a282710a2ed463e3ed5f4e2c35","first_computed_at":"2026-07-05T00:51:03.368244Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:51:03.368244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f6qzzENdkW+7zbdB3fiHg4q5BzINvj4qQrh5uWgWEk/zYv0RfLCFwNmEAzcDnR7XfP+2FpP+HtvJgLU10JvMCg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:51:03.368657Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.04171","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c1ee055a85cfd5805eb454b4f43a611266c9e181d06503ad94ec24c72a47af5","sha256:170d6151f6e38d1a7d5297ec03db6c49768c4bf3c7d5b335ac1056ecb064e74a"],"state_sha256":"a8235d27524f74a4f8e21361d7593a7c18d1be9a7c7690c41a785314682668fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dll3JARmWHW8E9HGDwg+uoKgKMwRyablCGKU5nt/bSGrCVLIhgGNg9IWCRxyz74evfS91OhG0e1rsSkwRfn5AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T21:59:15.450800Z","bundle_sha256":"91c51015a48a7af453ea36e8361f8a328072350911ae7bd856d2279a21a7bca3"}}