{"paper":{"title":"Multi-query quantum sums","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"2) ((1) Mathematics Department, (2) Mathematics Department, David A. Meyer (1), James Pommersheim (1, Reed), UCSD","submitted_at":"2011-07-11T05:55:09Z","abstract_excerpt":"PARITY is the problem of determining the parity of a string $f$ of $n$ bits given access to an oracle that responds to a query $x\\in\\{0,1,...,n-1\\}$ with the $x^{\\rm th}$ bit of the string, $f(x)$. Classically, $n$ queries are required to succeed with probability greater than 1/2 (assuming equal prior probabilities for all length $n$ bitstrings), but only $\\lceil n/2\\rceil$ quantum queries suffice to determine the parity with probability 1. We consider a generalization to strings $f$ of $n$ elements of $\\Z_k$ and the problem of determining $\\sum f(x)$. By constructing an explicit algorithm, we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1940","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"}