{"paper":{"title":"Fetching marked items from an unsorted database in NMR ensemble computing","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"G. L. Long, L. Xiao","submitted_at":"2001-12-26T06:30:28Z","abstract_excerpt":"Searching a marked item or several marked items from an unsorted database is a very difficult mathematical problem. Using classical computer, it requires $O(N=2^n)$ steps to find the target. Using a quantum computer, Grover's algorithm uses $O(\\sqrt{N=2^n})$ steps. In NMR ensemble computing, Brushweiler's algorithm uses $\\log N$ steps. In this Letter, we propose an algorithm that fetches marked items in an unsorted database directly. It requires only a single query. It can find a single marked item or multiple number of items."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0112162","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":""},"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"}