{"paper":{"title":"Speed from Repetition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Shelby Kimmel","submitted_at":"2011-01-04T19:13:12Z","abstract_excerpt":"We present an oracle problem, which we call the Repeated Randomness problem, that a quantum algorithm can solve in one query, while any classical algorithm requires $\\Omega(\\log n)$ queries, where the oracle function has $2^n$ inputs. This problem has connections to the parity problem introduced by Bernstein and Vazirani \\cite{Bernstein1993} and to a variation of the NAND tree described by Zhan et al \\cite{Zhan}."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.0798","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"}