{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:KQ2FOJKO4W54FTCLPKB4LQW5QJ","short_pith_number":"pith:KQ2FOJKO","schema_version":"1.0","canonical_sha256":"543457254ee5bbc2cc4b7a83c5c2dd8240ea8eb74f748ac839e82802513d7696","source":{"kind":"arxiv","id":"quant-ph/0411204","version":5},"attestation_state":"computed","paper":{"title":"Robust Quantum Algorithms for Oracle Identification","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Akinori Kawachi, Andris Ambainis, Kazuo Iwama, Rudy Raymond, Shigeru Yamashita","submitted_at":"2004-11-30T03:17:02Z","abstract_excerpt":"The oracle identification problem (OIP) was introduced by Ambainis et al. \\cite{AIKMRY04}. It is given as a set $S$ of $M$ oracles and a blackbox oracle $f$. Our task is to figure out which oracle in $S$ is equal to the blackbox $f$ by making queries to $f$. OIP includes several problems such as the Grover Search as special cases. In this paper, we improve the algorithms in \\cite{AIKMRY04} by providing a mostly optimal upper bound of query complexity for this problem: ($i$) For any oracle set $S$ such that $|S| \\le 2^{N^d}$ ($d < 1$), we design an algorithm whose query complexity is $O(\\sqrt{N"},"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/0411204","kind":"arxiv","version":5},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2004-11-30T03:17:02Z","cross_cats_sorted":[],"title_canon_sha256":"ae37ac0f31b62fad3defa7a251f3403b4104ed50402294988d05206ece0484c8","abstract_canon_sha256":"7cc906335a56e267122c619c1a368e3e2c68190ac2586f5452e1a5cb4af3237f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:50:17.497959Z","signature_b64":"pn9tNajxG6zBYSANxD87V2h1wWQdx6Pvm0tZEvX/o4gPA526qTXybOqc6yiszi2Rn8/p+2VUohEh642t2UWYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"543457254ee5bbc2cc4b7a83c5c2dd8240ea8eb74f748ac839e82802513d7696","last_reissued_at":"2026-07-04T14:50:17.497608Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:50:17.497608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Quantum Algorithms for Oracle Identification","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Akinori Kawachi, Andris Ambainis, Kazuo Iwama, Rudy Raymond, Shigeru Yamashita","submitted_at":"2004-11-30T03:17:02Z","abstract_excerpt":"The oracle identification problem (OIP) was introduced by Ambainis et al. \\cite{AIKMRY04}. It is given as a set $S$ of $M$ oracles and a blackbox oracle $f$. Our task is to figure out which oracle in $S$ is equal to the blackbox $f$ by making queries to $f$. OIP includes several problems such as the Grover Search as special cases. In this paper, we improve the algorithms in \\cite{AIKMRY04} by providing a mostly optimal upper bound of query complexity for this problem: ($i$) For any oracle set $S$ such that $|S| \\le 2^{N^d}$ ($d < 1$), we design an algorithm whose query complexity is $O(\\sqrt{N"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0411204","kind":"arxiv","version":5},"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/0411204/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0411204","created_at":"2026-07-04T14:50:17.497663+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0411204v5","created_at":"2026-07-04T14:50:17.497663+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0411204","created_at":"2026-07-04T14:50:17.497663+00:00"},{"alias_kind":"pith_short_12","alias_value":"KQ2FOJKO4W54","created_at":"2026-07-04T14:50:17.497663+00:00"},{"alias_kind":"pith_short_16","alias_value":"KQ2FOJKO4W54FTCL","created_at":"2026-07-04T14:50:17.497663+00:00"},{"alias_kind":"pith_short_8","alias_value":"KQ2FOJKO","created_at":"2026-07-04T14:50:17.497663+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KQ2FOJKO4W54FTCLPKB4LQW5QJ","json":"https://pith.science/pith/KQ2FOJKO4W54FTCLPKB4LQW5QJ.json","graph_json":"https://pith.science/api/pith-number/KQ2FOJKO4W54FTCLPKB4LQW5QJ/graph.json","events_json":"https://pith.science/api/pith-number/KQ2FOJKO4W54FTCLPKB4LQW5QJ/events.json","paper":"https://pith.science/paper/KQ2FOJKO"},"agent_actions":{"view_html":"https://pith.science/pith/KQ2FOJKO4W54FTCLPKB4LQW5QJ","download_json":"https://pith.science/pith/KQ2FOJKO4W54FTCLPKB4LQW5QJ.json","view_paper":"https://pith.science/paper/KQ2FOJKO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0411204&json=true","fetch_graph":"https://pith.science/api/pith-number/KQ2FOJKO4W54FTCLPKB4LQW5QJ/graph.json","fetch_events":"https://pith.science/api/pith-number/KQ2FOJKO4W54FTCLPKB4LQW5QJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KQ2FOJKO4W54FTCLPKB4LQW5QJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KQ2FOJKO4W54FTCLPKB4LQW5QJ/action/storage_attestation","attest_author":"https://pith.science/pith/KQ2FOJKO4W54FTCLPKB4LQW5QJ/action/author_attestation","sign_citation":"https://pith.science/pith/KQ2FOJKO4W54FTCLPKB4LQW5QJ/action/citation_signature","submit_replication":"https://pith.science/pith/KQ2FOJKO4W54FTCLPKB4LQW5QJ/action/replication_record"}},"created_at":"2026-07-04T14:50:17.497663+00:00","updated_at":"2026-07-04T14:50:17.497663+00:00"}