Multi-query quantum sums
David A. Meyer (1), James Pommersheim (1, 2) ((1) Mathematics, Department, UCSD, (2) Mathematics Department, Reed)

TL;DR
This paper generalizes quantum query algorithms from parity to sum problems over rac{k}{n} elements, showing that fewer entangled quantum queries can compute sums with high probability, extending quantum advantage in query complexity.
Contribution
It introduces a new quantum algorithm for sum computation over rac{k}{n} elements, demonstrating reduced query complexity compared to classical methods.
Findings
Quantum algorithms can compute sums with fewer queries than classical methods.
The proposed algorithm uses entangled, sequential, and adaptive queries similar to Grover's approach.
The success probability depends on the ratio rac{n}{r} and the size of the alphabet rac{k}{n}.
Abstract
PARITY is the problem of determining the parity of a string of bits given access to an oracle that responds to a query with the bit of the string, . Classically, queries are required to succeed with probability greater than 1/2 (assuming equal prior probabilities for all length bitstrings), but only quantum queries suffice to determine the parity with probability 1. We consider a generalization to strings of elements of and the problem of determining . By constructing an explicit algorithm, we show that () entangled quantum queries suffice to compute the sum correctly with worst case probability . This quantum algorithm utilizes the queries sequentially and adaptively, like Grover's algorithm, but in a different way that is not…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum-Dot Cellular Automata
