{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:2AG4OY4VUB63KSHQV2B6MJMTGU","short_pith_number":"pith:2AG4OY4V","schema_version":"1.0","canonical_sha256":"d00dc76395a07db548f0ae83e62593353fcc5a184b703e939a0a85fbbe63536a","source":{"kind":"arxiv","id":"quant-ph/0703231","version":2},"attestation_state":"computed","paper":{"title":"Quantum Search in an Ordered List via Adaptive Learning","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Avinatan Hassidim, M. Ben-Or","submitted_at":"2007-03-24T21:34:56Z","abstract_excerpt":"We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants:\n  1. Each comparison can be erroneous with some probability $1 - p$. 2. At each stage $k$ comparisons can be performed in parallel and a noisy answer is returned\n  We present a (classic) algorithm which optimally solves both variants together, up to an additive term of O(\\log \\log(n)), and prove matching information theoretic lower bounds. We use the algorithm to improve the results of Farhi et al \\cite{FGGS99} presenting a quantum (error free) search algorithm in an ordered list of expect"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"quant-ph/0703231","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2007-03-24T21:34:56Z","cross_cats_sorted":[],"title_canon_sha256":"44a2087d468456a0c41db588ca8fb2909f233bd1c976cdad616cd6ee22b74708","abstract_canon_sha256":"321747ac22ee40635a6735f2bff940c015d1fda53e7d75e3039c31f3e9a961bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:45.505531Z","signature_b64":"uhfgeAK9IwDH4GK8Kx9ev6A5fk/h+wR8k7I1mK3I2RVWOwU5zJFtN5ilRiLHSXlvhqjTUUemOFG6nDAo0KX6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d00dc76395a07db548f0ae83e62593353fcc5a184b703e939a0a85fbbe63536a","last_reissued_at":"2026-05-18T04:08:45.505078Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:45.505078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Search in an Ordered List via Adaptive Learning","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Avinatan Hassidim, M. Ben-Or","submitted_at":"2007-03-24T21:34:56Z","abstract_excerpt":"We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants:\n  1. Each comparison can be erroneous with some probability $1 - p$. 2. At each stage $k$ comparisons can be performed in parallel and a noisy answer is returned\n  We present a (classic) algorithm which optimally solves both variants together, up to an additive term of O(\\log \\log(n)), and prove matching information theoretic lower bounds. We use the algorithm to improve the results of Farhi et al \\cite{FGGS99} presenting a quantum (error free) search algorithm in an ordered list of expect"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0703231","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0703231","created_at":"2026-05-18T04:08:45.505150+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0703231v2","created_at":"2026-05-18T04:08:45.505150+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0703231","created_at":"2026-05-18T04:08:45.505150+00:00"},{"alias_kind":"pith_short_12","alias_value":"2AG4OY4VUB63","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"2AG4OY4VUB63KSHQ","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"2AG4OY4V","created_at":"2026-05-18T12:25:54.717736+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2406.12086","citing_title":"A shortcut to an optimal quantum linear system solver","ref_index":22,"is_internal_anchor":true},{"citing_arxiv_id":"2605.12385","citing_title":"Lower overhead fault-tolerant building blocks for noisy quantum computers","ref_index":291,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2AG4OY4VUB63KSHQV2B6MJMTGU","json":"https://pith.science/pith/2AG4OY4VUB63KSHQV2B6MJMTGU.json","graph_json":"https://pith.science/api/pith-number/2AG4OY4VUB63KSHQV2B6MJMTGU/graph.json","events_json":"https://pith.science/api/pith-number/2AG4OY4VUB63KSHQV2B6MJMTGU/events.json","paper":"https://pith.science/paper/2AG4OY4V"},"agent_actions":{"view_html":"https://pith.science/pith/2AG4OY4VUB63KSHQV2B6MJMTGU","download_json":"https://pith.science/pith/2AG4OY4VUB63KSHQV2B6MJMTGU.json","view_paper":"https://pith.science/paper/2AG4OY4V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0703231&json=true","fetch_graph":"https://pith.science/api/pith-number/2AG4OY4VUB63KSHQV2B6MJMTGU/graph.json","fetch_events":"https://pith.science/api/pith-number/2AG4OY4VUB63KSHQV2B6MJMTGU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2AG4OY4VUB63KSHQV2B6MJMTGU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2AG4OY4VUB63KSHQV2B6MJMTGU/action/storage_attestation","attest_author":"https://pith.science/pith/2AG4OY4VUB63KSHQV2B6MJMTGU/action/author_attestation","sign_citation":"https://pith.science/pith/2AG4OY4VUB63KSHQV2B6MJMTGU/action/citation_signature","submit_replication":"https://pith.science/pith/2AG4OY4VUB63KSHQV2B6MJMTGU/action/replication_record"}},"created_at":"2026-05-18T04:08:45.505150+00:00","updated_at":"2026-05-18T04:08:45.505150+00:00"}